/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe014_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:28:48,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:28:48,826 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:28:48,857 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:28:48,858 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:28:48,861 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:28:48,863 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:28:48,866 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:28:48,871 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:28:48,875 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:28:48,876 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:28:48,877 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:28:48,877 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:28:48,879 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:28:48,880 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:28:48,881 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:28:48,881 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:28:48,882 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:28:48,884 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:28:48,888 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:28:48,890 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:28:48,891 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:28:48,891 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:28:48,892 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:28:48,898 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:28:48,898 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:28:48,898 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:28:48,900 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:28:48,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:28:48,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:28:48,901 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:28:48,906 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:28:48,907 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:28:48,907 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:28:48,908 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:28:48,908 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:28:48,909 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:28:48,909 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:28:48,909 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:28:48,910 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:28:48,910 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:28:48,913 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:28:48,939 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:28:48,939 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:28:48,941 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:28:48,941 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:28:48,941 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:28:48,942 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:28:48,942 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:28:48,942 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:28:48,942 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:28:48,942 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:28:48,943 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:28:48,943 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:28:48,943 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:28:48,943 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:28:48,943 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:28:48,943 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:28:48,943 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:28:48,944 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:28:48,944 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:28:48,944 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:28:48,944 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:28:48,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:28:48,944 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:28:48,944 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:28:48,944 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:28:48,945 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:28:48,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:28:48,945 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:28:48,945 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-06 04:28:49,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:28:49,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:28:49,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:28:49,248 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:28:49,249 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:28:49,249 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe014_rmo.opt.i [2022-12-06 04:28:50,179 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:28:50,410 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:28:50,411 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe014_rmo.opt.i [2022-12-06 04:28:50,430 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70b573467/bdcc39b46c0b428cbb7ab2ffb710aac8/FLAGe49f2c346 [2022-12-06 04:28:50,450 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70b573467/bdcc39b46c0b428cbb7ab2ffb710aac8 [2022-12-06 04:28:50,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:28:50,453 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:28:50,455 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:28:50,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:28:50,457 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:28:50,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:28:50" (1/1) ... [2022-12-06 04:28:50,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a7cb172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:50, skipping insertion in model container [2022-12-06 04:28:50,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:28:50" (1/1) ... [2022-12-06 04:28:50,463 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:28:50,510 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:28:50,617 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/safe014_rmo.opt.i[992,1005] [2022-12-06 04:28:50,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:50,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:50,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:50,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:50,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:50,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:50,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:50,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:50,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:50,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:50,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:50,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:50,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:50,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:50,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:50,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:50,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:50,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:50,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:50,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:50,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:50,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:50,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:50,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:50,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:50,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:50,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:50,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:50,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:50,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:50,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:28:50,826 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:28:50,838 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/safe014_rmo.opt.i[992,1005] [2022-12-06 04:28:50,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:50,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:50,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:50,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:50,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:50,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:50,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:50,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:50,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:50,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:50,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:50,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:50,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:50,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:50,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:50,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:50,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:50,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:50,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:50,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:50,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:50,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:50,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:50,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:50,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:50,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:50,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:50,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:50,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:50,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:50,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:28:50,948 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:28:50,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:50 WrapperNode [2022-12-06 04:28:50,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:28:50,950 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:28:50,950 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:28:50,950 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:28:50,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:50" (1/1) ... [2022-12-06 04:28:50,984 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:50" (1/1) ... [2022-12-06 04:28:51,020 INFO L138 Inliner]: procedures = 176, calls = 82, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 167 [2022-12-06 04:28:51,020 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:28:51,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:28:51,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:28:51,022 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:28:51,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:50" (1/1) ... [2022-12-06 04:28:51,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:50" (1/1) ... [2022-12-06 04:28:51,042 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:50" (1/1) ... [2022-12-06 04:28:51,043 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:50" (1/1) ... [2022-12-06 04:28:51,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:50" (1/1) ... [2022-12-06 04:28:51,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:50" (1/1) ... [2022-12-06 04:28:51,057 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:50" (1/1) ... [2022-12-06 04:28:51,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:50" (1/1) ... [2022-12-06 04:28:51,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:28:51,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:28:51,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:28:51,077 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:28:51,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:50" (1/1) ... [2022-12-06 04:28:51,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:28:51,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:28:51,117 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-06 04:28:51,176 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-06 04:28:51,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:28:51,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:28:51,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:28:51,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:28:51,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:28:51,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:28:51,219 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:28:51,219 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:28:51,219 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:28:51,219 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:28:51,219 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:28:51,219 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:28:51,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:28:51,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:28:51,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:28:51,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:28:51,221 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:28:51,410 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:28:51,411 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:28:51,825 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:28:52,109 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:28:52,110 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:28:52,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:28:52 BoogieIcfgContainer [2022-12-06 04:28:52,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:28:52,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:28:52,114 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:28:52,116 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:28:52,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:28:50" (1/3) ... [2022-12-06 04:28:52,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@217cdea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:28:52, skipping insertion in model container [2022-12-06 04:28:52,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:50" (2/3) ... [2022-12-06 04:28:52,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@217cdea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:28:52, skipping insertion in model container [2022-12-06 04:28:52,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:28:52" (3/3) ... [2022-12-06 04:28:52,118 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_rmo.opt.i [2022-12-06 04:28:52,132 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:28:52,132 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 04:28:52,132 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:28:52,192 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:28:52,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-12-06 04:28:52,275 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-06 04:28:52,275 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:28:52,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-06 04:28:52,280 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2022-12-06 04:28:52,284 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 110 transitions, 229 flow [2022-12-06 04:28:52,285 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:52,310 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 110 transitions, 229 flow [2022-12-06 04:28:52,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 110 transitions, 229 flow [2022-12-06 04:28:52,359 INFO L130 PetriNetUnfolder]: 1/110 cut-off events. [2022-12-06 04:28:52,360 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:28:52,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 1/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-12-06 04:28:52,362 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 110 transitions, 229 flow [2022-12-06 04:28:52,362 INFO L188 LiptonReduction]: Number of co-enabled transitions 1212 [2022-12-06 04:29:00,076 INFO L203 LiptonReduction]: Total number of compositions: 91 [2022-12-06 04:29:00,087 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:29:00,092 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;@737f2fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:29:00,092 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 04:29:00,096 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2022-12-06 04:29:00,096 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:29:00,096 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:00,097 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:00,097 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:29:00,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:00,100 INFO L85 PathProgramCache]: Analyzing trace with hash -735046461, now seen corresponding path program 1 times [2022-12-06 04:29:00,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:00,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43898910] [2022-12-06 04:29:00,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:00,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:00,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:00,278 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-06 04:29:00,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:00,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43898910] [2022-12-06 04:29:00,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43898910] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:00,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:00,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:29:00,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876624012] [2022-12-06 04:29:00,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:00,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 04:29:00,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:00,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 04:29:00,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 04:29:00,308 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 04:29:00,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 51 flow. Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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-06 04:29:00,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:00,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 04:29:00,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:00,521 INFO L130 PetriNetUnfolder]: 567/896 cut-off events. [2022-12-06 04:29:00,522 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 04:29:00,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1807 conditions, 896 events. 567/896 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3795 event pairs, 567 based on Foata normal form. 0/880 useless extension candidates. Maximal degree in co-relation 1796. Up to 865 conditions per place. [2022-12-06 04:29:00,533 INFO L137 encePairwiseOnDemand]: 20/21 looper letters, 18 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2022-12-06 04:29:00,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 20 transitions, 85 flow [2022-12-06 04:29:00,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 04:29:00,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 04:29:00,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 23 transitions. [2022-12-06 04:29:00,541 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2022-12-06 04:29:00,542 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 51 flow. Second operand 2 states and 23 transitions. [2022-12-06 04:29:00,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 20 transitions, 85 flow [2022-12-06 04:29:00,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 20 transitions, 82 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:29:00,547 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 46 flow [2022-12-06 04:29:00,548 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=46, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2022-12-06 04:29:00,552 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2022-12-06 04:29:00,552 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:00,553 INFO L89 Accepts]: Start accepts. Operand has 28 places, 20 transitions, 46 flow [2022-12-06 04:29:00,555 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:00,555 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:00,555 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 20 transitions, 46 flow [2022-12-06 04:29:00,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 20 transitions, 46 flow [2022-12-06 04:29:00,565 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 04:29:00,565 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:29:00,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-06 04:29:00,565 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 20 transitions, 46 flow [2022-12-06 04:29:00,565 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-06 04:29:00,807 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:29:00,809 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 257 [2022-12-06 04:29:00,809 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 20 transitions, 46 flow [2022-12-06 04:29:00,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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-06 04:29:00,809 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:00,809 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:00,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:29:00,810 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:29:00,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:00,810 INFO L85 PathProgramCache]: Analyzing trace with hash -2005061444, now seen corresponding path program 1 times [2022-12-06 04:29:00,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:00,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348767402] [2022-12-06 04:29:00,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:00,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:01,295 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-06 04:29:01,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:01,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348767402] [2022-12-06 04:29:01,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348767402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:01,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:01,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:29:01,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637458712] [2022-12-06 04:29:01,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:01,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:29:01,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:01,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:29:01,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:29:01,299 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 04:29:01,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-06 04:29:01,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:01,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 04:29:01,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:01,451 INFO L130 PetriNetUnfolder]: 527/864 cut-off events. [2022-12-06 04:29:01,451 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:29:01,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1716 conditions, 864 events. 527/864 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3768 event pairs, 143 based on Foata normal form. 16/876 useless extension candidates. Maximal degree in co-relation 1708. Up to 609 conditions per place. [2022-12-06 04:29:01,455 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 24 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2022-12-06 04:29:01,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 28 transitions, 114 flow [2022-12-06 04:29:01,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:29:01,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:29:01,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-06 04:29:01,456 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 04:29:01,457 INFO L175 Difference]: Start difference. First operand has 27 places, 20 transitions, 46 flow. Second operand 3 states and 33 transitions. [2022-12-06 04:29:01,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 28 transitions, 114 flow [2022-12-06 04:29:01,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:29:01,458 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 54 flow [2022-12-06 04:29:01,458 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2022-12-06 04:29:01,459 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2022-12-06 04:29:01,459 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:01,459 INFO L89 Accepts]: Start accepts. Operand has 30 places, 20 transitions, 54 flow [2022-12-06 04:29:01,459 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:01,459 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:01,459 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 20 transitions, 54 flow [2022-12-06 04:29:01,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 20 transitions, 54 flow [2022-12-06 04:29:01,464 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 04:29:01,464 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:29:01,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:29:01,464 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 20 transitions, 54 flow [2022-12-06 04:29:01,464 INFO L188 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-06 04:29:01,504 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:29:01,505 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-06 04:29:01,505 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 54 flow [2022-12-06 04:29:01,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-06 04:29:01,505 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:01,505 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:01,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:29:01,506 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:29:01,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:01,506 INFO L85 PathProgramCache]: Analyzing trace with hash -2027364405, now seen corresponding path program 1 times [2022-12-06 04:29:01,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:01,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717710589] [2022-12-06 04:29:01,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:01,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:01,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-06 04:29:01,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:01,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717710589] [2022-12-06 04:29:01,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717710589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:01,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:01,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:29:01,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334407374] [2022-12-06 04:29:01,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:01,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:29:01,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:01,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:29:01,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:29:01,652 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 04:29:01,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 54 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-06 04:29:01,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:01,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 04:29:01,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:01,823 INFO L130 PetriNetUnfolder]: 498/772 cut-off events. [2022-12-06 04:29:01,823 INFO L131 PetriNetUnfolder]: For 87/87 co-relation queries the response was YES. [2022-12-06 04:29:01,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1718 conditions, 772 events. 498/772 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3472 event pairs, 87 based on Foata normal form. 12/780 useless extension candidates. Maximal degree in co-relation 1707. Up to 646 conditions per place. [2022-12-06 04:29:01,827 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 28 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2022-12-06 04:29:01,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 32 transitions, 145 flow [2022-12-06 04:29:01,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:29:01,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:29:01,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 04:29:01,828 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2022-12-06 04:29:01,828 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 54 flow. Second operand 3 states and 37 transitions. [2022-12-06 04:29:01,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 32 transitions, 145 flow [2022-12-06 04:29:01,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 32 transitions, 139 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:29:01,829 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 58 flow [2022-12-06 04:29:01,830 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2022-12-06 04:29:01,830 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2022-12-06 04:29:01,830 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:01,830 INFO L89 Accepts]: Start accepts. Operand has 31 places, 20 transitions, 58 flow [2022-12-06 04:29:01,831 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:01,831 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:01,831 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 20 transitions, 58 flow [2022-12-06 04:29:01,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 20 transitions, 58 flow [2022-12-06 04:29:01,835 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 04:29:01,835 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 04:29:01,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 20 events. 0/20 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:29:01,836 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 20 transitions, 58 flow [2022-12-06 04:29:01,836 INFO L188 LiptonReduction]: Number of co-enabled transitions 182 [2022-12-06 04:29:01,836 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:29:01,837 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 04:29:01,837 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 58 flow [2022-12-06 04:29:01,838 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-06 04:29:01,838 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:01,838 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:01,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:29:01,838 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:29:01,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:01,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1565948457, now seen corresponding path program 1 times [2022-12-06 04:29:01,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:01,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215022204] [2022-12-06 04:29:01,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:01,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:02,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:29:02,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:02,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215022204] [2022-12-06 04:29:02,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215022204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:02,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:02,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:29:02,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619041561] [2022-12-06 04:29:02,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:02,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:29:02,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:02,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:29:02,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:29:02,034 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 04:29:02,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 58 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-06 04:29:02,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:02,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 04:29:02,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:02,307 INFO L130 PetriNetUnfolder]: 791/1222 cut-off events. [2022-12-06 04:29:02,307 INFO L131 PetriNetUnfolder]: For 279/279 co-relation queries the response was YES. [2022-12-06 04:29:02,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2746 conditions, 1222 events. 791/1222 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5251 event pairs, 239 based on Foata normal form. 48/1265 useless extension candidates. Maximal degree in co-relation 2734. Up to 445 conditions per place. [2022-12-06 04:29:02,313 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 28 selfloop transitions, 3 changer transitions 5/37 dead transitions. [2022-12-06 04:29:02,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 37 transitions, 167 flow [2022-12-06 04:29:02,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:29:02,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:29:02,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-06 04:29:02,316 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.525 [2022-12-06 04:29:02,317 INFO L175 Difference]: Start difference. First operand has 31 places, 20 transitions, 58 flow. Second operand 4 states and 42 transitions. [2022-12-06 04:29:02,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 37 transitions, 167 flow [2022-12-06 04:29:02,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 37 transitions, 161 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:29:02,318 INFO L231 Difference]: Finished difference. Result has 34 places, 20 transitions, 68 flow [2022-12-06 04:29:02,318 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=34, PETRI_TRANSITIONS=20} [2022-12-06 04:29:02,319 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2022-12-06 04:29:02,319 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:02,320 INFO L89 Accepts]: Start accepts. Operand has 34 places, 20 transitions, 68 flow [2022-12-06 04:29:02,321 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:02,321 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:02,321 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 20 transitions, 68 flow [2022-12-06 04:29:02,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 20 transitions, 68 flow [2022-12-06 04:29:02,328 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 04:29:02,329 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 04:29:02,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 20 events. 0/20 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:29:02,329 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 20 transitions, 68 flow [2022-12-06 04:29:02,329 INFO L188 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-06 04:29:02,866 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [761] $Ultimate##0-->L828: Formula: (let ((.cse11 (= (mod v_~x$r_buff1_thd3~0_191 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_591 256) 0)) (.cse4 (= (mod v_~x$r_buff0_thd3~0_192 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_594 256) 0))) (let ((.cse14 (not .cse16)) (.cse5 (not .cse4)) (.cse15 (select |v_#memory_int_737| |v_~#x~0.base_350|)) (.cse6 (and .cse4 .cse13)) (.cse1 (and .cse11 .cse4)) (.cse7 (= (mod v_~weak$$choice2~0_272 256) 0))) (let ((.cse0 (not .cse7)) (.cse3 (= (mod v_~x$w_buff1_used~0_590 256) 0)) (.cse2 (= (mod v_~x$w_buff0_used~0_593 256) 0)) (.cse9 (or .cse16 .cse6 .cse1)) (.cse8 (select .cse15 |v_~#x~0.offset_350|)) (.cse10 (and .cse14 .cse5))) (and (= v_~weak$$choice2~0_272 |v_P2Thread1of1ForFork0_#t~nondet15_38|) (= (ite .cse0 v_~x$r_buff0_thd3~0_192 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~x$r_buff0_thd3~0_192 (ite (and (not .cse2) .cse5) 0 v_~x$r_buff0_thd3~0_192))) v_~x$r_buff0_thd3~0_191) (= (ite .cse0 v_~x$w_buff1_used~0_591 (ite (or .cse6 .cse1 .cse2) v_~x$w_buff1_used~0_591 0)) v_~x$w_buff1_used~0_590) (or (and (= |v_P2Thread1of1ForFork0_#t~mem20_38| |v_P2_#t~mem20_53|) (= |v_P2_#t~ite21_56| v_~x$mem_tmp~0_210) .cse0) (and (= |v_P2_#t~ite21_56| |v_P2_#t~mem20_53|) (= |v_P2_#t~mem20_53| v_~__unbuffered_p2_EAX~0_190) .cse7)) (= |v_P2Thread1of1ForFork0_#in~arg.offset_21| v_P2Thread1of1ForFork0_~arg.offset_21) (= .cse8 v_~x$mem_tmp~0_210) (= v_~x$w_buff0~0_393 v_~x$w_buff0~0_392) (= |v_~#x~0.base_350| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_99) (= v_~x$flush_delayed~0_258 0) (= (ite .cse0 v_~x$w_buff0_used~0_594 (ite .cse9 v_~x$w_buff0_used~0_594 (ite .cse10 0 v_~x$w_buff0_used~0_594))) v_~x$w_buff0_used~0_593) (= |v_P2Thread1of1ForFork0_#in~arg.base_21| v_P2Thread1of1ForFork0_~arg.base_21) (= v_~x$w_buff1~0_403 v_~x$w_buff1~0_402) (= |v_~#x~0.offset_350| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_99) (= (ite .cse0 v_~x$r_buff1_thd3~0_191 (ite (let ((.cse12 (= (mod v_~x$r_buff0_thd3~0_191 256) 0))) (or (and .cse11 .cse12) (and .cse3 .cse12) .cse2)) v_~x$r_buff1_thd3~0_191 0)) v_~x$r_buff1_thd3~0_190) (= |v_P2Thread1of1ForFork0_#t~nondet14_38| v_~weak$$choice0~0_187) (or (and .cse9 (= |v_P2_#t~mem17_57| .cse8) (= |v_P2_#t~mem17_57| v_~__unbuffered_p2_EAX~0_190)) (and (or (not .cse11) .cse5) (= |v_P2Thread1of1ForFork0_#t~mem17_38| |v_P2_#t~mem17_57|) (= (ite .cse10 v_~x$w_buff0~0_393 v_~x$w_buff1~0_403) v_~__unbuffered_p2_EAX~0_190) (or (not .cse13) .cse5) .cse14)) (= v_~__unbuffered_p2_EAX$read_delayed~0_96 1) (= v_~y~0_37 1) (= (store |v_#memory_int_737| |v_~#x~0.base_350| (store .cse15 |v_~#x~0.offset_350| |v_P2_#t~ite21_56|)) |v_#memory_int_736|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_393, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_21|, ~#x~0.offset=|v_~#x~0.offset_350|, ~x$w_buff1~0=v_~x$w_buff1~0_403, P2Thread1of1ForFork0_#t~mem17=|v_P2Thread1of1ForFork0_#t~mem17_38|, P2Thread1of1ForFork0_#t~nondet15=|v_P2Thread1of1ForFork0_#t~nondet15_38|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_191, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_591, P2Thread1of1ForFork0_#t~nondet14=|v_P2Thread1of1ForFork0_#t~nondet14_38|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_192, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_594, #memory_int=|v_#memory_int_737|, ~#x~0.base=|v_~#x~0.base_350|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_21|, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_38|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_392, P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_21|, P2Thread1of1ForFork0_#t~mem16=|v_P2Thread1of1ForFork0_#t~mem16_21|, ~x$flush_delayed~0=v_~x$flush_delayed~0_258, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_99, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_99, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_190, ~x$mem_tmp~0=v_~x$mem_tmp~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_191, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_21, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_190, ~y~0=v_~y~0_37, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_21|, ~#x~0.offset=|v_~#x~0.offset_350|, ~x$w_buff1~0=v_~x$w_buff1~0_402, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_590, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_96, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_593, ~weak$$choice0~0=v_~weak$$choice0~0_187, #memory_int=|v_#memory_int_736|, ~#x~0.base=|v_~#x~0.base_350|, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_21|, ~weak$$choice2~0=v_~weak$$choice2~0_272, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_21|} AuxVars[|v_P2_#t~mem17_57|, |v_P2_#t~ite21_56|, |v_P2_#t~mem20_53|] AssignedVars[~x$w_buff0~0, P2Thread1of1ForFork0_#t~mem19, P2Thread1of1ForFork0_#t~mem16, ~x$flush_delayed~0, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, ~__unbuffered_p2_EAX$read_delayed_var~0.base, P2Thread1of1ForFork0_#t~mem17, ~x$r_buff1_thd3~0, ~x$mem_tmp~0, ~x$r_buff0_thd3~0, P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_#t~ite21, ~__unbuffered_p2_EAX~0, ~y~0, ~x$w_buff1~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~nondet15, ~x$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet14, ~__unbuffered_p2_EAX$read_delayed~0, ~x$w_buff0_used~0, ~weak$$choice0~0, #memory_int, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, P2Thread1of1ForFork0_#t~mem20] and [702] $Ultimate##0-->L762: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_~y~0_11 v_~__unbuffered_p0_EAX~0_25) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_11} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_25, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_11, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_~arg.base] [2022-12-06 04:29:03,420 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:29:03,421 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1102 [2022-12-06 04:29:03,421 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 18 transitions, 64 flow [2022-12-06 04:29:03,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-06 04:29:03,422 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:03,422 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:03,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:29:03,422 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:29:03,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:03,422 INFO L85 PathProgramCache]: Analyzing trace with hash -2027323578, now seen corresponding path program 1 times [2022-12-06 04:29:03,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:03,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518295955] [2022-12-06 04:29:03,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:03,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:04,516 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-06 04:29:04,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:04,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518295955] [2022-12-06 04:29:04,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518295955] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:04,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:04,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:29:04,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228919868] [2022-12-06 04:29:04,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:04,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:29:04,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:04,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:29:04,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:29:04,523 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 04:29:04,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 18 transitions, 64 flow. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:29:04,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:04,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 04:29:04,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:04,644 INFO L130 PetriNetUnfolder]: 349/548 cut-off events. [2022-12-06 04:29:04,645 INFO L131 PetriNetUnfolder]: For 533/533 co-relation queries the response was YES. [2022-12-06 04:29:04,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1352 conditions, 548 events. 349/548 cut-off events. For 533/533 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2104 event pairs, 57 based on Foata normal form. 9/557 useless extension candidates. Maximal degree in co-relation 1338. Up to 484 conditions per place. [2022-12-06 04:29:04,648 INFO L137 encePairwiseOnDemand]: 15/18 looper letters, 25 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2022-12-06 04:29:04,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 27 transitions, 147 flow [2022-12-06 04:29:04,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:29:04,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:29:04,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-12-06 04:29:04,649 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2022-12-06 04:29:04,649 INFO L175 Difference]: Start difference. First operand has 32 places, 18 transitions, 64 flow. Second operand 3 states and 28 transitions. [2022-12-06 04:29:04,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 27 transitions, 147 flow [2022-12-06 04:29:04,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 27 transitions, 122 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-12-06 04:29:04,662 INFO L231 Difference]: Finished difference. Result has 29 places, 18 transitions, 54 flow [2022-12-06 04:29:04,662 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=29, PETRI_TRANSITIONS=18} [2022-12-06 04:29:04,664 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2022-12-06 04:29:04,664 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:04,664 INFO L89 Accepts]: Start accepts. Operand has 29 places, 18 transitions, 54 flow [2022-12-06 04:29:04,665 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:04,665 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:04,665 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 18 transitions, 54 flow [2022-12-06 04:29:04,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 18 transitions, 54 flow [2022-12-06 04:29:04,670 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-06 04:29:04,670 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 04:29:04,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 18 events. 0/18 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:29:04,670 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 18 transitions, 54 flow [2022-12-06 04:29:04,670 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-06 04:29:04,728 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:29:04,729 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-06 04:29:04,729 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 54 flow [2022-12-06 04:29:04,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:29:04,730 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:04,730 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:04,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:29:04,730 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:29:04,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:04,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1577479217, now seen corresponding path program 1 times [2022-12-06 04:29:04,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:04,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947215550] [2022-12-06 04:29:04,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:04,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:05,043 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-06 04:29:05,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:05,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947215550] [2022-12-06 04:29:05,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947215550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:05,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:05,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:29:05,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718206908] [2022-12-06 04:29:05,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:05,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:29:05,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:05,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:29:05,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:29:05,046 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 04:29:05,046 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 18 transitions, 54 flow. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:29:05,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:05,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 04:29:05,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:05,176 INFO L130 PetriNetUnfolder]: 409/639 cut-off events. [2022-12-06 04:29:05,176 INFO L131 PetriNetUnfolder]: For 136/136 co-relation queries the response was YES. [2022-12-06 04:29:05,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1471 conditions, 639 events. 409/639 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2339 event pairs, 305 based on Foata normal form. 9/648 useless extension candidates. Maximal degree in co-relation 1460. Up to 578 conditions per place. [2022-12-06 04:29:05,180 INFO L137 encePairwiseOnDemand]: 9/18 looper letters, 20 selfloop transitions, 8 changer transitions 0/28 dead transitions. [2022-12-06 04:29:05,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 28 transitions, 134 flow [2022-12-06 04:29:05,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:29:05,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:29:05,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-12-06 04:29:05,182 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2022-12-06 04:29:05,182 INFO L175 Difference]: Start difference. First operand has 29 places, 18 transitions, 54 flow. Second operand 4 states and 29 transitions. [2022-12-06 04:29:05,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 28 transitions, 134 flow [2022-12-06 04:29:05,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 28 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:29:05,185 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 101 flow [2022-12-06 04:29:05,185 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2022-12-06 04:29:05,187 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2022-12-06 04:29:05,187 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:05,187 INFO L89 Accepts]: Start accepts. Operand has 31 places, 24 transitions, 101 flow [2022-12-06 04:29:05,188 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:05,188 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:05,188 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 24 transitions, 101 flow [2022-12-06 04:29:05,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 101 flow [2022-12-06 04:29:05,207 INFO L130 PetriNetUnfolder]: 65/149 cut-off events. [2022-12-06 04:29:05,207 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-12-06 04:29:05,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 149 events. 65/149 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 589 event pairs, 39 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 338. Up to 105 conditions per place. [2022-12-06 04:29:05,208 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 24 transitions, 101 flow [2022-12-06 04:29:05,208 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 04:29:05,233 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [656] L828-->L835: Formula: (let ((.cse8 (= (mod v_~x$r_buff0_thd3~0_78 256) 0))) (let ((.cse1 (not .cse8)) (.cse10 (not (= (mod v_~x$w_buff0_used~0_235 256) 0))) (.cse3 (= (mod v_~x$w_buff1_used~0_235 256) 0)) (.cse2 (= (mod v_~x$r_buff1_thd3~0_77 256) 0)) (.cse9 (= (mod v_~x$w_buff0_used~0_236 256) 0))) (let ((.cse0 (not .cse9)) (.cse6 (not .cse2)) (.cse7 (not .cse3)) (.cse11 (and .cse1 .cse10)) (.cse4 (select |v_#memory_int_263| |v_~#x~0.base_174|))) (and (= v_~x$w_buff0_used~0_235 (ite (and .cse0 .cse1) 0 v_~x$w_buff0_used~0_236)) (let ((.cse5 (= |v_P2Thread1of1ForFork0_#t~mem22_1| |v_P2_#t~mem22_30|))) (or (and (or (and (or .cse2 .cse3) (= (select .cse4 |v_~#x~0.offset_174|) |v_P2_#t~mem22_30|) (= |v_P2_#t~ite23_29| |v_P2_#t~mem22_30|)) (and .cse5 (= |v_P2_#t~ite23_29| v_~x$w_buff1~0_122) .cse6 .cse7)) (= |v_P2_#t~ite24_25| |v_P2_#t~ite23_29|) (or .cse8 .cse9)) (and .cse5 (= |v_P2_#t~ite24_25| v_~x$w_buff0~0_114) (= |v_P2_#t~ite23_29| |v_P2Thread1of1ForFork0_#t~ite23_1|) .cse0 .cse1))) (= v_~x$r_buff1_thd3~0_76 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_77 256) 0)) .cse10) (and (not (= (mod v_~x$w_buff1_used~0_234 256) 0)) .cse6)) 0 v_~x$r_buff1_thd3~0_77)) (= v_~x$r_buff0_thd3~0_77 (ite .cse11 0 v_~x$r_buff0_thd3~0_78)) (= (ite (or (and .cse6 .cse7) .cse11) 0 v_~x$w_buff1_used~0_235) v_~x$w_buff1_used~0_234) (= (store |v_#memory_int_263| |v_~#x~0.base_174| (store .cse4 |v_~#x~0.offset_174| |v_P2_#t~ite24_25|)) |v_#memory_int_262|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_114, ~#x~0.offset=|v_~#x~0.offset_174|, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_1|, ~x$w_buff1~0=v_~x$w_buff1~0_122, #memory_int=|v_#memory_int_263|, ~#x~0.base=|v_~#x~0.base_174|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_77, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_235, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_1|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_78, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_236} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_114, ~#x~0.offset=|v_~#x~0.offset_174|, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_1|, ~x$w_buff1~0=v_~x$w_buff1~0_122, #memory_int=|v_#memory_int_262|, ~#x~0.base=|v_~#x~0.base_174|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_76, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_234, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_77, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_235} AuxVars[|v_P2_#t~ite24_25|, |v_P2_#t~mem22_30|, |v_P2_#t~ite23_29|] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem22, ~x$r_buff0_thd3~0, ~x$w_buff0_used~0] and [755] $Ultimate##0-->L789: Formula: (and (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|) (= (store |v_#memory_int_525| |v_~#x~0.base_272| (store (select |v_#memory_int_525| |v_~#x~0.base_272|) |v_~#x~0.offset_272| 1)) |v_#memory_int_524|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, ~#x~0.offset=|v_~#x~0.offset_272|, #memory_int=|v_#memory_int_525|, ~#x~0.base=|v_~#x~0.base_272|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, ~#x~0.offset=|v_~#x~0.offset_272|, #memory_int=|v_#memory_int_524|, ~#x~0.base=|v_~#x~0.base_272|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, #memory_int] [2022-12-06 04:29:05,514 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [642] L762-->L778: Formula: (let ((.cse6 (= (mod v_~x$w_buff1_used~0_223 256) 0)) (.cse4 (= (mod v_~x$r_buff1_thd1~0_46 256) 0)) (.cse11 (= (mod v_~x$r_buff0_thd1~0_49 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_224 256) 0))) (let ((.cse15 (select |v_#memory_int_251| |v_~#x~0.base_166|)) (.cse14 (= (mod v_~weak$$choice2~0_108 256) 0)) (.cse8 (not .cse16)) (.cse5 (not .cse11)) (.cse2 (and .cse11 .cse4)) (.cse3 (and .cse11 .cse6))) (let ((.cse9 (or .cse16 .cse2 .cse3)) (.cse7 (and .cse8 .cse5)) (.cse12 (= (mod v_~x$w_buff1_used~0_222 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_223 256) 0)) (.cse0 (not .cse14)) (.cse10 (select .cse15 |v_~#x~0.offset_166|))) (and (= v_~x$w_buff1~0_113 v_~x$w_buff1~0_112) (= v_~x$w_buff1_used~0_222 (ite .cse0 v_~x$w_buff1_used~0_223 (ite (or .cse1 .cse2 .cse3) v_~x$w_buff1_used~0_223 0))) (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_29) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_108) (or (and (or (not .cse4) .cse5) (or (not .cse6) .cse5) (= v_~__unbuffered_p0_EBX~0_18 (ite .cse7 v_~x$w_buff0~0_109 v_~x$w_buff1~0_113)) .cse8 (= |v_P0_#t~mem6_34| |v_P0Thread1of1ForFork1_#t~mem6_1|)) (and .cse9 (= .cse10 |v_P0_#t~mem6_34|) (= v_~__unbuffered_p0_EBX~0_18 |v_P0_#t~mem6_34|))) (= (ite .cse0 v_~x$r_buff0_thd1~0_49 (ite (or .cse1 .cse2 (and .cse11 .cse12)) v_~x$r_buff0_thd1~0_49 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_49))) v_~x$r_buff0_thd1~0_48) (= (ite .cse0 v_~x$w_buff0_used~0_224 (ite .cse9 v_~x$w_buff0_used~0_224 (ite .cse7 0 v_~x$w_buff0_used~0_224))) v_~x$w_buff0_used~0_223) (= v_~x$r_buff1_thd1~0_45 (ite .cse0 v_~x$r_buff1_thd1~0_46 (ite (let ((.cse13 (= (mod v_~x$r_buff0_thd1~0_48 256) 0))) (or (and .cse13 .cse12) .cse1 (and .cse13 .cse4))) v_~x$r_buff1_thd1~0_46 0))) (= v_~x$w_buff0~0_109 v_~x$w_buff0~0_108) (or (and (= v_~__unbuffered_p0_EBX~0_18 |v_P0_#t~mem9_32|) .cse14 (= |v_P0_#t~ite10_33| |v_P0_#t~mem9_32|)) (and .cse0 (= |v_P0_#t~ite10_33| v_~x$mem_tmp~0_46) (= |v_P0_#t~mem9_32| |v_P0Thread1of1ForFork1_#t~mem9_1|))) (= v_~x$mem_tmp~0_46 .cse10) (= (store |v_#memory_int_251| |v_~#x~0.base_166| (store .cse15 |v_~#x~0.offset_166| |v_P0_#t~ite10_33|)) |v_#memory_int_250|) (= v_~x$flush_delayed~0_84 0))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_109, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~#x~0.offset=|v_~#x~0.offset_166|, ~x$w_buff1~0=v_~x$w_buff1~0_113, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_223, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_46, P0Thread1of1ForFork1_#t~mem9=|v_P0Thread1of1ForFork1_#t~mem9_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_224, P0Thread1of1ForFork1_#t~mem6=|v_P0Thread1of1ForFork1_#t~mem6_1|, #memory_int=|v_#memory_int_251|, ~#x~0.base=|v_~#x~0.base_166|, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_108, P0Thread1of1ForFork1_#t~ite10=|v_P0Thread1of1ForFork1_#t~ite10_1|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_48, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_18, ~x$flush_delayed~0=v_~x$flush_delayed~0_84, ~#x~0.offset=|v_~#x~0.offset_166|, ~x$w_buff1~0=v_~x$w_buff1~0_112, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_222, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_45, ~x$mem_tmp~0=v_~x$mem_tmp~0_46, P0Thread1of1ForFork1_#t~mem8=|v_P0Thread1of1ForFork1_#t~mem8_1|, P0Thread1of1ForFork1_#t~mem5=|v_P0Thread1of1ForFork1_#t~mem5_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_223, ~weak$$choice0~0=v_~weak$$choice0~0_29, P0Thread1of1ForFork1_#t~ite7=|v_P0Thread1of1ForFork1_#t~ite7_1|, #memory_int=|v_#memory_int_250|, ~#x~0.base=|v_~#x~0.base_166|, ~weak$$choice2~0=v_~weak$$choice2~0_108} AuxVars[|v_P0_#t~mem9_32|, |v_P0_#t~ite10_33|, |v_P0_#t~mem6_34|] AssignedVars[~x$w_buff0~0, P0Thread1of1ForFork1_#t~ite10, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~mem9, ~x$mem_tmp~0, P0Thread1of1ForFork1_#t~mem8, P0Thread1of1ForFork1_#t~mem5, ~x$w_buff0_used~0, P0Thread1of1ForFork1_#t~mem6, ~weak$$choice0~0, P0Thread1of1ForFork1_#t~ite7, #memory_int, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4] and [755] $Ultimate##0-->L789: Formula: (and (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|) (= (store |v_#memory_int_525| |v_~#x~0.base_272| (store (select |v_#memory_int_525| |v_~#x~0.base_272|) |v_~#x~0.offset_272| 1)) |v_#memory_int_524|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, ~#x~0.offset=|v_~#x~0.offset_272|, #memory_int=|v_#memory_int_525|, ~#x~0.base=|v_~#x~0.base_272|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, ~#x~0.offset=|v_~#x~0.offset_272|, #memory_int=|v_#memory_int_524|, ~#x~0.base=|v_~#x~0.base_272|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, #memory_int] [2022-12-06 04:29:05,932 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [751] L855-3-->L857-2: Formula: (and (= |v_#pthreadsForks_44| (+ |v_#pthreadsForks_45| 1)) (= |v_ULTIMATE.start_main_~#t2114~0#1.offset_18| 0) (= (select |v_#valid_76| |v_ULTIMATE.start_main_~#t2114~0#1.base_18|) 0) (= |v_#memory_int_510| (store |v_#memory_int_511| |v_ULTIMATE.start_main_~#t2114~0#1.base_18| (store (select |v_#memory_int_511| |v_ULTIMATE.start_main_~#t2114~0#1.base_18|) |v_ULTIMATE.start_main_~#t2114~0#1.offset_18| |v_ULTIMATE.start_main_#t~pre29#1_37|))) (= |v_#length_68| (store |v_#length_69| |v_ULTIMATE.start_main_~#t2114~0#1.base_18| 4)) (= |v_#pthreadsForks_45| |v_ULTIMATE.start_main_#t~pre29#1_37|) (not (= |v_ULTIMATE.start_main_~#t2114~0#1.base_18| 0)) (< |v_#StackHeapBarrier_33| |v_ULTIMATE.start_main_~#t2114~0#1.base_18|) (= |v_#valid_75| (store |v_#valid_76| |v_ULTIMATE.start_main_~#t2114~0#1.base_18| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_33|, #pthreadsForks=|v_#pthreadsForks_45|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_511|, #length=|v_#length_69|} OutVars{ULTIMATE.start_main_~#t2114~0#1.offset=|v_ULTIMATE.start_main_~#t2114~0#1.offset_18|, #StackHeapBarrier=|v_#StackHeapBarrier_33|, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_37|, ULTIMATE.start_main_~#t2114~0#1.base=|v_ULTIMATE.start_main_~#t2114~0#1.base_18|, #pthreadsForks=|v_#pthreadsForks_44|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_510|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_27|, #length=|v_#length_68|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2114~0#1.offset, ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_~#t2114~0#1.base, #pthreadsForks, #valid, #memory_int, ULTIMATE.start_main_#t~pre27#1, #length, ULTIMATE.start_main_#t~nondet28#1] and [755] $Ultimate##0-->L789: Formula: (and (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|) (= (store |v_#memory_int_525| |v_~#x~0.base_272| (store (select |v_#memory_int_525| |v_~#x~0.base_272|) |v_~#x~0.offset_272| 1)) |v_#memory_int_524|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, ~#x~0.offset=|v_~#x~0.offset_272|, #memory_int=|v_#memory_int_525|, ~#x~0.base=|v_~#x~0.base_272|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, ~#x~0.offset=|v_~#x~0.offset_272|, #memory_int=|v_#memory_int_524|, ~#x~0.base=|v_~#x~0.base_272|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, #memory_int] [2022-12-06 04:29:06,003 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [648] L789-->L792: Formula: (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#x~0.base_9| (store (select |v_#memory_int_14| |v_~#x~0.base_9|) |v_~#x~0.offset_9| 2))) InVars {#memory_int=|v_#memory_int_14|, ~#x~0.base=|v_~#x~0.base_9|, ~#x~0.offset=|v_~#x~0.offset_9|} OutVars{#memory_int=|v_#memory_int_13|, ~#x~0.base=|v_~#x~0.base_9|, ~#x~0.offset=|v_~#x~0.offset_9|} AuxVars[] AssignedVars[#memory_int] and [755] $Ultimate##0-->L789: Formula: (and (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|) (= (store |v_#memory_int_525| |v_~#x~0.base_272| (store (select |v_#memory_int_525| |v_~#x~0.base_272|) |v_~#x~0.offset_272| 1)) |v_#memory_int_524|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, ~#x~0.offset=|v_~#x~0.offset_272|, #memory_int=|v_#memory_int_525|, ~#x~0.base=|v_~#x~0.base_272|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, ~#x~0.offset=|v_~#x~0.offset_272|, #memory_int=|v_#memory_int_524|, ~#x~0.base=|v_~#x~0.base_272|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, #memory_int] [2022-12-06 04:29:06,020 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [762] $Ultimate##0-->L762: Formula: (let ((.cse11 (= (mod v_~x$w_buff1_used~0_621 256) 0)) (.cse5 (= (mod v_~x$r_buff1_thd3~0_203 256) 0)) (.cse14 (= (mod v_~x$r_buff0_thd3~0_204 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_624 256) 0))) (let ((.cse3 (= (mod v_~weak$$choice2~0_284 256) 0)) (.cse12 (select |v_#memory_int_771| |v_~#x~0.base_362|)) (.cse9 (not .cse16)) (.cse10 (not .cse14)) (.cse13 (and .cse14 .cse5)) (.cse15 (and .cse14 .cse11))) (let ((.cse1 (or .cse13 .cse16 .cse15)) (.cse2 (and .cse9 .cse10)) (.cse8 (select .cse12 |v_~#x~0.offset_362|)) (.cse6 (= (mod v_~x$w_buff1_used~0_620 256) 0)) (.cse0 (not .cse3)) (.cse7 (= (mod v_~x$w_buff0_used~0_623 256) 0))) (and (= (ite .cse0 v_~x$w_buff0_used~0_624 (ite .cse1 v_~x$w_buff0_used~0_624 (ite .cse2 0 v_~x$w_buff0_used~0_624))) v_~x$w_buff0_used~0_623) (or (and (= |v_P2_#t~ite21_58| v_~x$mem_tmp~0_222) (= |v_P2Thread1of1ForFork0_#t~mem20_42| |v_P2_#t~mem20_55|) .cse0) (and (= |v_P2_#t~mem20_55| v_~__unbuffered_p2_EAX~0_192) .cse3 (= |v_P2_#t~ite21_58| |v_P2_#t~mem20_55|))) (= v_~weak$$choice2~0_284 |v_P2Thread1of1ForFork0_#t~nondet15_42|) (= v_~x$w_buff0~0_417 v_~x$w_buff0~0_416) (= v_~__unbuffered_p2_EAX$read_delayed_var~0.base_101 |v_~#x~0.base_362|) (= (ite .cse0 v_~x$r_buff1_thd3~0_203 (ite (let ((.cse4 (= (mod v_~x$r_buff0_thd3~0_203 256) 0))) (or (and .cse4 .cse5) (and .cse4 .cse6) .cse7)) v_~x$r_buff1_thd3~0_203 0)) v_~x$r_buff1_thd3~0_202) (= |v_~#x~0.offset_362| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_101) (= |v_P2Thread1of1ForFork0_#in~arg.base_23| v_P2Thread1of1ForFork0_~arg.base_23) (= v_~__unbuffered_p2_EAX$read_delayed~0_98 1) (or (and (= |v_P2_#t~mem17_59| v_~__unbuffered_p2_EAX~0_192) (= .cse8 |v_P2_#t~mem17_59|) .cse1) (and .cse9 (or .cse10 (not .cse5)) (or .cse10 (not .cse11)) (= (ite .cse2 v_~x$w_buff0~0_417 v_~x$w_buff1~0_427) v_~__unbuffered_p2_EAX~0_192) (= |v_P2Thread1of1ForFork0_#t~mem17_42| |v_P2_#t~mem17_59|))) (= v_~x$flush_delayed~0_270 0) (= v_~x$w_buff1~0_427 v_~x$w_buff1~0_426) (= .cse8 v_~x$mem_tmp~0_222) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_19) (= (store |v_#memory_int_771| |v_~#x~0.base_362| (store .cse12 |v_~#x~0.offset_362| |v_P2_#t~ite21_58|)) |v_#memory_int_770|) (= v_~y~0_39 v_~__unbuffered_p0_EAX~0_81) (= (ite .cse0 v_~x$r_buff0_thd3~0_204 (ite (or .cse13 (and .cse14 .cse6) .cse7) v_~x$r_buff0_thd3~0_204 (ite (and .cse10 (not .cse7)) 0 v_~x$r_buff0_thd3~0_204))) v_~x$r_buff0_thd3~0_203) (= v_~y~0_39 1) (= (ite .cse0 v_~x$w_buff1_used~0_621 (ite (or .cse13 .cse7 .cse15) v_~x$w_buff1_used~0_621 0)) v_~x$w_buff1_used~0_620) (= |v_P2Thread1of1ForFork0_#in~arg.offset_23| v_P2Thread1of1ForFork0_~arg.offset_23) (= |v_P2Thread1of1ForFork0_#t~nondet14_42| v_~weak$$choice0~0_199) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_19|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_417, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_23|, ~#x~0.offset=|v_~#x~0.offset_362|, ~x$w_buff1~0=v_~x$w_buff1~0_427, P2Thread1of1ForFork0_#t~mem17=|v_P2Thread1of1ForFork0_#t~mem17_42|, P2Thread1of1ForFork0_#t~nondet15=|v_P2Thread1of1ForFork0_#t~nondet15_42|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_203, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_621, P2Thread1of1ForFork0_#t~nondet14=|v_P2Thread1of1ForFork0_#t~nondet14_42|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_204, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_624, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, #memory_int=|v_#memory_int_771|, ~#x~0.base=|v_~#x~0.base_362|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_23|, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_42|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_416, P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_23|, P2Thread1of1ForFork0_#t~mem16=|v_P2Thread1of1ForFork0_#t~mem16_23|, ~x$flush_delayed~0=v_~x$flush_delayed~0_270, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_101, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_101, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_202, ~x$mem_tmp~0=v_~x$mem_tmp~0_222, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_203, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_81, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_23, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_23|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_192, ~y~0=v_~y~0_39, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_23|, ~#x~0.offset=|v_~#x~0.offset_362|, ~x$w_buff1~0=v_~x$w_buff1~0_426, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_620, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_98, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_623, ~weak$$choice0~0=v_~weak$$choice0~0_199, #memory_int=|v_#memory_int_770|, ~#x~0.base=|v_~#x~0.base_362|, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_23|, ~weak$$choice2~0=v_~weak$$choice2~0_284, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_23|} AuxVars[|v_P2_#t~mem17_59|, |v_P2_#t~mem20_55|, |v_P2_#t~ite21_58|] AssignedVars[~x$w_buff0~0, P2Thread1of1ForFork0_#t~mem19, P2Thread1of1ForFork0_#t~mem16, ~x$flush_delayed~0, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, ~__unbuffered_p2_EAX$read_delayed_var~0.base, P2Thread1of1ForFork0_#t~mem17, ~x$r_buff1_thd3~0, ~x$mem_tmp~0, ~x$r_buff0_thd3~0, P0Thread1of1ForFork1_~arg.base, ~__unbuffered_p0_EAX~0, P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_p2_EAX~0, ~y~0, ~x$w_buff1~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~nondet15, ~x$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet14, ~__unbuffered_p2_EAX$read_delayed~0, ~x$w_buff0_used~0, ~weak$$choice0~0, #memory_int, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, P2Thread1of1ForFork0_#t~mem20] and [755] $Ultimate##0-->L789: Formula: (and (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|) (= (store |v_#memory_int_525| |v_~#x~0.base_272| (store (select |v_#memory_int_525| |v_~#x~0.base_272|) |v_~#x~0.offset_272| 1)) |v_#memory_int_524|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, ~#x~0.offset=|v_~#x~0.offset_272|, #memory_int=|v_#memory_int_525|, ~#x~0.base=|v_~#x~0.base_272|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, ~#x~0.offset=|v_~#x~0.offset_272|, #memory_int=|v_#memory_int_524|, ~#x~0.base=|v_~#x~0.base_272|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, #memory_int] [2022-12-06 04:29:06,577 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [721] L3-->L868: Formula: (let ((.cse4 (= (mod v_~x$r_buff0_thd0~0_114 256) 0))) (let ((.cse3 (= (mod v_~x$w_buff0_used~0_320 256) 0)) (.cse6 (= (mod v_~x$r_buff1_thd0~0_113 256) 0)) (.cse5 (= (mod v_~x$w_buff1_used~0_317 256) 0)) (.cse9 (not .cse4)) (.cse11 (not (= (mod v_~x$w_buff0_used~0_319 256) 0)))) (let ((.cse0 (and .cse9 .cse11)) (.cse1 (not .cse5)) (.cse2 (not .cse6)) (.cse10 (not .cse3)) (.cse7 (select |v_#memory_int_379| |v_~#x~0.base_224|))) (and (= (ite .cse0 0 v_~x$r_buff0_thd0~0_114) v_~x$r_buff0_thd0~0_113) (= (ite (or .cse0 (and .cse1 .cse2)) 0 v_~x$w_buff1_used~0_317) v_~x$w_buff1_used~0_316) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~mem31#1_58| |v_ULTIMATE.start_main_#t~mem31#1_56|))) (or (and (or .cse3 .cse4) (or (and (or .cse5 .cse6) (= (select .cse7 |v_~#x~0.offset_224|) |v_ULTIMATE.start_main_#t~mem31#1_56|) (= |v_ULTIMATE.start_main_#t~mem31#1_56| |v_ULTIMATE.start_main_#t~ite32#1_53|)) (and (= v_~x$w_buff1~0_190 |v_ULTIMATE.start_main_#t~ite32#1_53|) .cse1 .cse8 .cse2)) (= |v_ULTIMATE.start_main_#t~ite33#1_44| |v_ULTIMATE.start_main_#t~ite32#1_53|)) (and .cse9 (= |v_ULTIMATE.start_main_#t~ite32#1_53| |v_ULTIMATE.start_main_#t~ite32#1_55|) .cse10 (= |v_ULTIMATE.start_main_#t~ite33#1_44| v_~x$w_buff0~0_178) .cse8))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| 0)) (= v_~x$r_buff1_thd0~0_112 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_316 256) 0)) .cse2) (and .cse11 (not (= (mod v_~x$r_buff0_thd0~0_113 256) 0)))) 0 v_~x$r_buff1_thd0~0_113)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|) (= (ite (and .cse9 .cse10) 0 v_~x$w_buff0_used~0_320) v_~x$w_buff0_used~0_319) (= |v_#memory_int_378| (store |v_#memory_int_379| |v_~#x~0.base_224| (store .cse7 |v_~#x~0.offset_224| |v_ULTIMATE.start_main_#t~ite33#1_44|))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_178, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_114, ~#x~0.offset=|v_~#x~0.offset_224|, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_58|, ~x$w_buff1~0=v_~x$w_buff1~0_190, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_55|, #memory_int=|v_#memory_int_379|, ~#x~0.base=|v_~#x~0.base_224|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_317, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_113, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_320, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_178, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_113, ~#x~0.offset=|v_~#x~0.offset_224|, ~x$w_buff1~0=v_~x$w_buff1~0_190, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_316, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_112, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_319, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_43|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, #memory_int=|v_#memory_int_378|, ~#x~0.base=|v_~#x~0.base_224|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|} AuxVars[|v_ULTIMATE.start_main_#t~mem31#1_56|, |v_ULTIMATE.start_main_#t~ite32#1_53|, |v_ULTIMATE.start_main_#t~ite33#1_44|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem31#1, ULTIMATE.start_main_#t~ite33#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite32#1, #memory_int, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [755] $Ultimate##0-->L789: Formula: (and (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|) (= (store |v_#memory_int_525| |v_~#x~0.base_272| (store (select |v_#memory_int_525| |v_~#x~0.base_272|) |v_~#x~0.offset_272| 1)) |v_#memory_int_524|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, ~#x~0.offset=|v_~#x~0.offset_272|, #memory_int=|v_#memory_int_525|, ~#x~0.base=|v_~#x~0.base_272|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, ~#x~0.offset=|v_~#x~0.offset_272|, #memory_int=|v_#memory_int_524|, ~#x~0.base=|v_~#x~0.base_272|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, #memory_int] [2022-12-06 04:29:06,909 ERROR L799 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-06 04:29:06,910 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:29:06,911 ERROR L123 eatedLiptonReduction]: Lipton reduction run adaptation of counterexample failed. [2022-12-06 04:29:06,911 INFO L89 Accepts]: Start accepts. Operand has 31 places, 24 transitions, 113 flow [2022-12-06 04:29:06,911 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:06,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:29:06,912 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction! at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 04:29:06,916 INFO L158 Benchmark]: Toolchain (without parser) took 16462.89ms. Allocated memory was 184.5MB in the beginning and 398.5MB in the end (delta: 213.9MB). Free memory was 159.0MB in the beginning and 279.0MB in the end (delta: -120.0MB). Peak memory consumption was 239.5MB. Max. memory is 8.0GB. [2022-12-06 04:29:06,916 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory was 105.1MB in the beginning and 105.1MB in the end (delta: 51.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:29:06,917 INFO L158 Benchmark]: CACSL2BoogieTranslator took 493.92ms. Allocated memory is still 184.5MB. Free memory was 159.0MB in the beginning and 160.5MB in the end (delta: -1.5MB). Peak memory consumption was 33.5MB. Max. memory is 8.0GB. [2022-12-06 04:29:06,917 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.62ms. Allocated memory is still 184.5MB. Free memory was 160.5MB in the beginning and 157.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:29:06,917 INFO L158 Benchmark]: Boogie Preprocessor took 54.32ms. Allocated memory is still 184.5MB. Free memory was 157.9MB in the beginning and 155.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:29:06,917 INFO L158 Benchmark]: RCFGBuilder took 1035.70ms. Allocated memory is still 184.5MB. Free memory was 155.3MB in the beginning and 125.5MB in the end (delta: 29.7MB). Peak memory consumption was 46.0MB. Max. memory is 8.0GB. [2022-12-06 04:29:06,917 INFO L158 Benchmark]: TraceAbstraction took 14802.07ms. Allocated memory was 184.5MB in the beginning and 398.5MB in the end (delta: 213.9MB). Free memory was 124.5MB in the beginning and 279.0MB in the end (delta: -154.5MB). Peak memory consumption was 204.1MB. Max. memory is 8.0GB. [2022-12-06 04:29:06,918 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.09ms. Allocated memory is still 127.9MB. Free memory was 105.1MB in the beginning and 105.1MB in the end (delta: 51.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 493.92ms. Allocated memory is still 184.5MB. Free memory was 159.0MB in the beginning and 160.5MB in the end (delta: -1.5MB). Peak memory consumption was 33.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.62ms. Allocated memory is still 184.5MB. Free memory was 160.5MB in the beginning and 157.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.32ms. Allocated memory is still 184.5MB. Free memory was 157.9MB in the beginning and 155.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1035.70ms. Allocated memory is still 184.5MB. Free memory was 155.3MB in the beginning and 125.5MB in the end (delta: 29.7MB). Peak memory consumption was 46.0MB. Max. memory is 8.0GB. * TraceAbstraction took 14802.07ms. Allocated memory was 184.5MB in the beginning and 398.5MB in the end (delta: 213.9MB). Free memory was 124.5MB in the beginning and 279.0MB in the end (delta: -154.5MB). Peak memory consumption was 204.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.7s, 119 PlacesBefore, 30 PlacesAfterwards, 110 TransitionsBefore, 21 TransitionsAfterwards, 1212 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 57 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 91 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 719, independent: 670, independent conditional: 670, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 719, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 719, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 719, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 656, independent: 626, independent conditional: 0, independent unconditional: 626, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 656, independent: 602, independent conditional: 0, independent unconditional: 602, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 54, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 341, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 299, dependent conditional: 0, dependent unconditional: 299, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 719, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 656, unknown conditional: 0, unknown unconditional: 656] , Statistics on independence cache: Total cache size (in pairs): 924, Positive cache size: 894, Positive conditional cache size: 0, Positive unconditional cache size: 894, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, 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.2s, 27 PlacesBefore, 27 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: 63, independent: 43, independent conditional: 43, 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: 63, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 63, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 63, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 59, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 59, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 22, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 237, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 233, dependent conditional: 0, dependent unconditional: 233, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 63, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 59, unknown conditional: 0, unknown unconditional: 59] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 41, Positive conditional cache size: 0, Positive unconditional cache size: 41, Negative cache size: 18, Negative conditional cache size: 0, 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, 30 PlacesBefore, 30 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, independent: 39, independent conditional: 39, 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: 57, independent: 39, independent conditional: 1, independent unconditional: 38, 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: 57, independent: 39, independent conditional: 0, independent unconditional: 39, 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: 57, independent: 39, independent conditional: 0, independent unconditional: 39, 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: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 57, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 43, Positive conditional cache size: 0, Positive unconditional cache size: 43, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 31 PlacesBefore, 31 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 182 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 48, independent: 31, independent conditional: 4, independent unconditional: 27, dependent: 17, dependent conditional: 2, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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: 48, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 44, Positive conditional cache size: 0, Positive unconditional cache size: 44, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 34 PlacesBefore, 32 PlacesAfterwards, 20 TransitionsBefore, 18 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 95, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 95, independent: 64, independent conditional: 19, independent unconditional: 45, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 95, independent: 64, independent conditional: 0, independent unconditional: 64, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 95, independent: 64, independent conditional: 0, independent unconditional: 64, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 89, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 95, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 24, unknown conditional: 0, unknown unconditional: 24] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 19, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 29 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 35, independent: 21, independent conditional: 4, independent unconditional: 17, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 35, independent: 21, independent conditional: 4, independent unconditional: 17, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35, independent: 21, independent conditional: 4, independent unconditional: 17, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 2, independent unconditional: 6, 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: 12, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 56, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 35, independent: 13, independent conditional: 2, independent unconditional: 11, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 12, unknown conditional: 2, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 105, Positive cache size: 70, Positive conditional cache size: 2, Positive unconditional cache size: 68, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, 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: 1.7s, 31 PlacesBefore, 31 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 64, independent: 56, independent conditional: 28, independent unconditional: 28, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 64, independent: 56, independent conditional: 4, independent unconditional: 52, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64, independent: 56, independent conditional: 4, independent unconditional: 52, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 2, 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: 10, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 64, independent: 47, independent conditional: 2, independent unconditional: 45, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 10, unknown conditional: 2, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 97, Positive conditional cache size: 4, Positive unconditional cache size: 93, 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: 24, Maximal queried relation: 0 - ExceptionOrErrorResult: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction!: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:132) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 04:29:06,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...