/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/rfi001_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:32:12,611 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:32:12,613 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:32:12,652 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:32:12,653 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:32:12,654 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:32:12,655 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:32:12,656 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:32:12,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:32:12,659 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:32:12,659 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:32:12,660 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:32:12,661 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:32:12,666 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:32:12,667 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:32:12,668 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:32:12,668 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:32:12,669 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:32:12,670 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:32:12,672 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:32:12,673 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:32:12,677 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:32:12,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:32:12,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:32:12,694 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:32:12,694 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:32:12,694 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:32:12,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:32:12,696 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:32:12,697 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:32:12,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:32:12,699 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:32:12,700 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:32:12,701 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:32:12,702 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:32:12,702 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:32:12,702 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:32:12,702 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:32:12,703 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:32:12,703 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:32:12,704 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:32:12,705 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:32:12,747 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:32:12,747 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:32:12,749 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:32:12,749 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:32:12,749 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:32:12,750 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:32:12,750 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:32:12,750 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:32:12,750 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:32:12,750 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:32:12,751 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:32:12,751 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:32:12,751 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:32:12,751 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:32:12,752 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:32:12,752 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:32:12,752 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:32:12,752 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:32:12,752 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:32:12,752 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:32:12,752 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:32:12,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:32:12,753 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:32:12,753 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:32:12,753 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:32:12,753 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:32:12,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:32:12,753 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:32:12,754 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:32:13,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:32:13,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:32:13,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:32:13,073 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:32:13,073 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:32:13,074 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 06:32:14,257 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:32:14,500 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:32:14,501 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 06:32:14,513 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab59ba49d/90b5a7734d8d4d428c4027eb6a5e01c9/FLAG6c8985c7c [2022-12-06 06:32:14,528 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab59ba49d/90b5a7734d8d4d428c4027eb6a5e01c9 [2022-12-06 06:32:14,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:32:14,532 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:32:14,533 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:32:14,533 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:32:14,535 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:32:14,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:32:14" (1/1) ... [2022-12-06 06:32:14,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@600fe297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:32:14, skipping insertion in model container [2022-12-06 06:32:14,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:32:14" (1/1) ... [2022-12-06 06:32:14,543 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:32:14,571 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:32:14,734 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/rfi001_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-06 06:32:14,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:14,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:14,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:14,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:14,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:14,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:14,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:14,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:14,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:14,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:14,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:14,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:14,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:14,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:14,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:14,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:14,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:14,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:14,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:14,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:14,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:14,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:14,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:14,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:14,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:14,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:14,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:32:14,968 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:32:14,980 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/rfi001_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-06 06:32:15,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:15,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:15,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:15,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:15,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:15,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:15,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:15,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:15,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:15,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:15,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:15,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:15,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:15,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:15,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:15,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:15,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:15,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:15,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:15,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:15,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:15,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:15,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:15,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:15,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:15,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:15,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:32:15,063 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:32:15,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:32:15 WrapperNode [2022-12-06 06:32:15,063 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:32:15,064 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:32:15,064 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:32:15,065 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:32:15,074 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:32:15" (1/1) ... [2022-12-06 06:32:15,100 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:32:15" (1/1) ... [2022-12-06 06:32:15,128 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 114 [2022-12-06 06:32:15,128 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:32:15,129 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:32:15,129 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:32:15,129 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:32:15,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:32:15" (1/1) ... [2022-12-06 06:32:15,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:32:15" (1/1) ... [2022-12-06 06:32:15,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:32:15" (1/1) ... [2022-12-06 06:32:15,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:32:15" (1/1) ... [2022-12-06 06:32:15,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:32:15" (1/1) ... [2022-12-06 06:32:15,154 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:32:15" (1/1) ... [2022-12-06 06:32:15,156 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:32:15" (1/1) ... [2022-12-06 06:32:15,157 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:32:15" (1/1) ... [2022-12-06 06:32:15,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:32:15,168 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:32:15,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:32:15,168 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:32:15,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:32:15" (1/1) ... [2022-12-06 06:32:15,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:32:15,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:32:15,215 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:32:15,219 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:32:15,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:32:15,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:32:15,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:32:15,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:32:15,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:32:15,249 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:32:15,249 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:32:15,249 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:32:15,249 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:32:15,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:32:15,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:32:15,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:32:15,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:32:15,251 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:32:15,361 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:32:15,362 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:32:15,633 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:32:15,775 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:32:15,775 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:32:15,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:32:15 BoogieIcfgContainer [2022-12-06 06:32:15,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:32:15,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:32:15,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:32:15,786 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:32:15,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:32:14" (1/3) ... [2022-12-06 06:32:15,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b72fde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:32:15, skipping insertion in model container [2022-12-06 06:32:15,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:32:15" (2/3) ... [2022-12-06 06:32:15,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b72fde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:32:15, skipping insertion in model container [2022-12-06 06:32:15,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:32:15" (3/3) ... [2022-12-06 06:32:15,789 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 06:32:15,805 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:32:15,806 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:32:15,806 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:32:15,866 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:32:15,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 91 transitions, 192 flow [2022-12-06 06:32:15,991 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2022-12-06 06:32:15,991 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:32:15,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-06 06:32:15,996 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 91 transitions, 192 flow [2022-12-06 06:32:16,000 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 89 transitions, 184 flow [2022-12-06 06:32:16,001 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:32:16,031 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 89 transitions, 184 flow [2022-12-06 06:32:16,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 184 flow [2022-12-06 06:32:16,067 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2022-12-06 06:32:16,068 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:32:16,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-06 06:32:16,071 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 89 transitions, 184 flow [2022-12-06 06:32:16,071 INFO L188 LiptonReduction]: Number of co-enabled transitions 1174 [2022-12-06 06:32:19,728 INFO L203 LiptonReduction]: Total number of compositions: 71 [2022-12-06 06:32:19,741 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:32:19,748 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;@32939b60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:32:19,749 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 06:32:19,751 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-06 06:32:19,751 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:32:19,752 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:32:19,753 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 06:32:19,753 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:32:19,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:32:19,757 INFO L85 PathProgramCache]: Analyzing trace with hash 405534, now seen corresponding path program 1 times [2022-12-06 06:32:19,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:32:19,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098100238] [2022-12-06 06:32:19,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:32:19,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:32:19,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:32:20,090 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:32:20,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:32:20,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098100238] [2022-12-06 06:32:20,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098100238] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:32:20,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:32:20,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:32:20,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701080428] [2022-12-06 06:32:20,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:32:20,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:32:20,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:32:20,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:32:20,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:32:20,118 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 06:32:20,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:32:20,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:32:20,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 06:32:20,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:32:20,234 INFO L130 PetriNetUnfolder]: 214/410 cut-off events. [2022-12-06 06:32:20,235 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:32:20,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 795 conditions, 410 events. 214/410 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1829 event pairs, 25 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 785. Up to 307 conditions per place. [2022-12-06 06:32:20,239 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 23 selfloop transitions, 2 changer transitions 6/32 dead transitions. [2022-12-06 06:32:20,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 32 transitions, 135 flow [2022-12-06 06:32:20,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:32:20,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:32:20,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-06 06:32:20,249 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2022-12-06 06:32:20,251 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 50 flow. Second operand 3 states and 39 transitions. [2022-12-06 06:32:20,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 32 transitions, 135 flow [2022-12-06 06:32:20,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 32 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:32:20,255 INFO L231 Difference]: Finished difference. Result has 26 places, 16 transitions, 40 flow [2022-12-06 06:32:20,257 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=26, PETRI_TRANSITIONS=16} [2022-12-06 06:32:20,260 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, -2 predicate places. [2022-12-06 06:32:20,260 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:32:20,261 INFO L89 Accepts]: Start accepts. Operand has 26 places, 16 transitions, 40 flow [2022-12-06 06:32:20,263 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:32:20,263 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:32:20,263 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 16 transitions, 40 flow [2022-12-06 06:32:20,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 40 flow [2022-12-06 06:32:20,279 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-06 06:32:20,279 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:32:20,280 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 19 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:32:20,280 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 40 flow [2022-12-06 06:32:20,280 INFO L188 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-06 06:32:20,407 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:32:20,410 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 150 [2022-12-06 06:32:20,410 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 15 transitions, 38 flow [2022-12-06 06:32:20,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:32:20,411 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:32:20,411 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:32:20,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:32:20,415 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:32:20,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:32:20,415 INFO L85 PathProgramCache]: Analyzing trace with hash 884790713, now seen corresponding path program 1 times [2022-12-06 06:32:20,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:32:20,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880253631] [2022-12-06 06:32:20,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:32:20,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:32:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:32:20,618 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:32:20,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:32:20,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880253631] [2022-12-06 06:32:20,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880253631] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:32:20,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:32:20,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:32:20,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451109311] [2022-12-06 06:32:20,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:32:20,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:32:20,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:32:20,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:32:20,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:32:20,622 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 06:32:20,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 15 transitions, 38 flow. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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:32:20,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:32:20,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 06:32:20,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:32:20,730 INFO L130 PetriNetUnfolder]: 179/333 cut-off events. [2022-12-06 06:32:20,730 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-06 06:32:20,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 703 conditions, 333 events. 179/333 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1367 event pairs, 55 based on Foata normal form. 17/350 useless extension candidates. Maximal degree in co-relation 693. Up to 196 conditions per place. [2022-12-06 06:32:20,735 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 20 selfloop transitions, 4 changer transitions 0/24 dead transitions. [2022-12-06 06:32:20,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 24 transitions, 106 flow [2022-12-06 06:32:20,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:32:20,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:32:20,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-12-06 06:32:20,736 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 06:32:20,737 INFO L175 Difference]: Start difference. First operand has 22 places, 15 transitions, 38 flow. Second operand 3 states and 25 transitions. [2022-12-06 06:32:20,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 24 transitions, 106 flow [2022-12-06 06:32:20,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 24 transitions, 100 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:32:20,738 INFO L231 Difference]: Finished difference. Result has 24 places, 17 transitions, 60 flow [2022-12-06 06:32:20,738 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=24, PETRI_TRANSITIONS=17} [2022-12-06 06:32:20,739 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, -4 predicate places. [2022-12-06 06:32:20,739 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:32:20,739 INFO L89 Accepts]: Start accepts. Operand has 24 places, 17 transitions, 60 flow [2022-12-06 06:32:20,740 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:32:20,740 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:32:20,740 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 17 transitions, 60 flow [2022-12-06 06:32:20,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 17 transitions, 60 flow [2022-12-06 06:32:20,747 INFO L130 PetriNetUnfolder]: 4/42 cut-off events. [2022-12-06 06:32:20,747 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 06:32:20,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 42 events. 4/42 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 2 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 67. Up to 13 conditions per place. [2022-12-06 06:32:20,748 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 17 transitions, 60 flow [2022-12-06 06:32:20,748 INFO L188 LiptonReduction]: Number of co-enabled transitions 98 [2022-12-06 06:32:20,799 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:32:20,800 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-06 06:32:20,800 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 60 flow [2022-12-06 06:32:20,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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:32:20,801 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:32:20,801 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:32:20,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:32:20,801 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:32:20,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:32:20,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1658709044, now seen corresponding path program 1 times [2022-12-06 06:32:20,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:32:20,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055300818] [2022-12-06 06:32:20,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:32:20,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:32:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:32:20,933 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:32:20,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:32:20,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055300818] [2022-12-06 06:32:20,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055300818] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:32:20,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:32:20,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:32:20,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632750097] [2022-12-06 06:32:20,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:32:20,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:32:20,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:32:20,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:32:20,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:32:20,935 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-06 06:32:20,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 60 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:32:20,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:32:20,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-06 06:32:20,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:32:20,988 INFO L130 PetriNetUnfolder]: 55/139 cut-off events. [2022-12-06 06:32:20,989 INFO L131 PetriNetUnfolder]: For 34/35 co-relation queries the response was YES. [2022-12-06 06:32:20,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337 conditions, 139 events. 55/139 cut-off events. For 34/35 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 487 event pairs, 16 based on Foata normal form. 18/156 useless extension candidates. Maximal degree in co-relation 325. Up to 97 conditions per place. [2022-12-06 06:32:20,990 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 22 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2022-12-06 06:32:20,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 27 transitions, 142 flow [2022-12-06 06:32:20,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:32:20,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:32:20,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-12-06 06:32:20,998 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 06:32:21,002 INFO L175 Difference]: Start difference. First operand has 24 places, 17 transitions, 60 flow. Second operand 3 states and 27 transitions. [2022-12-06 06:32:21,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 27 transitions, 142 flow [2022-12-06 06:32:21,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 27 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:32:21,005 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 71 flow [2022-12-06 06:32:21,005 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2022-12-06 06:32:21,007 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, -3 predicate places. [2022-12-06 06:32:21,007 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:32:21,007 INFO L89 Accepts]: Start accepts. Operand has 25 places, 19 transitions, 71 flow [2022-12-06 06:32:21,008 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:32:21,008 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:32:21,008 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 19 transitions, 71 flow [2022-12-06 06:32:21,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 19 transitions, 71 flow [2022-12-06 06:32:21,043 INFO L130 PetriNetUnfolder]: 9/56 cut-off events. [2022-12-06 06:32:21,043 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:32:21,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 56 events. 9/56 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 4 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 98. Up to 23 conditions per place. [2022-12-06 06:32:21,044 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 19 transitions, 71 flow [2022-12-06 06:32:21,044 INFO L188 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-06 06:32:21,069 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:32:21,071 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-06 06:32:21,071 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 71 flow [2022-12-06 06:32:21,071 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:32:21,071 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:32:21,071 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:32:21,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:32:21,072 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:32:21,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:32:21,072 INFO L85 PathProgramCache]: Analyzing trace with hash -2066296399, now seen corresponding path program 1 times [2022-12-06 06:32:21,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:32:21,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379195435] [2022-12-06 06:32:21,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:32:21,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:32:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:32:21,245 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:32:21,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:32:21,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379195435] [2022-12-06 06:32:21,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379195435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:32:21,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:32:21,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:32:21,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371052216] [2022-12-06 06:32:21,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:32:21,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:32:21,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:32:21,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:32:21,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:32:21,248 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-06 06:32:21,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:32:21,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:32:21,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-06 06:32:21,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:32:21,312 INFO L130 PetriNetUnfolder]: 25/75 cut-off events. [2022-12-06 06:32:21,312 INFO L131 PetriNetUnfolder]: For 11/12 co-relation queries the response was YES. [2022-12-06 06:32:21,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 75 events. 25/75 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 204 event pairs, 11 based on Foata normal form. 12/86 useless extension candidates. Maximal degree in co-relation 202. Up to 38 conditions per place. [2022-12-06 06:32:21,315 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 19 selfloop transitions, 5 changer transitions 1/27 dead transitions. [2022-12-06 06:32:21,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 27 transitions, 145 flow [2022-12-06 06:32:21,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:32:21,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:32:21,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-12-06 06:32:21,318 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-06 06:32:21,318 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 71 flow. Second operand 4 states and 28 transitions. [2022-12-06 06:32:21,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 27 transitions, 145 flow [2022-12-06 06:32:21,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 27 transitions, 142 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:32:21,320 INFO L231 Difference]: Finished difference. Result has 28 places, 19 transitions, 84 flow [2022-12-06 06:32:21,320 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=28, PETRI_TRANSITIONS=19} [2022-12-06 06:32:21,321 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 0 predicate places. [2022-12-06 06:32:21,322 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:32:21,322 INFO L89 Accepts]: Start accepts. Operand has 28 places, 19 transitions, 84 flow [2022-12-06 06:32:21,324 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:32:21,324 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:32:21,324 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 19 transitions, 84 flow [2022-12-06 06:32:21,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 19 transitions, 84 flow [2022-12-06 06:32:21,330 INFO L130 PetriNetUnfolder]: 3/32 cut-off events. [2022-12-06 06:32:21,330 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-06 06:32:21,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 32 events. 3/32 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 64 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 67. Up to 12 conditions per place. [2022-12-06 06:32:21,331 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 19 transitions, 84 flow [2022-12-06 06:32:21,331 INFO L188 LiptonReduction]: Number of co-enabled transitions 46 [2022-12-06 06:32:21,943 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:32:21,944 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 622 [2022-12-06 06:32:21,944 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 80 flow [2022-12-06 06:32:21,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:32:21,944 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:32:21,944 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:32:21,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:32:21,945 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:32:21,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:32:21,945 INFO L85 PathProgramCache]: Analyzing trace with hash -851972558, now seen corresponding path program 1 times [2022-12-06 06:32:21,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:32:21,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480784662] [2022-12-06 06:32:21,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:32:21,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:32:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:32:22,552 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:32:22,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:32:22,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480784662] [2022-12-06 06:32:22,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480784662] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:32:22,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:32:22,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:32:22,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551612239] [2022-12-06 06:32:22,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:32:22,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:32:22,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:32:22,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:32:22,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:32:22,557 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 14 [2022-12-06 06:32:22,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 80 flow. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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:32:22,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:32:22,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 14 [2022-12-06 06:32:22,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:32:22,704 INFO L130 PetriNetUnfolder]: 26/81 cut-off events. [2022-12-06 06:32:22,704 INFO L131 PetriNetUnfolder]: For 78/78 co-relation queries the response was YES. [2022-12-06 06:32:22,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 81 events. 26/81 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 294 event pairs, 0 based on Foata normal form. 1/77 useless extension candidates. Maximal degree in co-relation 234. Up to 36 conditions per place. [2022-12-06 06:32:22,705 INFO L137 encePairwiseOnDemand]: 8/14 looper letters, 16 selfloop transitions, 4 changer transitions 13/35 dead transitions. [2022-12-06 06:32:22,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 35 transitions, 226 flow [2022-12-06 06:32:22,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:32:22,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:32:22,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-12-06 06:32:22,708 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2022-12-06 06:32:22,708 INFO L175 Difference]: Start difference. First operand has 26 places, 17 transitions, 80 flow. Second operand 6 states and 36 transitions. [2022-12-06 06:32:22,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 35 transitions, 226 flow [2022-12-06 06:32:22,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 35 transitions, 206 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 06:32:22,710 INFO L231 Difference]: Finished difference. Result has 30 places, 17 transitions, 84 flow [2022-12-06 06:32:22,710 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=84, PETRI_PLACES=30, PETRI_TRANSITIONS=17} [2022-12-06 06:32:22,711 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 2 predicate places. [2022-12-06 06:32:22,711 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:32:22,711 INFO L89 Accepts]: Start accepts. Operand has 30 places, 17 transitions, 84 flow [2022-12-06 06:32:22,712 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:32:22,712 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:32:22,712 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 17 transitions, 84 flow [2022-12-06 06:32:22,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 17 transitions, 84 flow [2022-12-06 06:32:22,721 INFO L130 PetriNetUnfolder]: 3/30 cut-off events. [2022-12-06 06:32:22,721 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 06:32:22,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 30 events. 3/30 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 74 event pairs, 0 based on Foata normal form. 1/31 useless extension candidates. Maximal degree in co-relation 67. Up to 8 conditions per place. [2022-12-06 06:32:22,722 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 17 transitions, 84 flow [2022-12-06 06:32:22,722 INFO L188 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-06 06:32:23,053 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] L752-->P0EXIT: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd1~0_131 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_184 256) 0))) (.cse0 (not (= (mod v_~x$w_buff0_used~0_398 256) 0)))) (let ((.cse4 (and .cse5 .cse0)) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_336 256) 0)))) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_399 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd1~0_130 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_183 256) 0)) .cse0) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_335 256) 0)))) 0 v_~x$r_buff1_thd1~0_131)) (= 0 |v_P0Thread1of1ForFork0_#res#1.offset_19|) (= (ite .cse2 v_~x$w_buff0~0_249 (ite .cse3 v_~x$w_buff1~0_204 v_~x~0_285)) v_~x~0_284) (= v_~x$r_buff0_thd1~0_183 (ite .cse4 0 v_~x$r_buff0_thd1~0_184)) (= v_~x$w_buff1_used~0_335 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_336)) (= (+ v_~__unbuffered_cnt~0_88 1) v_~__unbuffered_cnt~0_87) (= |v_P0Thread1of1ForFork0_#res#1.base_19| 0) (= (ite .cse2 0 v_~x$w_buff0_used~0_399) v_~x$w_buff0_used~0_398)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_249, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_184, ~x$w_buff1~0=v_~x$w_buff1~0_204, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_336, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_131, ~x~0=v_~x~0_285, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_399} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_249, P0Thread1of1ForFork0_#res#1.offset=|v_P0Thread1of1ForFork0_#res#1.offset_19|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_183, P0Thread1of1ForFork0_#res#1.base=|v_P0Thread1of1ForFork0_#res#1.base_19|, ~x$w_buff1~0=v_~x$w_buff1~0_204, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_335, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_130, ~x~0=v_~x~0_284, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_398} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res#1.offset, ~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#res#1.base, ~x$w_buff1_used~0, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] and [390] L818-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_345 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd0~0_142 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_136 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_346 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_289 256) 0)) .cse4)) (.cse2 (and .cse3 .cse5))) (and (= (ite .cse0 v_~x$w_buff0~0_210 (ite .cse1 v_~x$w_buff1~0_173 v_~x~0_239)) v_~x~0_238) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41| (mod v_~main$tmp_guard0~0_50 256)) (= (ite (= (ite (not (and (= v_~y~0_118 2) (= v_~__unbuffered_p1_EAX~0_93 1) (= v_~__unbuffered_p1_EBX~0_108 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_76) (= (ite .cse0 0 v_~x$w_buff0_used~0_346) v_~x$w_buff0_used~0_345) (= (mod v_~main$tmp_guard1~0_76 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_67|) (= v_~x$w_buff1_used~0_288 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_289)) (= v_~main$tmp_guard0~0_50 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_81) 1 0) 0) 0 1)) (= v_~x$r_buff0_thd0~0_135 (ite .cse2 0 v_~x$r_buff0_thd0~0_136)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_47| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_67| 0) (= v_~x$r_buff1_thd0~0_141 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd0~0_135 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_288 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_142)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_47| 0))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_210, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_136, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_108, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_93, ~x$w_buff1~0=v_~x$w_buff1~0_173, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_289, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_142, ~y~0=v_~y~0_118, ~x~0=v_~x~0_239, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_346} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_210, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_135, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_67|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_108, ~x$w_buff1~0=v_~x$w_buff1~0_173, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_288, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_76, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_50, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_141, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_345, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_93, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_47|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_43|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_51|, ~y~0=v_~y~0_118, ~x~0=v_~x~0_238, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:32:23,499 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:32:23,501 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 790 [2022-12-06 06:32:23,501 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 16 transitions, 92 flow [2022-12-06 06:32:23,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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:32:23,501 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:32:23,501 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:32:23,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:32:23,501 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:32:23,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:32:23,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2032243306, now seen corresponding path program 1 times [2022-12-06 06:32:23,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:32:23,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080468401] [2022-12-06 06:32:23,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:32:23,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:32:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:32:23,581 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:32:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:32:23,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:32:23,688 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:32:23,689 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 06:32:23,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-06 06:32:23,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 06:32:23,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 06:32:23,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-06 06:32:23,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:32:23,694 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-12-06 06:32:23,698 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:32:23,699 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:32:23,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:32:23 BasicIcfg [2022-12-06 06:32:23,764 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:32:23,765 INFO L158 Benchmark]: Toolchain (without parser) took 9233.54ms. Allocated memory was 188.7MB in the beginning and 295.7MB in the end (delta: 107.0MB). Free memory was 163.5MB in the beginning and 165.5MB in the end (delta: -2.1MB). Peak memory consumption was 105.6MB. Max. memory is 8.0GB. [2022-12-06 06:32:23,765 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 188.7MB. Free memory is still 164.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:32:23,765 INFO L158 Benchmark]: CACSL2BoogieTranslator took 531.02ms. Allocated memory is still 188.7MB. Free memory was 163.5MB in the beginning and 138.0MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-06 06:32:23,766 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.81ms. Allocated memory is still 188.7MB. Free memory was 138.0MB in the beginning and 135.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:32:23,766 INFO L158 Benchmark]: Boogie Preprocessor took 38.18ms. Allocated memory is still 188.7MB. Free memory was 135.9MB in the beginning and 133.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:32:23,766 INFO L158 Benchmark]: RCFGBuilder took 609.47ms. Allocated memory is still 188.7MB. Free memory was 133.8MB in the beginning and 102.4MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-06 06:32:23,767 INFO L158 Benchmark]: TraceAbstraction took 7984.64ms. Allocated memory was 188.7MB in the beginning and 295.7MB in the end (delta: 107.0MB). Free memory was 101.8MB in the beginning and 165.5MB in the end (delta: -63.7MB). Peak memory consumption was 43.8MB. Max. memory is 8.0GB. [2022-12-06 06:32:23,768 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.11ms. Allocated memory is still 188.7MB. Free memory is still 164.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 531.02ms. Allocated memory is still 188.7MB. Free memory was 163.5MB in the beginning and 138.0MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.81ms. Allocated memory is still 188.7MB. Free memory was 138.0MB in the beginning and 135.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.18ms. Allocated memory is still 188.7MB. Free memory was 135.9MB in the beginning and 133.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 609.47ms. Allocated memory is still 188.7MB. Free memory was 133.8MB in the beginning and 102.4MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 7984.64ms. Allocated memory was 188.7MB in the beginning and 295.7MB in the end (delta: 107.0MB). Free memory was 101.8MB in the beginning and 165.5MB in the end (delta: -63.7MB). Peak memory consumption was 43.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 94 PlacesBefore, 28 PlacesAfterwards, 89 TransitionsBefore, 22 TransitionsAfterwards, 1174 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 36 TrivialYvCompositions, 33 ConcurrentYvCompositions, 1 ChoiceCompositions, 71 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 900, independent: 851, independent conditional: 851, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 900, independent: 851, independent conditional: 0, independent unconditional: 851, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 900, independent: 851, independent conditional: 0, independent unconditional: 851, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 900, independent: 851, independent conditional: 0, independent unconditional: 851, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 738, independent: 709, independent conditional: 0, independent unconditional: 709, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 738, independent: 705, independent conditional: 0, independent unconditional: 705, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 33, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 148, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 141, dependent conditional: 0, dependent unconditional: 141, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 900, independent: 142, independent conditional: 0, independent unconditional: 142, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 738, unknown conditional: 0, unknown unconditional: 738] , Statistics on independence cache: Total cache size (in pairs): 1058, Positive cache size: 1029, Positive conditional cache size: 0, Positive unconditional cache size: 1029, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, 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, 23 PlacesBefore, 22 PlacesAfterwards, 16 TransitionsBefore, 15 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 95, independent: 62, independent conditional: 62, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 95, independent: 62, independent conditional: 17, independent unconditional: 45, dependent: 33, dependent conditional: 14, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 95, independent: 62, independent conditional: 17, independent unconditional: 45, dependent: 33, dependent conditional: 14, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 95, independent: 62, independent conditional: 17, independent unconditional: 45, dependent: 33, dependent conditional: 14, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 51, independent: 36, independent conditional: 9, independent unconditional: 27, dependent: 15, dependent conditional: 6, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 51, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 15, dependent conditional: 6, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 97, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 96, dependent conditional: 61, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 95, independent: 26, independent conditional: 8, independent unconditional: 18, dependent: 18, dependent conditional: 8, dependent unconditional: 10, unknown: 51, unknown conditional: 15, unknown unconditional: 36] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 38, Positive conditional cache size: 10, Positive unconditional cache size: 28, Negative cache size: 15, Negative conditional cache size: 6, Negative unconditional cache size: 9, 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.1s, 24 PlacesBefore, 24 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 98 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 44, independent: 33, independent conditional: 6, independent unconditional: 27, dependent: 11, dependent conditional: 3, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 44, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 44, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 46, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 44, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 69, Positive cache size: 48, Positive conditional cache size: 10, Positive unconditional cache size: 38, Negative cache size: 21, Negative conditional cache size: 6, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 24, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 19, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 50, Positive conditional cache size: 10, Positive unconditional cache size: 40, Negative cache size: 23, Negative conditional cache size: 6, Negative unconditional cache size: 17, 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.6s, 28 PlacesBefore, 26 PlacesAfterwards, 19 TransitionsBefore, 17 TransitionsAfterwards, 46 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 39, independent: 19, independent conditional: 1, independent unconditional: 18, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 39, independent: 19, independent conditional: 1, independent unconditional: 18, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 39, independent: 19, independent conditional: 1, independent unconditional: 18, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 39, independent: 18, independent conditional: 1, independent unconditional: 17, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 53, Positive conditional cache size: 10, Positive unconditional cache size: 43, Negative cache size: 27, Negative conditional cache size: 6, Negative unconditional cache size: 21, 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.8s, 29 PlacesBefore, 28 PlacesAfterwards, 17 TransitionsBefore, 16 TransitionsAfterwards, 38 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 42, independent conditional: 42, 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: 60, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 68, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 68, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 67, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 68, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 68, Positive conditional cache size: 14, Positive unconditional cache size: 54, Negative cache size: 31, Negative conditional cache size: 10, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - 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; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L815] 0 pthread_t t1601; [L816] FCALL, FORK 0 pthread_create(&t1601, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1601, ((void *)0), P0, ((void *)0))=-1, t1601={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, z=0] [L817] 0 pthread_t t1602; [L818] FCALL, FORK 0 pthread_create(&t1602, ((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(&t1602, ((void *)0), P1, ((void *)0))=0, t1601={5:0}, t1602={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, z=0] [L740] 1 x$w_buff1 = x$w_buff0 [L741] 1 x$w_buff0 = 1 [L742] 1 x$w_buff1_used = x$w_buff0_used [L743] 1 x$w_buff0_used = (_Bool)1 [L744] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L744] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L745] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L746] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L747] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L748] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L751] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L768] 2 y = 2 [L771] 2 z = 1 [L774] 2 __unbuffered_p1_EAX = z [L777] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L778] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L779] 2 x$flush_delayed = weak$$choice2 [L780] 2 x$mem_tmp = x [L781] 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) [L782] 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)) [L783] 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)) [L784] 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)) [L785] 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)) [L786] 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)) [L787] 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)) [L788] 2 __unbuffered_p1_EBX = x [L789] 2 x = x$flush_delayed ? x$mem_tmp : x [L790] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L793] 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) [L794] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L795] 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 [L796] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L797] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L754] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L755] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L756] 1 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 [L757] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 1 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 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L825] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L826] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L827] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L828] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L831] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=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: 818]: 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: 816]: 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, 111 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: 7.8s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 231 IncrementalHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 1 mSDtfsCounter, 231 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=5, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 234 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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:32:23,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...