/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:20:06,631 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:20:06,634 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:20:06,673 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:20:06,673 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:20:06,676 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:20:06,679 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:20:06,683 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:20:06,687 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:20:06,691 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:20:06,692 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:20:06,694 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:20:06,694 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:20:06,696 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:20:06,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:20:06,700 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:20:06,700 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:20:06,701 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:20:06,703 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:20:06,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:20:06,709 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:20:06,710 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:20:06,710 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:20:06,711 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:20:06,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:20:06,718 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:20:06,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:20:06,719 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:20:06,720 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:20:06,720 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:20:06,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:20:06,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:20:06,727 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:20:06,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:20:06,728 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:20:06,728 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:20:06,729 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:20:06,729 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:20:06,729 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:20:06,730 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:20:06,730 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:20:06,731 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:20:06,761 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:20:06,762 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:20:06,764 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:20:06,764 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:20:06,764 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:20:06,765 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:20:06,765 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:20:06,765 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:20:06,765 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:20:06,765 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:20:06,766 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:20:06,766 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:20:06,766 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:20:06,766 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:20:06,766 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:20:06,766 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:20:06,767 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:20:06,767 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:20:06,767 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:20:06,767 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:20:06,767 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:20:06,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:20:06,767 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:20:06,767 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:20:06,767 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:20:06,768 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:20:06,768 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:20:06,768 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:20:06,768 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 06:20:07,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:20:07,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:20:07,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:20:07,105 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:20:07,106 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:20:07,107 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_tso.i [2022-12-06 06:20:08,297 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:20:08,546 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:20:08,547 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_tso.i [2022-12-06 06:20:08,556 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33e3ec366/457bafb7d766487099c3e2fa42d820e4/FLAG4a8b1e03b [2022-12-06 06:20:08,566 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33e3ec366/457bafb7d766487099c3e2fa42d820e4 [2022-12-06 06:20:08,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:20:08,571 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:20:08,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:20:08,572 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:20:08,574 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:20:08,575 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:20:08" (1/1) ... [2022-12-06 06:20:08,576 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@335802e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:08, skipping insertion in model container [2022-12-06 06:20:08,576 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:20:08" (1/1) ... [2022-12-06 06:20:08,581 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:20:08,640 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:20:08,777 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/mix022_tso.i[944,957] [2022-12-06 06:20:08,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:08,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:08,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:08,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:08,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:08,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:08,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:08,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:08,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:08,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:08,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:08,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:08,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:08,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:08,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:08,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:08,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:08,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:08,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:08,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:08,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:08,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:08,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:08,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:08,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:20:08,957 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:20:08,967 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/mix022_tso.i[944,957] [2022-12-06 06:20:08,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:08,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:08,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:08,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:08,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:08,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:08,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:08,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:08,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:09,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:09,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:09,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:09,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:09,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:09,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:09,020 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:09,020 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:09,020 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:09,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:09,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:09,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:09,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:09,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:09,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:09,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:20:09,057 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:20:09,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:09 WrapperNode [2022-12-06 06:20:09,058 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:20:09,059 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:20:09,059 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:20:09,059 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:20:09,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:09" (1/1) ... [2022-12-06 06:20:09,075 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:09" (1/1) ... [2022-12-06 06:20:09,109 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-12-06 06:20:09,109 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:20:09,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:20:09,110 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:20:09,110 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:20:09,116 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:09" (1/1) ... [2022-12-06 06:20:09,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:09" (1/1) ... [2022-12-06 06:20:09,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:09" (1/1) ... [2022-12-06 06:20:09,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:09" (1/1) ... [2022-12-06 06:20:09,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:09" (1/1) ... [2022-12-06 06:20:09,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:09" (1/1) ... [2022-12-06 06:20:09,126 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:09" (1/1) ... [2022-12-06 06:20:09,141 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:09" (1/1) ... [2022-12-06 06:20:09,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:20:09,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:20:09,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:20:09,144 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:20:09,151 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:09" (1/1) ... [2022-12-06 06:20:09,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:20:09,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:20:09,175 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 06:20:09,182 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 06:20:09,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:20:09,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:20:09,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:20:09,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:20:09,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:20:09,207 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:20:09,207 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:20:09,207 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:20:09,207 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:20:09,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:20:09,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:20:09,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:20:09,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:20:09,212 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 06:20:09,328 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:20:09,330 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:20:09,637 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:20:09,743 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:20:09,744 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:20:09,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:20:09 BoogieIcfgContainer [2022-12-06 06:20:09,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:20:09,747 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:20:09,747 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:20:09,749 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:20:09,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:20:08" (1/3) ... [2022-12-06 06:20:09,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420a30f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:20:09, skipping insertion in model container [2022-12-06 06:20:09,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:09" (2/3) ... [2022-12-06 06:20:09,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420a30f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:20:09, skipping insertion in model container [2022-12-06 06:20:09,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:20:09" (3/3) ... [2022-12-06 06:20:09,752 INFO L112 eAbstractionObserver]: Analyzing ICFG mix022_tso.i [2022-12-06 06:20:09,764 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:20:09,765 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:20:09,765 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:20:09,798 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:20:09,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 188 flow [2022-12-06 06:20:09,866 INFO L130 PetriNetUnfolder]: 2/87 cut-off events. [2022-12-06 06:20:09,866 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:20:09,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-06 06:20:09,871 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 89 transitions, 188 flow [2022-12-06 06:20:09,874 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 87 transitions, 180 flow [2022-12-06 06:20:09,875 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:20:09,890 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 87 transitions, 180 flow [2022-12-06 06:20:09,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 87 transitions, 180 flow [2022-12-06 06:20:09,920 INFO L130 PetriNetUnfolder]: 2/87 cut-off events. [2022-12-06 06:20:09,921 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:20:09,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-06 06:20:09,924 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 87 transitions, 180 flow [2022-12-06 06:20:09,924 INFO L188 LiptonReduction]: Number of co-enabled transitions 1088 [2022-12-06 06:20:13,822 INFO L203 LiptonReduction]: Total number of compositions: 69 [2022-12-06 06:20:13,832 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:20:13,837 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;@69c3c740, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:20:13,837 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 06:20:13,840 INFO L130 PetriNetUnfolder]: 1/10 cut-off events. [2022-12-06 06:20:13,840 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:20:13,840 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:20:13,840 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 06:20:13,840 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:20:13,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:20:13,843 INFO L85 PathProgramCache]: Analyzing trace with hash 416406035, now seen corresponding path program 1 times [2022-12-06 06:20:13,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:20:13,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848041410] [2022-12-06 06:20:13,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:13,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:20:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:20:14,097 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 06:20:14,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:20:14,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848041410] [2022-12-06 06:20:14,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848041410] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:20:14,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:20:14,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:20:14,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964499990] [2022-12-06 06:20:14,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:20:14,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:20:14,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:20:14,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:20:14,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:20:14,140 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 06:20:14,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:14,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:20:14,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 06:20:14,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:20:14,245 INFO L130 PetriNetUnfolder]: 173/327 cut-off events. [2022-12-06 06:20:14,245 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 06:20:14,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 327 events. 173/327 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1369 event pairs, 21 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 633. Up to 249 conditions per place. [2022-12-06 06:20:14,248 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 18 selfloop transitions, 2 changer transitions 4/26 dead transitions. [2022-12-06 06:20:14,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 106 flow [2022-12-06 06:20:14,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:20:14,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:20:14,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 06:20:14,261 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 06:20:14,262 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states and 35 transitions. [2022-12-06 06:20:14,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 106 flow [2022-12-06 06:20:14,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:20:14,264 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2022-12-06 06:20:14,266 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, 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=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2022-12-06 06:20:14,268 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -2 predicate places. [2022-12-06 06:20:14,268 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:20:14,268 INFO L89 Accepts]: Start accepts. Operand has 25 places, 16 transitions, 40 flow [2022-12-06 06:20:14,271 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:20:14,271 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:20:14,271 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 16 transitions, 40 flow [2022-12-06 06:20:14,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 40 flow [2022-12-06 06:20:14,275 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-06 06:20:14,275 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:20:14,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 16 events. 0/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:20:14,276 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 40 flow [2022-12-06 06:20:14,276 INFO L188 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-06 06:20:14,307 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:20:14,308 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-06 06:20:14,309 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 16 transitions, 40 flow [2022-12-06 06:20:14,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:14,309 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:20:14,309 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:20:14,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:20:14,309 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:20:14,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:20:14,310 INFO L85 PathProgramCache]: Analyzing trace with hash 734234316, now seen corresponding path program 1 times [2022-12-06 06:20:14,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:20:14,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213627042] [2022-12-06 06:20:14,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:14,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:20:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:20:14,603 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 06:20:14,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:20:14,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213627042] [2022-12-06 06:20:14,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213627042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:20:14,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:20:14,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:20:14,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569466531] [2022-12-06 06:20:14,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:20:14,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:20:14,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:20:14,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:20:14,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:20:14,605 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 06:20:14,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 16 transitions, 40 flow. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 06:20:14,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:20:14,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 06:20:14,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:20:14,700 INFO L130 PetriNetUnfolder]: 157/278 cut-off events. [2022-12-06 06:20:14,700 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 06:20:14,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 587 conditions, 278 events. 157/278 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 871 event pairs, 53 based on Foata normal form. 10/288 useless extension candidates. Maximal degree in co-relation 577. Up to 200 conditions per place. [2022-12-06 06:20:14,702 INFO L137 encePairwiseOnDemand]: 13/16 looper letters, 20 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2022-12-06 06:20:14,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 22 transitions, 96 flow [2022-12-06 06:20:14,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:20:14,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:20:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 06:20:14,703 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2022-12-06 06:20:14,703 INFO L175 Difference]: Start difference. First operand has 23 places, 16 transitions, 40 flow. Second operand 3 states and 23 transitions. [2022-12-06 06:20:14,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 22 transitions, 96 flow [2022-12-06 06:20:14,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 22 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:20:14,704 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 44 flow [2022-12-06 06:20:14,704 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2022-12-06 06:20:14,705 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -3 predicate places. [2022-12-06 06:20:14,705 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:20:14,705 INFO L89 Accepts]: Start accepts. Operand has 24 places, 16 transitions, 44 flow [2022-12-06 06:20:14,706 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:20:14,706 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:20:14,706 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 16 transitions, 44 flow [2022-12-06 06:20:14,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 16 transitions, 44 flow [2022-12-06 06:20:14,709 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-06 06:20:14,709 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:20:14,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 16 events. 0/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:20:14,710 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 16 transitions, 44 flow [2022-12-06 06:20:14,710 INFO L188 LiptonReduction]: Number of co-enabled transitions 106 [2022-12-06 06:20:14,719 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:20:14,720 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 06:20:14,720 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 44 flow [2022-12-06 06:20:14,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 06:20:14,720 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:20:14,720 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:20:14,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:20:14,720 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:20:14,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:20:14,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1224777195, now seen corresponding path program 1 times [2022-12-06 06:20:14,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:20:14,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055046278] [2022-12-06 06:20:14,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:14,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:20:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:20:14,928 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 06:20:14,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:20:14,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055046278] [2022-12-06 06:20:14,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055046278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:20:14,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:20:14,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:20:14,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523571601] [2022-12-06 06:20:14,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:20:14,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:20:14,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:20:14,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:20:14,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:20:14,932 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 16 [2022-12-06 06:20:14,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:14,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:20:14,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 16 [2022-12-06 06:20:14,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:20:14,995 INFO L130 PetriNetUnfolder]: 60/138 cut-off events. [2022-12-06 06:20:14,996 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 06:20:14,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 138 events. 60/138 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 480 event pairs, 27 based on Foata normal form. 20/157 useless extension candidates. Maximal degree in co-relation 299. Up to 58 conditions per place. [2022-12-06 06:20:14,998 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 26 selfloop transitions, 4 changer transitions 1/33 dead transitions. [2022-12-06 06:20:14,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 33 transitions, 148 flow [2022-12-06 06:20:14,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:20:14,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:20:15,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 06:20:15,001 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.640625 [2022-12-06 06:20:15,001 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 44 flow. Second operand 4 states and 41 transitions. [2022-12-06 06:20:15,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 33 transitions, 148 flow [2022-12-06 06:20:15,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 33 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:20:15,004 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 66 flow [2022-12-06 06:20:15,007 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=66, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2022-12-06 06:20:15,008 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 0 predicate places. [2022-12-06 06:20:15,008 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:20:15,008 INFO L89 Accepts]: Start accepts. Operand has 27 places, 18 transitions, 66 flow [2022-12-06 06:20:15,009 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:20:15,009 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:20:15,009 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 18 transitions, 66 flow [2022-12-06 06:20:15,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 18 transitions, 66 flow [2022-12-06 06:20:15,014 INFO L130 PetriNetUnfolder]: 3/25 cut-off events. [2022-12-06 06:20:15,014 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:20:15,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 25 events. 3/25 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 1 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 47. Up to 10 conditions per place. [2022-12-06 06:20:15,015 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 18 transitions, 66 flow [2022-12-06 06:20:15,015 INFO L188 LiptonReduction]: Number of co-enabled transitions 100 [2022-12-06 06:20:15,070 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:20:15,071 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-06 06:20:15,071 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 66 flow [2022-12-06 06:20:15,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:15,072 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:20:15,072 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:20:15,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:20:15,072 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:20:15,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:20:15,072 INFO L85 PathProgramCache]: Analyzing trace with hash 433844367, now seen corresponding path program 1 times [2022-12-06 06:20:15,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:20:15,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978906735] [2022-12-06 06:20:15,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:15,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:20:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:20:15,315 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 06:20:15,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:20:15,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978906735] [2022-12-06 06:20:15,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978906735] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:20:15,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:20:15,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:20:15,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317536273] [2022-12-06 06:20:15,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:20:15,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:20:15,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:20:15,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:20:15,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:20:15,317 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 16 [2022-12-06 06:20:15,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:15,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:20:15,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 16 [2022-12-06 06:20:15,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:20:15,375 INFO L130 PetriNetUnfolder]: 24/68 cut-off events. [2022-12-06 06:20:15,375 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-06 06:20:15,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 68 events. 24/68 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 174 event pairs, 10 based on Foata normal form. 8/75 useless extension candidates. Maximal degree in co-relation 182. Up to 29 conditions per place. [2022-12-06 06:20:15,375 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 17 selfloop transitions, 6 changer transitions 1/26 dead transitions. [2022-12-06 06:20:15,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 26 transitions, 136 flow [2022-12-06 06:20:15,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:20:15,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:20:15,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-06 06:20:15,376 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-06 06:20:15,376 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 66 flow. Second operand 5 states and 36 transitions. [2022-12-06 06:20:15,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 26 transitions, 136 flow [2022-12-06 06:20:15,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 26 transitions, 122 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 06:20:15,378 INFO L231 Difference]: Finished difference. Result has 30 places, 18 transitions, 78 flow [2022-12-06 06:20:15,378 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=78, PETRI_PLACES=30, PETRI_TRANSITIONS=18} [2022-12-06 06:20:15,378 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 3 predicate places. [2022-12-06 06:20:15,378 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:20:15,378 INFO L89 Accepts]: Start accepts. Operand has 30 places, 18 transitions, 78 flow [2022-12-06 06:20:15,379 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:20:15,379 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:20:15,379 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 18 transitions, 78 flow [2022-12-06 06:20:15,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 18 transitions, 78 flow [2022-12-06 06:20:15,382 INFO L130 PetriNetUnfolder]: 1/18 cut-off events. [2022-12-06 06:20:15,383 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 06:20:15,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 18 events. 1/18 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 9 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 35. Up to 6 conditions per place. [2022-12-06 06:20:15,383 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 18 transitions, 78 flow [2022-12-06 06:20:15,383 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-06 06:20:15,982 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [383] L793-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_50 1) v_~__unbuffered_cnt~0_49) (= |v_P1Thread1of1ForFork1_#res#1.base_9| 0) (= |v_P1Thread1of1ForFork1_#res#1.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P1Thread1of1ForFork1_#res#1.base=|v_P1Thread1of1ForFork1_#res#1.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#res#1.offset=|v_P1Thread1of1ForFork1_#res#1.offset_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res#1.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res#1.offset] and [375] L813-3-->L816: Formula: (= (ite (= (ite (= 2 v_~__unbuffered_cnt~0_31) 1 0) 0) 0 1) v_~main$tmp_guard0~0_24) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0] [2022-12-06 06:20:16,000 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [380] L749-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.offset_11|) (= |v_P0Thread1of1ForFork0_#res.base_11| 0) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_11|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] and [375] L813-3-->L816: Formula: (= (ite (= (ite (= 2 v_~__unbuffered_cnt~0_31) 1 0) 0) 0 1) v_~main$tmp_guard0~0_24) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0] [2022-12-06 06:20:47,006 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:20:47,007 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31629 [2022-12-06 06:20:47,007 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 15 transitions, 70 flow [2022-12-06 06:20:47,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:47,007 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:20:47,007 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:20:47,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:20:47,008 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:20:47,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:20:47,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1220169251, now seen corresponding path program 1 times [2022-12-06 06:20:47,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:20:47,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043119290] [2022-12-06 06:20:47,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:47,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:20:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:21:15,130 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 06:21:15,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:21:15,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043119290] [2022-12-06 06:21:15,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043119290] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:21:15,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:21:15,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:21:15,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888075692] [2022-12-06 06:21:15,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:21:15,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:21:15,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:21:15,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:21:15,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:21:15,131 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 06:21:15,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 15 transitions, 70 flow. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:21:15,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:21:15,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 06:21:15,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:21:15,257 INFO L130 PetriNetUnfolder]: 32/84 cut-off events. [2022-12-06 06:21:15,257 INFO L131 PetriNetUnfolder]: For 95/95 co-relation queries the response was YES. [2022-12-06 06:21:15,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 84 events. 32/84 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 237 event pairs, 2 based on Foata normal form. 2/86 useless extension candidates. Maximal degree in co-relation 232. Up to 46 conditions per place. [2022-12-06 06:21:15,258 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 14 selfloop transitions, 3 changer transitions 16/33 dead transitions. [2022-12-06 06:21:15,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 194 flow [2022-12-06 06:21:15,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:21:15,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:21:15,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-12-06 06:21:15,259 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-06 06:21:15,259 INFO L175 Difference]: Start difference. First operand has 27 places, 15 transitions, 70 flow. Second operand 6 states and 35 transitions. [2022-12-06 06:21:15,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 194 flow [2022-12-06 06:21:15,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 33 transitions, 157 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-12-06 06:21:15,260 INFO L231 Difference]: Finished difference. Result has 29 places, 15 transitions, 60 flow [2022-12-06 06:21:15,260 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=45, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=60, PETRI_PLACES=29, PETRI_TRANSITIONS=15} [2022-12-06 06:21:15,261 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2022-12-06 06:21:15,261 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:21:15,261 INFO L89 Accepts]: Start accepts. Operand has 29 places, 15 transitions, 60 flow [2022-12-06 06:21:15,261 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:21:15,261 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:21:15,261 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 15 transitions, 60 flow [2022-12-06 06:21:15,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 15 transitions, 60 flow [2022-12-06 06:21:15,265 INFO L130 PetriNetUnfolder]: 1/19 cut-off events. [2022-12-06 06:21:15,265 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 06:21:15,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 19 events. 1/19 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 32. Up to 3 conditions per place. [2022-12-06 06:21:15,265 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 15 transitions, 60 flow [2022-12-06 06:21:15,265 INFO L188 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-06 06:21:15,322 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:21:15,323 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-06 06:21:15,323 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 14 transitions, 58 flow [2022-12-06 06:21:15,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:21:15,323 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:21:15,324 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:21:15,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:21:15,324 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:21:15,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:21:15,324 INFO L85 PathProgramCache]: Analyzing trace with hash 433882326, now seen corresponding path program 1 times [2022-12-06 06:21:15,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:21:15,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274401916] [2022-12-06 06:21:15,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:21:15,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:21:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:21:16,023 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 06:21:16,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:21:16,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274401916] [2022-12-06 06:21:16,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274401916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:21:16,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:21:16,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:21:16,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133903418] [2022-12-06 06:21:16,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:21:16,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:21:16,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:21:16,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:21:16,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:21:16,024 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 14 [2022-12-06 06:21:16,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 14 transitions, 58 flow. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:21:16,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:21:16,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 14 [2022-12-06 06:21:16,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:21:16,229 INFO L130 PetriNetUnfolder]: 8/40 cut-off events. [2022-12-06 06:21:16,229 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-12-06 06:21:16,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 40 events. 8/40 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 103 event pairs, 0 based on Foata normal form. 2/42 useless extension candidates. Maximal degree in co-relation 107. Up to 13 conditions per place. [2022-12-06 06:21:16,230 INFO L137 encePairwiseOnDemand]: 6/14 looper letters, 9 selfloop transitions, 7 changer transitions 8/25 dead transitions. [2022-12-06 06:21:16,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 143 flow [2022-12-06 06:21:16,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:21:16,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:21:16,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2022-12-06 06:21:16,231 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.336734693877551 [2022-12-06 06:21:16,231 INFO L175 Difference]: Start difference. First operand has 26 places, 14 transitions, 58 flow. Second operand 7 states and 33 transitions. [2022-12-06 06:21:16,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 143 flow [2022-12-06 06:21:16,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 25 transitions, 128 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-06 06:21:16,232 INFO L231 Difference]: Finished difference. Result has 30 places, 16 transitions, 76 flow [2022-12-06 06:21:16,233 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=76, PETRI_PLACES=30, PETRI_TRANSITIONS=16} [2022-12-06 06:21:16,233 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 3 predicate places. [2022-12-06 06:21:16,233 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:21:16,233 INFO L89 Accepts]: Start accepts. Operand has 30 places, 16 transitions, 76 flow [2022-12-06 06:21:16,234 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:21:16,234 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:21:16,234 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 16 transitions, 76 flow [2022-12-06 06:21:16,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 16 transitions, 76 flow [2022-12-06 06:21:16,237 INFO L130 PetriNetUnfolder]: 2/20 cut-off events. [2022-12-06 06:21:16,237 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 06:21:16,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 20 events. 2/20 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 22 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 44. Up to 5 conditions per place. [2022-12-06 06:21:16,238 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 16 transitions, 76 flow [2022-12-06 06:21:16,238 INFO L188 LiptonReduction]: Number of co-enabled transitions 4 [2022-12-06 06:21:16,831 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [419] $Ultimate##0-->L749: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd1~0_143 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_560 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_138 256) 0)))) (let ((.cse2 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_561 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_509 256) 0)) .cse4))) (and (= v_P0Thread1of1ForFork0_~arg.base_19 |v_P0Thread1of1ForFork0_#in~arg.base_19|) (= v_~y~0_38 1) (= v_P0Thread1of1ForFork0_~arg.offset_19 |v_P0Thread1of1ForFork0_#in~arg.offset_19|) (= (ite .cse0 0 v_~x$w_buff0_used~0_561) v_~x$w_buff0_used~0_560) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_509) v_~x$w_buff1_used~0_508) (= (ite .cse2 0 v_~x$r_buff0_thd1~0_138) v_~x$r_buff0_thd1~0_137) (= v_~x$r_buff1_thd1~0_142 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_137 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_508 256) 0)))) 0 v_~x$r_buff1_thd1~0_143)) (= (ite .cse0 v_~x$w_buff0~0_373 (ite .cse1 v_~x$w_buff1~0_343 1)) v_~x~0_480)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_373, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_138, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_19|, ~x$w_buff1~0=v_~x$w_buff1~0_343, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_19|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_509, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_143, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_561} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_373, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_137, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_19|, ~x$w_buff1~0=v_~x$w_buff1~0_343, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_19|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_508, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_142, ~y~0=v_~y~0_38, ~x~0=v_~x~0_480, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_19, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_560} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~y~0, ~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset, ~x$w_buff0_used~0] and [319] L786-->L793: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd2~0_34 256) 0))) (.cse0 (not (= (mod v_~x$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_41 256) 0)))) (let ((.cse2 (and .cse0 .cse5)) (.cse3 (and (not (= (mod v_~x$w_buff1_used~0_77 256) 0)) .cse1)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_86 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_33 (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd2~0_40 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_76 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_34)) (= v_~x$r_buff0_thd2~0_40 (ite .cse2 0 v_~x$r_buff0_thd2~0_41)) (= (ite (or .cse3 .cse2) 0 v_~x$w_buff1_used~0_77) v_~x$w_buff1_used~0_76) (= v_~x~0_59 (ite .cse4 v_~x$w_buff0~0_33 (ite .cse3 v_~x$w_buff1~0_42 v_~x~0_60))) (= (ite .cse4 0 v_~x$w_buff0_used~0_86) v_~x$w_buff0_used~0_85)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_34, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_77, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_41, ~x~0=v_~x~0_60, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_86} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_33, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_76, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_40, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_85} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:21:17,026 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [417] $Ultimate##0-->L742: Formula: (and (= v_~x~0_451 1) (= v_P0Thread1of1ForFork0_~arg.offset_15 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= v_P0Thread1of1ForFork0_~arg.base_15 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= v_~y~0_34 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~y~0=v_~y~0_34, ~x~0=v_~x~0_451, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_15, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_15} AuxVars[] AssignedVars[~y~0, ~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] and [319] L786-->L793: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd2~0_34 256) 0))) (.cse0 (not (= (mod v_~x$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_41 256) 0)))) (let ((.cse2 (and .cse0 .cse5)) (.cse3 (and (not (= (mod v_~x$w_buff1_used~0_77 256) 0)) .cse1)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_86 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_33 (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd2~0_40 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_76 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_34)) (= v_~x$r_buff0_thd2~0_40 (ite .cse2 0 v_~x$r_buff0_thd2~0_41)) (= (ite (or .cse3 .cse2) 0 v_~x$w_buff1_used~0_77) v_~x$w_buff1_used~0_76) (= v_~x~0_59 (ite .cse4 v_~x$w_buff0~0_33 (ite .cse3 v_~x$w_buff1~0_42 v_~x~0_60))) (= (ite .cse4 0 v_~x$w_buff0_used~0_86) v_~x$w_buff0_used~0_85)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_34, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_77, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_41, ~x~0=v_~x~0_60, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_86} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_33, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_76, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_40, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_85} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:21:17,156 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [422] $Ultimate##0-->L793: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd2~0_230 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_574 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_273 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_575 256) 0)))) (.cse2 (and .cse3 .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_521 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_575) v_~x$w_buff0_used~0_574) (= v_P0Thread1of1ForFork0_~arg.base_23 |v_P0Thread1of1ForFork0_#in~arg.base_23|) (= v_P0Thread1of1ForFork0_~arg.offset_23 |v_P0Thread1of1ForFork0_#in~arg.offset_23|) (= (ite .cse0 v_~x$w_buff0~0_381 (ite .cse1 v_~x$w_buff1~0_349 1)) v_~x~0_492) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_273) v_~x$r_buff0_thd2~0_272) (= v_~y~0_44 1) (= v_~x$w_buff1_used~0_520 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_521)) (= v_~x$r_buff1_thd2~0_229 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd2~0_272 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_520 256) 0)))) 0 v_~x$r_buff1_thd2~0_230))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_381, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_23|, ~x$w_buff1~0=v_~x$w_buff1~0_349, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_23|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_230, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_521, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_273, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_575} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_381, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_23|, ~x$w_buff1~0=v_~x$w_buff1~0_349, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_23|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_229, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_520, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_272, ~y~0=v_~y~0_44, ~x~0=v_~x~0_492, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_23, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_574} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~y~0, ~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset, ~x$w_buff0_used~0] and [310] L742-->L749: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_129 256) 0)))) (let ((.cse3 (and .cse5 .cse1)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_130 256) 0)) .cse5)) (.cse4 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_121 256) 0))))) (and (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_120 256) 0))) (and .cse1 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0)))) 0 v_~x$r_buff1_thd1~0_22)) (= (ite .cse2 0 v_~x$w_buff0_used~0_130) v_~x$w_buff0_used~0_129) (= v_~x$r_buff0_thd1~0_23 (ite .cse3 0 v_~x$r_buff0_thd1~0_24)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_121) v_~x$w_buff1_used~0_120) (= v_~x~0_99 (ite .cse2 v_~x$w_buff0~0_67 (ite .cse4 v_~x$w_buff1~0_74 v_~x~0_100)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_67, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_121, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_100, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_130} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_67, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_120, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_99, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_129} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:21:18,378 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [420] $Ultimate##0-->L786: Formula: (let ((.cse2 (= (mod v_~x$w_buff0_used~0_564 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_156 256) 0)))) (and (= (ite .cse0 v_~x$r_buff0_thd2~0_265 (ite (let ((.cse1 (= (mod v_~x$r_buff0_thd2~0_264 256) 0))) (or (and .cse1 (= (mod v_~x$r_buff0_thd2~0_265 256) 0)) (and .cse1 (= (mod v_~x$w_buff1_used~0_512 256) 0)) .cse2)) v_~x$r_buff0_thd2~0_265 0)) v_~x$r_buff1_thd2~0_223) (= v_~x$w_buff0~0_376 v_~x$w_buff1~0_345) (= v_~x$w_buff1_used~0_512 (ite .cse0 v_~x$w_buff0_used~0_565 (ite .cse2 v_~x$w_buff0_used~0_565 0))) (= v_~weak$$choice0~0_108 |v_P1Thread1of1ForFork1_#t~nondet3#1_58|) (= v_~x$flush_delayed~0_150 0) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_39| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_39|) (= v_~x$r_buff0_thd2~0_264 (ite .cse0 1 (ite .cse2 1 (ite (not .cse2) 0 1)))) (= (ite .cse0 1 0) v_~x$w_buff0_used~0_564) (= v_~x$r_buff0_thd0~0_296 v_~x$r_buff1_thd0~0_304) (= (ite .cse0 v_~x$mem_tmp~0_130 v_~x$w_buff0~0_375) v_~x~0_484) (= v_~x$w_buff0~0_375 v_~__unbuffered_p1_EAX~0_98) (= 2 v_~x$w_buff0~0_375) (= v_~__unbuffered_p1_EBX~0_79 v_~y~0_40) (= v_~x~0_485 v_~x$mem_tmp~0_130) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_31| |v_P1Thread1of1ForFork1_~arg#1.offset_31|) (= v_~weak$$choice2~0_156 |v_P1Thread1of1ForFork1_#t~nondet4#1_58|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_39| 0)) (= (ite (= (mod v_~x$w_buff0_used~0_565 256) 0) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_39|) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_31| |v_P1Thread1of1ForFork1_~arg#1.base_31|) (= v_~x$r_buff0_thd1~0_141 v_~x$r_buff1_thd1~0_146))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_376, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_31|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_296, P1Thread1of1ForFork1_#t~nondet4#1=|v_P1Thread1of1ForFork1_#t~nondet4#1_58|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_141, P1Thread1of1ForFork1_#t~nondet3#1=|v_P1Thread1of1ForFork1_#t~nondet3#1_58|, ~y~0=v_~y~0_40, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_265, ~x~0=v_~x~0_485, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_565, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_31|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_375, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_141, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_31|, ~x$flush_delayed~0=v_~x$flush_delayed~0_150, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_146, ~x$mem_tmp~0=v_~x$mem_tmp~0_130, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_31|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_98, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_39|, ~y~0=v_~y~0_40, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_296, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_79, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_31|, ~x$w_buff1~0=v_~x$w_buff1~0_345, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_223, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_512, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_264, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_304, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_39|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_564, ~weak$$choice0~0=v_~weak$$choice0~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~x~0=v_~x~0_484} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_~arg#1.offset, ~x$flush_delayed~0, P1Thread1of1ForFork1_#t~nondet3#1, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~weak$$choice0~0, P1Thread1of1ForFork1_#t~nondet4#1, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~weak$$choice2~0, ~x~0] and [421] $Ultimate##0-->L793: Formula: (let ((.cse14 (not (= (mod v_~x$r_buff0_thd1~0_144 256) 0)))) (let ((.cse9 (and (not (= (mod v_~x$w_buff0_used~0_570 256) 0)) .cse14))) (let ((.cse8 (ite .cse9 0 v_~x$w_buff0_used~0_570))) (let ((.cse5 (not (= (mod v_~x$r_buff1_thd1~0_149 256) 0))) (.cse4 (not (= (mod .cse8 256) 0)))) (let ((.cse0 (and .cse4 .cse14)) (.cse10 (and .cse5 (not (= (mod v_~x$w_buff1_used~0_516 256) 0))))) (let ((.cse3 (ite (or .cse0 .cse10) 0 v_~x$w_buff1_used~0_516))) (let ((.cse11 (not (= (mod v_~x$r_buff1_thd2~0_226 256) 0))) (.cse6 (not (= (mod .cse3 256) 0))) (.cse13 (not (= (mod v_~x$r_buff0_thd2~0_269 256) 0))) (.cse12 (not (= (mod v_~x$w_buff0_used~0_568 256) 0)))) (let ((.cse1 (and .cse13 .cse12)) (.cse7 (and .cse13 .cse4)) (.cse2 (and .cse11 .cse6))) (and (= v_~x$r_buff0_thd1~0_143 (ite .cse0 0 v_~x$r_buff0_thd1~0_144)) (= v_~x$w_buff1_used~0_514 (ite (or .cse1 .cse2) 0 .cse3)) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_143 256) 0)) .cse4) (and .cse5 .cse6)) 0 v_~x$r_buff1_thd1~0_149) v_~x$r_buff1_thd1~0_148) (= (ite .cse1 0 v_~x$r_buff0_thd2~0_269) v_~x$r_buff0_thd2~0_268) (= v_P0Thread1of1ForFork0_~arg.offset_21 |v_P0Thread1of1ForFork0_#in~arg.offset_21|) (= v_P0Thread1of1ForFork0_~arg.base_21 |v_P0Thread1of1ForFork0_#in~arg.base_21|) (= (ite .cse7 0 .cse8) v_~x$w_buff0_used~0_568) (= (ite .cse7 v_~x$w_buff0~0_379 (ite .cse2 v_~x$w_buff1~0_347 (ite .cse9 v_~x$w_buff0~0_379 (ite .cse10 v_~x$w_buff1~0_347 1)))) v_~x~0_488) (= (ite (or (and .cse11 (not (= (mod v_~x$w_buff1_used~0_514 256) 0))) (and .cse12 (not (= (mod v_~x$r_buff0_thd2~0_268 256) 0)))) 0 v_~x$r_buff1_thd2~0_226) v_~x$r_buff1_thd2~0_225) (= v_~y~0_42 1)))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_379, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_144, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, ~x$w_buff1~0=v_~x$w_buff1~0_347, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_226, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_516, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_149, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_269, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_570} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_379, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_143, ~x$w_buff1~0=v_~x$w_buff1~0_347, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_225, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_514, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_148, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_268, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_21, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_568, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, ~y~0=v_~y~0_42, ~x~0=v_~x~0_488, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_21} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~y~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset, ~x$w_buff0_used~0] [2022-12-06 06:21:18,910 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [420] $Ultimate##0-->L786: Formula: (let ((.cse2 (= (mod v_~x$w_buff0_used~0_564 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_156 256) 0)))) (and (= (ite .cse0 v_~x$r_buff0_thd2~0_265 (ite (let ((.cse1 (= (mod v_~x$r_buff0_thd2~0_264 256) 0))) (or (and .cse1 (= (mod v_~x$r_buff0_thd2~0_265 256) 0)) (and .cse1 (= (mod v_~x$w_buff1_used~0_512 256) 0)) .cse2)) v_~x$r_buff0_thd2~0_265 0)) v_~x$r_buff1_thd2~0_223) (= v_~x$w_buff0~0_376 v_~x$w_buff1~0_345) (= v_~x$w_buff1_used~0_512 (ite .cse0 v_~x$w_buff0_used~0_565 (ite .cse2 v_~x$w_buff0_used~0_565 0))) (= v_~weak$$choice0~0_108 |v_P1Thread1of1ForFork1_#t~nondet3#1_58|) (= v_~x$flush_delayed~0_150 0) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_39| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_39|) (= v_~x$r_buff0_thd2~0_264 (ite .cse0 1 (ite .cse2 1 (ite (not .cse2) 0 1)))) (= (ite .cse0 1 0) v_~x$w_buff0_used~0_564) (= v_~x$r_buff0_thd0~0_296 v_~x$r_buff1_thd0~0_304) (= (ite .cse0 v_~x$mem_tmp~0_130 v_~x$w_buff0~0_375) v_~x~0_484) (= v_~x$w_buff0~0_375 v_~__unbuffered_p1_EAX~0_98) (= 2 v_~x$w_buff0~0_375) (= v_~__unbuffered_p1_EBX~0_79 v_~y~0_40) (= v_~x~0_485 v_~x$mem_tmp~0_130) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_31| |v_P1Thread1of1ForFork1_~arg#1.offset_31|) (= v_~weak$$choice2~0_156 |v_P1Thread1of1ForFork1_#t~nondet4#1_58|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_39| 0)) (= (ite (= (mod v_~x$w_buff0_used~0_565 256) 0) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_39|) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_31| |v_P1Thread1of1ForFork1_~arg#1.base_31|) (= v_~x$r_buff0_thd1~0_141 v_~x$r_buff1_thd1~0_146))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_376, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_31|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_296, P1Thread1of1ForFork1_#t~nondet4#1=|v_P1Thread1of1ForFork1_#t~nondet4#1_58|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_141, P1Thread1of1ForFork1_#t~nondet3#1=|v_P1Thread1of1ForFork1_#t~nondet3#1_58|, ~y~0=v_~y~0_40, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_265, ~x~0=v_~x~0_485, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_565, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_31|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_375, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_141, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_31|, ~x$flush_delayed~0=v_~x$flush_delayed~0_150, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_146, ~x$mem_tmp~0=v_~x$mem_tmp~0_130, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_31|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_98, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_39|, ~y~0=v_~y~0_40, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_296, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_79, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_31|, ~x$w_buff1~0=v_~x$w_buff1~0_345, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_223, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_512, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_264, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_304, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_39|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_564, ~weak$$choice0~0=v_~weak$$choice0~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~x~0=v_~x~0_484} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_~arg#1.offset, ~x$flush_delayed~0, P1Thread1of1ForFork1_#t~nondet3#1, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~weak$$choice0~0, P1Thread1of1ForFork1_#t~nondet4#1, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~weak$$choice2~0, ~x~0] and [423] $Ultimate##0-->L749: Formula: (let ((.cse14 (not (= (mod v_~x$r_buff0_thd2~0_277 256) 0)))) (let ((.cse6 (and .cse14 (not (= (mod v_~x$w_buff0_used~0_580 256) 0))))) (let ((.cse4 (ite .cse6 0 v_~x$w_buff0_used~0_580))) (let ((.cse10 (not (= 0 (mod .cse4 256)))) (.cse12 (not (= (mod v_~x$r_buff1_thd2~0_234 256) 0)))) (let ((.cse7 (and .cse12 (not (= (mod v_~x$w_buff1_used~0_526 256) 0)))) (.cse8 (and .cse10 .cse14))) (let ((.cse9 (ite (or .cse7 .cse8) 0 v_~x$w_buff1_used~0_526))) (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_578 256) 0))) (.cse11 (not (= (mod .cse9 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd1~0_153 256) 0))) (.cse13 (not (= (mod v_~x$r_buff0_thd1~0_148 256) 0)))) (let ((.cse3 (and .cse10 .cse13)) (.cse5 (and .cse11 .cse0)) (.cse2 (and .cse13 .cse1))) (and (= v_P0Thread1of1ForFork0_~arg.offset_25 |v_P0Thread1of1ForFork0_#in~arg.offset_25|) (= v_~x$r_buff1_thd1~0_152 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_524 256) 0)) .cse0) (and .cse1 (not (= (mod v_~x$r_buff0_thd1~0_147 256) 0)))) 0 v_~x$r_buff1_thd1~0_153)) (= v_~y~0_46 1) (= v_~x$r_buff0_thd1~0_147 (ite .cse2 0 v_~x$r_buff0_thd1~0_148)) (= v_~x$w_buff0_used~0_578 (ite .cse3 0 .cse4)) (= v_P0Thread1of1ForFork0_~arg.base_25 |v_P0Thread1of1ForFork0_#in~arg.base_25|) (= (ite .cse3 v_~x$w_buff0~0_383 (ite .cse5 v_~x$w_buff1~0_351 (ite .cse6 v_~x$w_buff0~0_383 (ite .cse7 v_~x$w_buff1~0_351 1)))) v_~x~0_496) (= (ite .cse8 0 v_~x$r_buff0_thd2~0_277) v_~x$r_buff0_thd2~0_276) (= (ite (or .cse5 .cse2) 0 .cse9) v_~x$w_buff1_used~0_524) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_276 256) 0)) .cse10) (and .cse11 .cse12)) 0 v_~x$r_buff1_thd2~0_234) v_~x$r_buff1_thd2~0_233)))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_383, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_148, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_25|, ~x$w_buff1~0=v_~x$w_buff1~0_351, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_25|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_526, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_234, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_153, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_277, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_580} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_383, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_147, ~x$w_buff1~0=v_~x$w_buff1~0_351, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_25|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_524, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_233, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_152, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_276, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_25, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_578, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_25|, ~y~0=v_~y~0_46, ~x~0=v_~x~0_496, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_25} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~y~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset, ~x$w_buff0_used~0] [2022-12-06 06:21:19,461 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 06:21:19,462 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3229 [2022-12-06 06:21:19,463 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 10 transitions, 57 flow [2022-12-06 06:21:19,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:21:19,463 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:21:19,463 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:21:19,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:21:19,463 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:21:19,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:21:19,464 INFO L85 PathProgramCache]: Analyzing trace with hash 734281265, now seen corresponding path program 1 times [2022-12-06 06:21:19,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:21:19,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653725947] [2022-12-06 06:21:19,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:21:19,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:21:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:21:19,551 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:21:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:21:19,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:21:19,660 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:21:19,662 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 06:21:19,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-06 06:21:19,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 06:21:19,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 06:21:19,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-06 06:21:19,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:21:19,665 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:21:19,669 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:21:19,669 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:21:19,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:21:19 BasicIcfg [2022-12-06 06:21:19,728 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:21:19,729 INFO L158 Benchmark]: Toolchain (without parser) took 71158.12ms. Allocated memory was 212.9MB in the beginning and 967.8MB in the end (delta: 755.0MB). Free memory was 187.0MB in the beginning and 547.0MB in the end (delta: -360.0MB). Peak memory consumption was 396.0MB. Max. memory is 8.0GB. [2022-12-06 06:21:19,729 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 212.9MB. Free memory was 189.2MB in the beginning and 189.1MB in the end (delta: 85.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:21:19,729 INFO L158 Benchmark]: CACSL2BoogieTranslator took 485.60ms. Allocated memory is still 212.9MB. Free memory was 187.0MB in the beginning and 160.7MB in the end (delta: 26.3MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 06:21:19,731 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.67ms. Allocated memory is still 212.9MB. Free memory was 160.7MB in the beginning and 157.7MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:21:19,731 INFO L158 Benchmark]: Boogie Preprocessor took 33.89ms. Allocated memory is still 212.9MB. Free memory was 157.7MB in the beginning and 156.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 06:21:19,734 INFO L158 Benchmark]: RCFGBuilder took 601.38ms. Allocated memory is still 212.9MB. Free memory was 156.1MB in the beginning and 118.3MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-06 06:21:19,735 INFO L158 Benchmark]: TraceAbstraction took 69981.26ms. Allocated memory was 212.9MB in the beginning and 967.8MB in the end (delta: 755.0MB). Free memory was 117.3MB in the beginning and 547.0MB in the end (delta: -429.7MB). Peak memory consumption was 326.8MB. Max. memory is 8.0GB. [2022-12-06 06:21:19,737 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 212.9MB. Free memory was 189.2MB in the beginning and 189.1MB in the end (delta: 85.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 485.60ms. Allocated memory is still 212.9MB. Free memory was 187.0MB in the beginning and 160.7MB in the end (delta: 26.3MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.67ms. Allocated memory is still 212.9MB. Free memory was 160.7MB in the beginning and 157.7MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.89ms. Allocated memory is still 212.9MB. Free memory was 157.7MB in the beginning and 156.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 601.38ms. Allocated memory is still 212.9MB. Free memory was 156.1MB in the beginning and 118.3MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 69981.26ms. Allocated memory was 212.9MB in the beginning and 967.8MB in the end (delta: 755.0MB). Free memory was 117.3MB in the beginning and 547.0MB in the end (delta: -429.7MB). Peak memory consumption was 326.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 92 PlacesBefore, 27 PlacesAfterwards, 87 TransitionsBefore, 21 TransitionsAfterwards, 1088 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 35 TrivialYvCompositions, 32 ConcurrentYvCompositions, 1 ChoiceCompositions, 69 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 887, independent: 840, independent conditional: 840, independent unconditional: 0, dependent: 47, dependent conditional: 47, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 887, independent: 840, independent conditional: 0, independent unconditional: 840, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 887, independent: 840, independent conditional: 0, independent unconditional: 840, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 887, independent: 840, independent conditional: 0, independent unconditional: 840, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 719, independent: 687, independent conditional: 0, independent unconditional: 687, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 719, independent: 674, independent conditional: 0, independent unconditional: 674, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 45, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 265, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 255, dependent conditional: 0, dependent unconditional: 255, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 887, independent: 153, independent conditional: 0, independent unconditional: 153, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 719, unknown conditional: 0, unknown unconditional: 719] , Statistics on independence cache: Total cache size (in pairs): 1101, Positive cache size: 1069, Positive conditional cache size: 0, Positive unconditional cache size: 1069, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, 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, 23 PlacesBefore, 23 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 110 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: 6, independent unconditional: 33, dependent: 18, dependent conditional: 3, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 57, independent: 39, independent conditional: 6, independent unconditional: 33, dependent: 18, dependent conditional: 3, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 57, independent: 39, independent conditional: 6, independent unconditional: 33, dependent: 18, dependent conditional: 3, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 46, independent: 33, independent conditional: 5, independent unconditional: 28, dependent: 13, dependent conditional: 2, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 46, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 2, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 30, dependent conditional: 8, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 57, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 46, unknown conditional: 7, unknown unconditional: 39] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 33, Positive conditional cache size: 5, Positive unconditional cache size: 28, Negative cache size: 13, Negative conditional cache size: 2, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 24 PlacesBefore, 24 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 106 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 52, independent: 36, independent conditional: 2, independent unconditional: 34, dependent: 16, dependent conditional: 1, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 52, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 52, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 52, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 38, Positive conditional cache size: 5, Positive unconditional cache size: 33, Negative cache size: 15, Negative conditional cache size: 2, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 27 PlacesBefore, 27 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 100 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 32, independent: 17, independent conditional: 9, independent unconditional: 8, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 51, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 41, Positive conditional cache size: 5, Positive unconditional cache size: 36, Negative cache size: 24, Negative conditional cache size: 2, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31.6s, 30 PlacesBefore, 27 PlacesAfterwards, 18 TransitionsBefore, 15 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 74, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 74, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 74, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 74, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 74, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 46, Positive conditional cache size: 5, Positive unconditional cache size: 41, Negative cache size: 24, Negative conditional cache size: 2, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 27 PlacesBefore, 26 PlacesAfterwards, 15 TransitionsBefore, 14 TransitionsAfterwards, 22 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 8, independent conditional: 8, 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: 26, independent: 8, independent conditional: 1, independent unconditional: 7, 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: 26, independent: 8, independent conditional: 1, independent unconditional: 7, 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: 26, independent: 8, independent conditional: 1, independent unconditional: 7, 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: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 41, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 56, Positive conditional cache size: 7, Positive unconditional cache size: 49, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, 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: 3.2s, 30 PlacesBefore, 23 PlacesAfterwards, 16 TransitionsBefore, 10 TransitionsAfterwards, 4 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 66, Positive conditional cache size: 9, Positive unconditional cache size: 57, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t597; [L811] FCALL, FORK 0 pthread_create(&t597, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t597, ((void *)0), P0, ((void *)0))=-1, t597={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 0 pthread_t t598; [L813] FCALL, FORK 0 pthread_create(&t598, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t598, ((void *)0), P1, ((void *)0))=0, t597={5:0}, t598={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L762] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L762] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 [L769] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 2 x$flush_delayed = weak$$choice2 [L772] 2 x$mem_tmp = x [L773] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L774] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L775] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L776] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L777] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L779] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 __unbuffered_p1_EAX = x [L781] 2 x = x$flush_delayed ? x$mem_tmp : x [L782] 2 x$flush_delayed = (_Bool)0 [L785] 2 __unbuffered_p1_EBX = y [L738] 2 y = 1 [L741] 2 x = 1 [L744] 2 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L745] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L747] 2 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] 2 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L815] 1 main$tmp_guard0 = __unbuffered_cnt == 2 [L817] CALL 1 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 1 !(!cond) [L817] RET 1 assume_abort_if_not(main$tmp_guard0) [L819] 1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L820] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L821] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L822] 1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L823] 1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L826] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 1 x$flush_delayed = weak$$choice2 [L829] 1 x$mem_tmp = x [L830] 1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L831] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L832] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L833] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L834] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L836] 1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L838] 1 x = x$flush_delayed ? x$mem_tmp : x [L839] 1 x$flush_delayed = (_Bool)0 [L841] CALL 1 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 1 !expression [L18] 1 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 108 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 69.8s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 107 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 107 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 255 IncrementalHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 5 mSDtfsCounter, 255 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=4, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 29.5s InterpolantComputationTime, 65 NumberOfCodeBlocks, 65 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 724 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:21:19,787 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...