/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:09:26,014 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:09:26,016 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:09:26,058 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:09:26,059 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:09:26,061 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:09:26,063 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:09:26,066 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:09:26,070 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:09:26,073 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:09:26,074 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:09:26,075 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:09:26,075 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:09:26,077 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:09:26,078 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:09:26,080 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:09:26,081 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:09:26,082 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:09:26,083 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:09:26,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:09:26,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:09:26,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:09:26,089 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:09:26,090 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:09:26,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:09:26,096 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:09:26,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:09:26,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:09:26,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:09:26,098 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:09:26,098 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:09:26,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:09:26,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:09:26,101 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:09:26,102 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:09:26,102 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:09:26,102 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:09:26,102 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:09:26,102 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:09:26,103 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:09:26,104 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:09:26,104 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 23:09:26,129 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:09:26,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:09:26,131 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:09:26,131 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:09:26,131 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:09:26,132 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:09:26,132 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:09:26,132 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:09:26,132 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:09:26,132 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:09:26,133 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:09:26,133 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:09:26,133 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:09:26,133 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:09:26,133 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:09:26,133 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:09:26,133 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:09:26,134 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:09:26,134 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:09:26,134 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:09:26,134 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:09:26,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:09:26,134 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:09:26,134 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:09:26,134 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:09:26,134 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:09:26,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:09:26,135 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:09:26,135 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 23:09:26,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:09:26,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:09:26,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:09:26,438 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:09:26,438 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:09:26,439 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-05 23:09:27,436 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:09:27,673 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:09:27,674 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-05 23:09:27,687 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6debd30b/64ef9af52b21418abdacc108ea5b2013/FLAG8dac2a9b8 [2022-12-05 23:09:27,700 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6debd30b/64ef9af52b21418abdacc108ea5b2013 [2022-12-05 23:09:27,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:09:27,703 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:09:27,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:09:27,705 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:09:27,707 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:09:27,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:09:27" (1/1) ... [2022-12-05 23:09:27,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@120a1b4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:09:27, skipping insertion in model container [2022-12-05 23:09:27,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:09:27" (1/1) ... [2022-12-05 23:09:27,712 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:09:27,756 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:09:27,890 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/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[995,1008] [2022-12-05 23:09:28,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:28,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:28,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:28,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:28,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:28,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:28,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:28,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:28,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:28,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:28,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:28,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:28,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:28,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:28,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:28,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:28,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:28,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:28,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:28,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:28,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:28,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:28,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:28,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:28,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:09:28,080 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:09:28,093 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/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[995,1008] [2022-12-05 23:09:28,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:28,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:28,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:28,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:28,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:28,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:28,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:28,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:28,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:28,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:28,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:28,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:28,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:28,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:28,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:28,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:28,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:28,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:28,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:28,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:28,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:28,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:28,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:28,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:28,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:09:28,160 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:09:28,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:09:28 WrapperNode [2022-12-05 23:09:28,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:09:28,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:09:28,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:09:28,161 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:09:28,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:09:28" (1/1) ... [2022-12-05 23:09:28,175 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:09:28" (1/1) ... [2022-12-05 23:09:28,191 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 113 [2022-12-05 23:09:28,191 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:09:28,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:09:28,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:09:28,192 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:09:28,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:09:28" (1/1) ... [2022-12-05 23:09:28,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:09:28" (1/1) ... [2022-12-05 23:09:28,217 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:09:28" (1/1) ... [2022-12-05 23:09:28,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:09:28" (1/1) ... [2022-12-05 23:09:28,245 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:09:28" (1/1) ... [2022-12-05 23:09:28,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:09:28" (1/1) ... [2022-12-05 23:09:28,248 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:09:28" (1/1) ... [2022-12-05 23:09:28,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:09:28" (1/1) ... [2022-12-05 23:09:28,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:09:28,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:09:28,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:09:28,252 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:09:28,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:09:28" (1/1) ... [2022-12-05 23:09:28,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:09:28,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:09:28,309 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 23:09:28,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 23:09:28,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:09:28,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:09:28,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:09:28,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:09:28,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:09:28,347 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:09:28,347 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:09:28,347 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:09:28,347 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:09:28,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:09:28,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:09:28,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:09:28,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:09:28,349 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:09:28,523 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:09:28,525 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:09:28,704 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:09:28,799 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:09:28,800 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:09:28,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:09:28 BoogieIcfgContainer [2022-12-05 23:09:28,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:09:28,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:09:28,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:09:28,806 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:09:28,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:09:27" (1/3) ... [2022-12-05 23:09:28,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@609d136a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:09:28, skipping insertion in model container [2022-12-05 23:09:28,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:09:28" (2/3) ... [2022-12-05 23:09:28,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@609d136a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:09:28, skipping insertion in model container [2022-12-05 23:09:28,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:09:28" (3/3) ... [2022-12-05 23:09:28,808 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-05 23:09:28,820 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:09:28,821 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:09:28,821 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:09:28,862 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:09:28,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 188 flow [2022-12-05 23:09:28,935 INFO L130 PetriNetUnfolder]: 2/87 cut-off events. [2022-12-05 23:09:28,935 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:09:28,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-05 23:09:28,939 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 89 transitions, 188 flow [2022-12-05 23:09:28,942 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 87 transitions, 180 flow [2022-12-05 23:09:28,943 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:09:28,958 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 87 transitions, 180 flow [2022-12-05 23:09:28,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 87 transitions, 180 flow [2022-12-05 23:09:28,987 INFO L130 PetriNetUnfolder]: 2/87 cut-off events. [2022-12-05 23:09:28,988 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:09:28,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-05 23:09:28,990 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 87 transitions, 180 flow [2022-12-05 23:09:28,990 INFO L188 LiptonReduction]: Number of co-enabled transitions 1104 [2022-12-05 23:09:31,931 INFO L203 LiptonReduction]: Total number of compositions: 69 [2022-12-05 23:09:31,941 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:09:31,946 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;@104af766, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:09:31,946 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-05 23:09:31,947 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-05 23:09:31,948 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:09:31,948 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:09:31,948 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-05 23:09:31,948 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-05 23:09:31,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:09:31,952 INFO L85 PathProgramCache]: Analyzing trace with hash 405344, now seen corresponding path program 1 times [2022-12-05 23:09:31,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:09:31,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929535523] [2022-12-05 23:09:31,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:09:31,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:09:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:09:32,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:09:32,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:09:32,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929535523] [2022-12-05 23:09:32,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929535523] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:09:32,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:09:32,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:09:32,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471979402] [2022-12-05 23:09:32,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:09:32,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:09:32,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:09:32,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:09:32,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:09:32,213 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2022-12-05 23:09:32,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:09:32,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:09:32,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2022-12-05 23:09:32,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:09:32,296 INFO L130 PetriNetUnfolder]: 176/345 cut-off events. [2022-12-05 23:09:32,296 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 23:09:32,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 668 conditions, 345 events. 176/345 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1560 event pairs, 20 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 658. Up to 256 conditions per place. [2022-12-05 23:09:32,299 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 21 selfloop transitions, 2 changer transitions 6/31 dead transitions. [2022-12-05 23:09:32,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 31 transitions, 129 flow [2022-12-05 23:09:32,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:09:32,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:09:32,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-05 23:09:32,309 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2022-12-05 23:09:32,310 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 50 flow. Second operand 3 states and 40 transitions. [2022-12-05 23:09:32,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 31 transitions, 129 flow [2022-12-05 23:09:32,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 31 transitions, 126 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:09:32,313 INFO L231 Difference]: Finished difference. Result has 26 places, 16 transitions, 40 flow [2022-12-05 23:09:32,314 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-05 23:09:32,317 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, -2 predicate places. [2022-12-05 23:09:32,317 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:09:32,317 INFO L89 Accepts]: Start accepts. Operand has 26 places, 16 transitions, 40 flow [2022-12-05 23:09:32,319 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:09:32,319 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:09:32,319 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 16 transitions, 40 flow [2022-12-05 23:09:32,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 40 flow [2022-12-05 23:09:32,324 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-05 23:09:32,324 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:09:32,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 16 events. 0/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:09:32,324 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 40 flow [2022-12-05 23:09:32,324 INFO L188 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-05 23:09:32,385 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:09:32,386 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-05 23:09:32,386 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 16 transitions, 40 flow [2022-12-05 23:09:32,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:09:32,387 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:09:32,387 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:09:32,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:09:32,387 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-05 23:09:32,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:09:32,388 INFO L85 PathProgramCache]: Analyzing trace with hash 768283317, now seen corresponding path program 1 times [2022-12-05 23:09:32,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:09:32,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253729093] [2022-12-05 23:09:32,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:09:32,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:09:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:09:32,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:09:32,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:09:32,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253729093] [2022-12-05 23:09:32,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253729093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:09:32,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:09:32,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:09:32,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882921599] [2022-12-05 23:09:32,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:09:32,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:09:32,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:09:32,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:09:32,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:09:32,504 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-05 23:09:32,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 16 transitions, 40 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-05 23:09:32,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:09:32,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-05 23:09:32,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:09:32,558 INFO L130 PetriNetUnfolder]: 171/300 cut-off events. [2022-12-05 23:09:32,558 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-05 23:09:32,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 300 events. 171/300 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 988 event pairs, 69 based on Foata normal form. 2/302 useless extension candidates. Maximal degree in co-relation 631. Up to 286 conditions per place. [2022-12-05 23:09:32,560 INFO L137 encePairwiseOnDemand]: 12/16 looper letters, 20 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2022-12-05 23:09:32,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 23 transitions, 104 flow [2022-12-05 23:09:32,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:09:32,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:09:32,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-12-05 23:09:32,561 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-05 23:09:32,561 INFO L175 Difference]: Start difference. First operand has 23 places, 16 transitions, 40 flow. Second operand 3 states and 24 transitions. [2022-12-05 23:09:32,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 23 transitions, 104 flow [2022-12-05 23:09:32,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 23 transitions, 98 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:09:32,562 INFO L231 Difference]: Finished difference. Result has 24 places, 18 transitions, 55 flow [2022-12-05 23:09:32,563 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=55, PETRI_PLACES=24, PETRI_TRANSITIONS=18} [2022-12-05 23:09:32,563 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, -4 predicate places. [2022-12-05 23:09:32,563 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:09:32,563 INFO L89 Accepts]: Start accepts. Operand has 24 places, 18 transitions, 55 flow [2022-12-05 23:09:32,564 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:09:32,564 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:09:32,564 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 18 transitions, 55 flow [2022-12-05 23:09:32,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 18 transitions, 55 flow [2022-12-05 23:09:32,568 INFO L130 PetriNetUnfolder]: 3/30 cut-off events. [2022-12-05 23:09:32,568 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:09:32,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 30 events. 3/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 1 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 41. Up to 10 conditions per place. [2022-12-05 23:09:32,569 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 18 transitions, 55 flow [2022-12-05 23:09:32,569 INFO L188 LiptonReduction]: Number of co-enabled transitions 112 [2022-12-05 23:09:32,629 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:09:32,630 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-05 23:09:32,630 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 55 flow [2022-12-05 23:09:32,631 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-05 23:09:32,631 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:09:32,631 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:09:32,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:09:32,631 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-05 23:09:32,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:09:32,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1953020390, now seen corresponding path program 1 times [2022-12-05 23:09:32,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:09:32,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768901940] [2022-12-05 23:09:32,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:09:32,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:09:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:09:32,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:09:32,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:09:32,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768901940] [2022-12-05 23:09:32,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768901940] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:09:32,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:09:32,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:09:32,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663879745] [2022-12-05 23:09:32,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:09:32,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:09:32,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:09:32,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:09:32,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:09:32,759 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-05 23:09:32,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:09:32,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:09:32,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-05 23:09:32,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:09:32,813 INFO L130 PetriNetUnfolder]: 139/256 cut-off events. [2022-12-05 23:09:32,813 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-12-05 23:09:32,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 256 events. 139/256 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 841 event pairs, 46 based on Foata normal form. 8/263 useless extension candidates. Maximal degree in co-relation 558. Up to 184 conditions per place. [2022-12-05 23:09:32,815 INFO L137 encePairwiseOnDemand]: 13/16 looper letters, 19 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2022-12-05 23:09:32,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 23 transitions, 107 flow [2022-12-05 23:09:32,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:09:32,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:09:32,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-12-05 23:09:32,819 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-05 23:09:32,819 INFO L175 Difference]: Start difference. First operand has 24 places, 18 transitions, 55 flow. Second operand 3 states and 24 transitions. [2022-12-05 23:09:32,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 23 transitions, 107 flow [2022-12-05 23:09:32,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 23 transitions, 104 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:09:32,820 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 60 flow [2022-12-05 23:09:32,820 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2022-12-05 23:09:32,821 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, -2 predicate places. [2022-12-05 23:09:32,821 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:09:32,821 INFO L89 Accepts]: Start accepts. Operand has 26 places, 18 transitions, 60 flow [2022-12-05 23:09:32,821 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:09:32,822 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:09:32,822 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 18 transitions, 60 flow [2022-12-05 23:09:32,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 18 transitions, 60 flow [2022-12-05 23:09:32,825 INFO L130 PetriNetUnfolder]: 2/24 cut-off events. [2022-12-05 23:09:32,825 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 23:09:32,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 24 events. 2/24 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 37. Up to 8 conditions per place. [2022-12-05 23:09:32,826 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 18 transitions, 60 flow [2022-12-05 23:09:32,826 INFO L188 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-05 23:09:32,847 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:09:32,848 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-05 23:09:32,848 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 60 flow [2022-12-05 23:09:32,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:09:32,849 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:09:32,849 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:09:32,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:09:32,849 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-05 23:09:32,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:09:32,850 INFO L85 PathProgramCache]: Analyzing trace with hash -413602129, now seen corresponding path program 1 times [2022-12-05 23:09:32,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:09:32,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719622050] [2022-12-05 23:09:32,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:09:32,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:09:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:09:33,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:09:33,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:09:33,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719622050] [2022-12-05 23:09:33,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719622050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:09:33,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:09:33,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:09:33,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753881143] [2022-12-05 23:09:33,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:09:33,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:09:33,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:09:33,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:09:33,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:09:33,044 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 16 [2022-12-05 23:09:33,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 18 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:09:33,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:09:33,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 16 [2022-12-05 23:09:33,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:09:33,117 INFO L130 PetriNetUnfolder]: 67/159 cut-off events. [2022-12-05 23:09:33,118 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-05 23:09:33,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371 conditions, 159 events. 67/159 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 568 event pairs, 30 based on Foata normal form. 24/182 useless extension candidates. Maximal degree in co-relation 358. Up to 67 conditions per place. [2022-12-05 23:09:33,120 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 28 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2022-12-05 23:09:33,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 35 transitions, 164 flow [2022-12-05 23:09:33,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:09:33,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:09:33,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-05 23:09:33,122 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.640625 [2022-12-05 23:09:33,122 INFO L175 Difference]: Start difference. First operand has 26 places, 18 transitions, 60 flow. Second operand 4 states and 41 transitions. [2022-12-05 23:09:33,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 35 transitions, 164 flow [2022-12-05 23:09:33,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 35 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:09:33,124 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 86 flow [2022-12-05 23:09:33,124 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2022-12-05 23:09:33,125 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 1 predicate places. [2022-12-05 23:09:33,125 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:09:33,125 INFO L89 Accepts]: Start accepts. Operand has 29 places, 21 transitions, 86 flow [2022-12-05 23:09:33,126 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:09:33,127 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:09:33,127 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 21 transitions, 86 flow [2022-12-05 23:09:33,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 21 transitions, 86 flow [2022-12-05 23:09:33,133 INFO L130 PetriNetUnfolder]: 6/41 cut-off events. [2022-12-05 23:09:33,133 INFO L131 PetriNetUnfolder]: For 11/14 co-relation queries the response was YES. [2022-12-05 23:09:33,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 41 events. 6/41 cut-off events. For 11/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 114 event pairs, 1 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 89. Up to 17 conditions per place. [2022-12-05 23:09:33,134 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 21 transitions, 86 flow [2022-12-05 23:09:33,134 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-05 23:09:33,277 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:09:33,278 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 153 [2022-12-05 23:09:33,278 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 88 flow [2022-12-05 23:09:33,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:09:33,278 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:09:33,278 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:09:33,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:09:33,278 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-05 23:09:33,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:09:33,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1774297146, now seen corresponding path program 1 times [2022-12-05 23:09:33,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:09:33,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105571954] [2022-12-05 23:09:33,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:09:33,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:09:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:09:33,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:09:33,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:09:33,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105571954] [2022-12-05 23:09:33,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105571954] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:09:33,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:09:33,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:09:33,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370805211] [2022-12-05 23:09:33,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:09:33,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:09:33,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:09:33,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:09:33,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:09:33,605 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-05 23:09:33,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:09:33,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:09:33,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-05 23:09:33,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:09:33,685 INFO L130 PetriNetUnfolder]: 25/75 cut-off events. [2022-12-05 23:09:33,685 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-05 23:09:33,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 75 events. 25/75 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 196 event pairs, 10 based on Foata normal form. 9/83 useless extension candidates. Maximal degree in co-relation 206. Up to 32 conditions per place. [2022-12-05 23:09:33,687 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 19 selfloop transitions, 6 changer transitions 0/28 dead transitions. [2022-12-05 23:09:33,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 28 transitions, 155 flow [2022-12-05 23:09:33,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:09:33,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:09:33,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-05 23:09:33,689 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4235294117647059 [2022-12-05 23:09:33,689 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 88 flow. Second operand 5 states and 36 transitions. [2022-12-05 23:09:33,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 28 transitions, 155 flow [2022-12-05 23:09:33,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 28 transitions, 140 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-05 23:09:33,692 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 97 flow [2022-12-05 23:09:33,692 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=97, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2022-12-05 23:09:33,694 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 4 predicate places. [2022-12-05 23:09:33,695 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:09:33,695 INFO L89 Accepts]: Start accepts. Operand has 32 places, 21 transitions, 97 flow [2022-12-05 23:09:33,697 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:09:33,697 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:09:33,697 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 21 transitions, 97 flow [2022-12-05 23:09:33,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 21 transitions, 97 flow [2022-12-05 23:09:33,704 INFO L130 PetriNetUnfolder]: 3/29 cut-off events. [2022-12-05 23:09:33,705 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-05 23:09:33,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 29 events. 3/29 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 62. Up to 9 conditions per place. [2022-12-05 23:09:33,708 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 21 transitions, 97 flow [2022-12-05 23:09:33,708 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-05 23:09:34,269 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [360] L793-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.base_11| 0) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P1Thread1of1ForFork1_#res.offset_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] and [386] L813-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd0~0_171 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_432 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_159 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_433 256) 0)))) (.cse2 (and .cse5 .cse3)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_384 256) 0))))) (and (= (ite .cse0 v_~x$w_buff0~0_280 (ite .cse1 v_~x$w_buff1~0_231 v_~x~0_318)) v_~x~0_317) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_65|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_63| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|) (= (mod v_~main$tmp_guard0~0_78 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|) (= (ite .cse0 0 v_~x$w_buff0_used~0_433) v_~x$w_buff0_used~0_432) (= v_~main$tmp_guard0~0_78 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_91) 1 0) 0) 0 1)) (= v_~x$r_buff0_thd0~0_158 (ite .cse2 0 v_~x$r_buff0_thd0~0_159)) (= v_~x$r_buff1_thd0~0_170 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_158 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_383 256) 0)))) 0 v_~x$r_buff1_thd0~0_171)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_63| 0)) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_94 0) (= v_~y~0_87 2) (= 2 v_~__unbuffered_p1_EAX~0_62))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_54) (= v_~x$w_buff1_used~0_383 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_384)) (= (mod v_~main$tmp_guard1~0_54 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_65| 0)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_280, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_159, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_94, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_62, ~x$w_buff1~0=v_~x$w_buff1~0_231, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_384, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_171, ~y~0=v_~y~0_87, ~x~0=v_~x~0_318, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_433} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_280, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_158, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_65|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_94, ~x$w_buff1~0=v_~x$w_buff1~0_231, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_383, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_54, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_78, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_170, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_432, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_62, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_63|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_49|, ~y~0=v_~y~0_87, ~x~0=v_~x~0_317, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|} 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-05 23:09:34,459 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [328] L757-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_32 1) v_~__unbuffered_cnt~0_31) (= |v_P0Thread1of1ForFork0_#res#1.base_9| 0) (= |v_P0Thread1of1ForFork0_#res#1.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#res#1.offset=|v_P0Thread1of1ForFork0_#res#1.offset_9|, P0Thread1of1ForFork0_#res#1.base=|v_P0Thread1of1ForFork0_#res#1.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res#1.offset, P0Thread1of1ForFork0_#res#1.base, ~__unbuffered_cnt~0] and [386] L813-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd0~0_171 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_432 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_159 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_433 256) 0)))) (.cse2 (and .cse5 .cse3)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_384 256) 0))))) (and (= (ite .cse0 v_~x$w_buff0~0_280 (ite .cse1 v_~x$w_buff1~0_231 v_~x~0_318)) v_~x~0_317) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_65|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_63| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|) (= (mod v_~main$tmp_guard0~0_78 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|) (= (ite .cse0 0 v_~x$w_buff0_used~0_433) v_~x$w_buff0_used~0_432) (= v_~main$tmp_guard0~0_78 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_91) 1 0) 0) 0 1)) (= v_~x$r_buff0_thd0~0_158 (ite .cse2 0 v_~x$r_buff0_thd0~0_159)) (= v_~x$r_buff1_thd0~0_170 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_158 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_383 256) 0)))) 0 v_~x$r_buff1_thd0~0_171)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_63| 0)) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_94 0) (= v_~y~0_87 2) (= 2 v_~__unbuffered_p1_EAX~0_62))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_54) (= v_~x$w_buff1_used~0_383 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_384)) (= (mod v_~main$tmp_guard1~0_54 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_65| 0)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_280, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_159, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_94, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_62, ~x$w_buff1~0=v_~x$w_buff1~0_231, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_384, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_171, ~y~0=v_~y~0_87, ~x~0=v_~x~0_318, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_433} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_280, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_158, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_65|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_94, ~x$w_buff1~0=v_~x$w_buff1~0_231, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_383, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_54, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_78, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_170, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_432, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_62, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_63|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_49|, ~y~0=v_~y~0_87, ~x~0=v_~x~0_317, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|} 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-05 23:09:34,686 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:09:34,690 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 995 [2022-12-05 23:09:34,690 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 93 flow [2022-12-05 23:09:34,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:09:34,690 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:09:34,690 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:09:34,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:09:34,690 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-05 23:09:34,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:09:34,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1253478925, now seen corresponding path program 1 times [2022-12-05 23:09:34,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:09:34,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067018880] [2022-12-05 23:09:34,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:09:34,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:09:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:09:35,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:09:35,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:09:35,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067018880] [2022-12-05 23:09:35,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067018880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:09:35,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:09:35,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:09:35,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057688601] [2022-12-05 23:09:35,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:09:35,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:09:35,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:09:35,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:09:35,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:09:35,023 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 16 [2022-12-05 23:09:35,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 18 transitions, 93 flow. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:09:35,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:09:35,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 16 [2022-12-05 23:09:35,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:09:35,147 INFO L130 PetriNetUnfolder]: 22/65 cut-off events. [2022-12-05 23:09:35,147 INFO L131 PetriNetUnfolder]: For 81/81 co-relation queries the response was YES. [2022-12-05 23:09:35,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 65 events. 22/65 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 179 event pairs, 0 based on Foata normal form. 2/67 useless extension candidates. Maximal degree in co-relation 186. Up to 22 conditions per place. [2022-12-05 23:09:35,148 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 17 selfloop transitions, 5 changer transitions 7/32 dead transitions. [2022-12-05 23:09:35,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 204 flow [2022-12-05 23:09:35,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:09:35,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:09:35,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-12-05 23:09:35,149 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4375 [2022-12-05 23:09:35,149 INFO L175 Difference]: Start difference. First operand has 29 places, 18 transitions, 93 flow. Second operand 6 states and 42 transitions. [2022-12-05 23:09:35,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 204 flow [2022-12-05 23:09:35,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 32 transitions, 163 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-12-05 23:09:35,150 INFO L231 Difference]: Finished difference. Result has 29 places, 17 transitions, 74 flow [2022-12-05 23:09:35,150 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=74, PETRI_PLACES=29, PETRI_TRANSITIONS=17} [2022-12-05 23:09:35,151 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 1 predicate places. [2022-12-05 23:09:35,151 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:09:35,151 INFO L89 Accepts]: Start accepts. Operand has 29 places, 17 transitions, 74 flow [2022-12-05 23:09:35,151 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:09:35,151 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:09:35,152 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 17 transitions, 74 flow [2022-12-05 23:09:35,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 17 transitions, 74 flow [2022-12-05 23:09:35,155 INFO L130 PetriNetUnfolder]: 2/23 cut-off events. [2022-12-05 23:09:35,155 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-05 23:09:35,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 23 events. 2/23 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 42. Up to 5 conditions per place. [2022-12-05 23:09:35,155 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 17 transitions, 74 flow [2022-12-05 23:09:35,155 INFO L188 LiptonReduction]: Number of co-enabled transitions 48 [2022-12-05 23:09:35,893 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [391] L750-->P0EXIT: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd1~0_134 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_469 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_186 256) 0)))) (let ((.cse4 (and .cse1 .cse5)) (.cse0 (and .cse5 (not (= 0 (mod v_~x$w_buff0_used~0_470 256))))) (.cse3 (and (not (= (mod v_~x$w_buff1_used~0_420 256) 0)) .cse2))) (and (= v_~x$w_buff0_used~0_469 (ite .cse0 0 v_~x$w_buff0_used~0_470)) (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= |v_P0Thread1of1ForFork0_#res#1.base_21| 0) (= v_~x$r_buff1_thd1~0_133 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_185 256) 0)) .cse1) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_419 256) 0)))) 0 v_~x$r_buff1_thd1~0_134)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_420) v_~x$w_buff1_used~0_419) (= v_~x$r_buff0_thd1~0_185 (ite .cse4 0 v_~x$r_buff0_thd1~0_186)) (= 0 |v_P0Thread1of1ForFork0_#res#1.offset_21|) (= (ite .cse0 v_~x$w_buff0~0_298 (ite .cse3 v_~x$w_buff1~0_248 v_~x~0_354)) v_~x~0_353)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_298, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_186, ~x$w_buff1~0=v_~x$w_buff1~0_248, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_420, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_134, ~x~0=v_~x~0_354, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_470} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_298, P0Thread1of1ForFork0_#res#1.offset=|v_P0Thread1of1ForFork0_#res#1.offset_21|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_185, P0Thread1of1ForFork0_#res#1.base=|v_P0Thread1of1ForFork0_#res#1.base_21|, ~x$w_buff1~0=v_~x$w_buff1~0_248, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_419, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_133, ~x~0=v_~x~0_353, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_469} 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 [388] L793-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_446 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd0~0_179 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_167 256) 0)))) (let ((.cse3 (and (not (= (mod v_~x$w_buff0_used~0_447 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff1_used~0_398 256) 0)) .cse2)) (.cse0 (and .cse5 .cse1))) (and (= |v_P1Thread1of1ForFork1_#res.base_21| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_67| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|) (= (ite (= (ite (= 2 v_~__unbuffered_cnt~0_95) 1 0) 0) 0 1) v_~main$tmp_guard0~0_82) (= v_~x$r_buff0_thd0~0_166 (ite .cse0 0 v_~x$r_buff0_thd0~0_167)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_67| 0)) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_100 0) (= v_~y~0_91 2) (= 2 v_~__unbuffered_p1_EAX~0_66))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_58) (= (mod v_~main$tmp_guard1~0_58 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_69|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_69| 0) (= (mod v_~main$tmp_guard0~0_82 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|) (= v_~x$r_buff1_thd0~0_178 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_166 256) 0)) .cse1) (and (not (= (mod v_~x$w_buff1_used~0_397 256) 0)) .cse2)) 0 v_~x$r_buff1_thd0~0_179)) (= (+ v_~__unbuffered_cnt~0_96 1) v_~__unbuffered_cnt~0_95) (= |v_P1Thread1of1ForFork1_#res.offset_21| 0) (= (ite .cse3 0 v_~x$w_buff0_used~0_447) v_~x$w_buff0_used~0_446) (= (ite .cse3 v_~x$w_buff0~0_288 (ite .cse4 v_~x$w_buff1~0_239 v_~x~0_332)) v_~x~0_331) (= (ite (or .cse4 .cse0) 0 v_~x$w_buff1_used~0_398) v_~x$w_buff1_used~0_397)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_288, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_167, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_100, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ~x$w_buff1~0=v_~x$w_buff1~0_239, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_398, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_179, ~y~0=v_~y~0_91, ~x~0=v_~x~0_332, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_447} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_288, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_166, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_69|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_100, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_21|, ~x$w_buff1~0=v_~x$w_buff1~0_239, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_397, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_58, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_82, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_178, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_446, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_67|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_43|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_53|, ~y~0=v_~y~0_91, ~x~0=v_~x~0_331, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_21|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, P1Thread1of1ForFork1_#res.offset, ~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, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~pre7#1, ~x~0, P1Thread1of1ForFork1_#res.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-05 23:09:36,939 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-05 23:09:36,940 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1789 [2022-12-05 23:09:36,940 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 14 transitions, 69 flow [2022-12-05 23:09:36,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:09:36,940 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:09:36,941 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:09:36,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:09:36,941 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:09:36,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:09:36,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1487771903, now seen corresponding path program 1 times [2022-12-05 23:09:36,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:09:36,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110520533] [2022-12-05 23:09:36,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:09:36,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:09:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:09:36,978 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 23:09:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:09:37,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 23:09:37,039 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 23:09:37,040 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-05 23:09:37,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-05 23:09:37,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-05 23:09:37,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-05 23:09:37,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-05 23:09:37,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:09:37,041 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:09:37,045 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:09:37,045 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:09:37,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:09:37 BasicIcfg [2022-12-05 23:09:37,124 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:09:37,124 INFO L158 Benchmark]: Toolchain (without parser) took 9421.56ms. Allocated memory was 219.2MB in the beginning and 333.4MB in the end (delta: 114.3MB). Free memory was 193.3MB in the beginning and 292.6MB in the end (delta: -99.3MB). Peak memory consumption was 15.5MB. Max. memory is 8.0GB. [2022-12-05 23:09:37,124 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 219.2MB. Free memory was 195.8MB in the beginning and 195.7MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:09:37,125 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.12ms. Allocated memory is still 219.2MB. Free memory was 193.3MB in the beginning and 168.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-05 23:09:37,125 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.33ms. Allocated memory is still 219.2MB. Free memory was 168.1MB in the beginning and 166.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:09:37,125 INFO L158 Benchmark]: Boogie Preprocessor took 59.21ms. Allocated memory is still 219.2MB. Free memory was 166.0MB in the beginning and 163.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:09:37,125 INFO L158 Benchmark]: RCFGBuilder took 550.14ms. Allocated memory is still 219.2MB. Free memory was 163.9MB in the beginning and 131.9MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-05 23:09:37,125 INFO L158 Benchmark]: TraceAbstraction took 8319.90ms. Allocated memory was 219.2MB in the beginning and 333.4MB in the end (delta: 114.3MB). Free memory was 131.4MB in the beginning and 292.6MB in the end (delta: -161.1MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:09:37,127 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 219.2MB. Free memory was 195.8MB in the beginning and 195.7MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 456.12ms. Allocated memory is still 219.2MB. Free memory was 193.3MB in the beginning and 168.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.33ms. Allocated memory is still 219.2MB. Free memory was 168.1MB in the beginning and 166.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 59.21ms. Allocated memory is still 219.2MB. Free memory was 166.0MB in the beginning and 163.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 550.14ms. Allocated memory is still 219.2MB. Free memory was 163.9MB in the beginning and 131.9MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 8319.90ms. Allocated memory was 219.2MB in the beginning and 333.4MB in the end (delta: 114.3MB). Free memory was 131.4MB in the beginning and 292.6MB in the end (delta: -161.1MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 92 PlacesBefore, 28 PlacesAfterwards, 87 TransitionsBefore, 22 TransitionsAfterwards, 1104 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 35 TrivialYvCompositions, 32 ConcurrentYvCompositions, 1 ChoiceCompositions, 69 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 953, independent: 907, independent conditional: 907, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 953, independent: 907, independent conditional: 0, independent unconditional: 907, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 953, independent: 907, independent conditional: 0, independent unconditional: 907, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 953, independent: 907, independent conditional: 0, independent unconditional: 907, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 728, independent: 698, independent conditional: 0, independent unconditional: 698, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 728, independent: 692, independent conditional: 0, independent unconditional: 692, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 36, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 176, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 953, independent: 209, independent conditional: 0, independent unconditional: 209, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 728, unknown conditional: 0, unknown unconditional: 728] , Statistics on independence cache: Total cache size (in pairs): 1065, Positive cache size: 1035, Positive conditional cache size: 0, Positive unconditional cache size: 1035, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 23 PlacesBefore, 23 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51, independent: 33, independent conditional: 33, 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: 51, independent: 33, independent conditional: 10, independent unconditional: 23, dependent: 18, dependent conditional: 7, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 51, independent: 33, independent conditional: 10, independent unconditional: 23, dependent: 18, dependent conditional: 7, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 51, independent: 33, independent conditional: 10, independent unconditional: 23, dependent: 18, dependent conditional: 7, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 46, independent: 31, independent conditional: 10, independent unconditional: 21, 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: 46, independent: 30, independent conditional: 0, independent unconditional: 30, 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: 58, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 56, dependent conditional: 31, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 51, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 46, unknown conditional: 16, unknown unconditional: 30] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 31, Positive conditional cache size: 10, Positive unconditional cache size: 21, 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, 18 TransitionsBefore, 18 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 58, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 36, Positive conditional cache size: 10, Positive unconditional cache size: 26, 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.0s, 26 PlacesBefore, 26 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 61, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 61, independent: 46, independent conditional: 7, independent unconditional: 39, dependent: 15, dependent conditional: 1, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 61, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 61, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 22, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 61, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 22, unknown conditional: 0, unknown unconditional: 22] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 54, Positive conditional cache size: 10, Positive unconditional cache size: 44, 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: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 29 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, independent: 29, independent conditional: 29, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 57, independent: 29, independent conditional: 14, independent unconditional: 15, dependent: 28, dependent conditional: 4, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 57, independent: 29, independent conditional: 2, independent unconditional: 27, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 57, independent: 29, independent conditional: 2, independent unconditional: 27, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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] ], Cache Queries: [ total: 57, independent: 26, independent conditional: 2, independent unconditional: 24, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 58, Positive conditional cache size: 10, Positive unconditional cache size: 48, Negative cache size: 28, Negative conditional cache size: 6, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 32 PlacesBefore, 29 PlacesAfterwards, 21 TransitionsBefore, 18 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 105, independent: 79, independent conditional: 79, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 105, independent: 79, independent conditional: 27, independent unconditional: 52, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 105, independent: 79, independent conditional: 16, independent unconditional: 63, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 105, independent: 79, independent conditional: 16, independent unconditional: 63, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 1, independent unconditional: 1, 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: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 105, independent: 77, independent conditional: 15, independent unconditional: 62, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 4, unknown conditional: 1, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 61, Positive conditional cache size: 11, Positive unconditional cache size: 50, Negative cache size: 30, Negative conditional cache size: 6, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 28 PlacesBefore, 25 PlacesAfterwards, 17 TransitionsBefore, 14 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 91, independent: 59, independent conditional: 59, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 91, independent: 59, independent conditional: 58, independent unconditional: 1, dependent: 32, dependent conditional: 24, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 95, independent: 59, independent conditional: 58, independent unconditional: 1, dependent: 36, dependent conditional: 28, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 95, independent: 59, independent conditional: 58, independent unconditional: 1, dependent: 36, dependent conditional: 28, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 12, independent conditional: 11, independent unconditional: 1, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 110, independent: 51, independent conditional: 51, independent unconditional: 0, dependent: 59, dependent conditional: 59, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 95, independent: 47, independent conditional: 47, independent unconditional: 0, dependent: 28, dependent conditional: 20, dependent unconditional: 8, unknown: 20, unknown conditional: 19, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 79, Positive conditional cache size: 22, Positive unconditional cache size: 57, Negative cache size: 38, Negative conditional cache size: 14, Negative unconditional cache size: 24, 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; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t1705; [L811] FCALL, FORK 0 pthread_create(&t1705, ((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(&t1705, ((void *)0), P0, ((void *)0))=-1, t1705={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 0 pthread_t t1706; [L813] FCALL, FORK 0 pthread_create(&t1706, ((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(&t1706, ((void *)0), P1, ((void *)0))=0, t1705={5:0}, t1706={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] [L738] 1 x$w_buff1 = x$w_buff0 [L739] 1 x$w_buff0 = 1 [L740] 1 x$w_buff1_used = x$w_buff0_used [L741] 1 x$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L743] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L744] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L745] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L746] 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] [L749] 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] [L766] 2 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=2] [L769] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=2] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 x$flush_delayed = weak$$choice2 [L775] 2 x$mem_tmp = x [L776] 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) [L777] 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)) [L778] 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)) [L779] 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)) [L780] 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)) [L781] 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)) [L782] 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)) [L783] 2 __unbuffered_p1_EBX = x [L784] 2 x = x$flush_delayed ? x$mem_tmp : x [L785] 2 x$flush_delayed = (_Bool)0 [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L752] 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) [L753] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L754] 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 [L755] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L756] 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 [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L815] 1 main$tmp_guard0 = __unbuffered_cnt == 2 [L817] CALL 1 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 1 !(!cond) [L817] RET 1 assume_abort_if_not(main$tmp_guard0) [L819] 1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L820] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L821] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L822] 1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L823] 1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L826] 1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L828] CALL 1 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 1 !expression [L18] 1 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=65, 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] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 108 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 89 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 89 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 242 IncrementalHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 3 mSDtfsCounter, 242 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=5, InterpolantAutomatonStates: 24, 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.1s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 46 ConstructedInterpolants, 0 QuantifiedInterpolants, 218 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 23:09:37,172 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...