/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/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:49:33,432 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:49:33,434 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:49:33,471 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:49:33,471 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:49:33,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:49:33,475 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:49:33,478 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:49:33,481 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:49:33,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:49:33,485 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:49:33,488 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:49:33,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:49:33,490 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:49:33,490 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:49:33,493 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:49:33,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:49:33,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:49:33,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:49:33,499 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:49:33,500 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:49:33,500 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:49:33,501 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:49:33,502 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:49:33,506 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:49:33,506 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:49:33,507 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:49:33,508 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:49:33,508 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:49:33,509 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:49:33,509 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:49:33,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:49:33,511 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:49:33,511 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:49:33,512 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:49:33,512 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:49:33,512 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:49:33,512 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:49:33,512 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:49:33,513 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:49:33,513 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:49:33,514 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-13 00:49:33,539 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:49:33,540 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:49:33,541 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:49:33,541 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:49:33,541 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:49:33,558 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:49:33,558 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:49:33,558 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:49:33,558 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:49:33,558 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:49:33,559 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:49:33,559 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:49:33,559 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:49:33,559 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:49:33,559 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:49:33,559 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:49:33,559 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:49:33,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:49:33,560 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:49:33,560 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:49:33,560 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:49:33,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:49:33,560 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:49:33,560 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:49:33,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:49:33,560 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:49:33,560 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:49:33,560 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:49:33,561 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-13 00:49:33,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:49:33,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:49:33,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:49:33,834 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:49:33,834 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:49:33,835 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 00:49:34,755 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:49:35,001 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:49:35,002 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 00:49:35,019 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b48ae3646/8d24c8ff3ce14ea986ffc2b984a7f130/FLAG8e22ad06c [2022-12-13 00:49:35,031 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b48ae3646/8d24c8ff3ce14ea986ffc2b984a7f130 [2022-12-13 00:49:35,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:49:35,034 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:49:35,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:49:35,035 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:49:35,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:49:35,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:49:35" (1/1) ... [2022-12-13 00:49:35,038 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7812fe35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:35, skipping insertion in model container [2022-12-13 00:49:35,038 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:49:35" (1/1) ... [2022-12-13 00:49:35,043 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:49:35,086 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:49:35,183 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/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-13 00:49:35,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:35,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:35,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:35,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:35,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:35,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:35,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:35,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:35,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:35,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:35,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:35,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:35,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:35,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:35,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:35,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:35,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:35,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:35,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:35,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:35,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:35,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:35,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:49:35,379 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:49:35,388 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/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-13 00:49:35,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:35,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:35,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:35,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:35,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:35,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:35,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:35,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:35,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:35,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:35,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:35,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:35,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:35,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:35,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:35,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:35,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:35,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:35,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:35,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:35,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:35,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:35,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:49:35,473 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:49:35,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:35 WrapperNode [2022-12-13 00:49:35,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:49:35,475 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:49:35,475 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:49:35,475 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:49:35,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:35" (1/1) ... [2022-12-13 00:49:35,508 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:35" (1/1) ... [2022-12-13 00:49:35,533 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2022-12-13 00:49:35,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:49:35,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:49:35,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:49:35,535 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:49:35,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:35" (1/1) ... [2022-12-13 00:49:35,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:35" (1/1) ... [2022-12-13 00:49:35,555 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:35" (1/1) ... [2022-12-13 00:49:35,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:35" (1/1) ... [2022-12-13 00:49:35,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:35" (1/1) ... [2022-12-13 00:49:35,561 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:35" (1/1) ... [2022-12-13 00:49:35,562 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:35" (1/1) ... [2022-12-13 00:49:35,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:35" (1/1) ... [2022-12-13 00:49:35,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:49:35,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:49:35,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:49:35,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:49:35,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:35" (1/1) ... [2022-12-13 00:49:35,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:49:35,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:49:35,600 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-13 00:49:35,623 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-13 00:49:35,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:49:35,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:49:35,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:49:35,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:49:35,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:49:35,633 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:49:35,633 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:49:35,633 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:49:35,633 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:49:35,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:49:35,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:49:35,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:49:35,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:49:35,635 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:49:35,812 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:49:35,814 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:49:36,061 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:49:36,165 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:49:36,165 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:49:36,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:49:36 BoogieIcfgContainer [2022-12-13 00:49:36,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:49:36,169 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:49:36,169 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:49:36,171 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:49:36,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:49:35" (1/3) ... [2022-12-13 00:49:36,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492eb3ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:49:36, skipping insertion in model container [2022-12-13 00:49:36,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:35" (2/3) ... [2022-12-13 00:49:36,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492eb3ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:49:36, skipping insertion in model container [2022-12-13 00:49:36,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:49:36" (3/3) ... [2022-12-13 00:49:36,173 INFO L112 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 00:49:36,187 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:49:36,187 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:49:36,188 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:49:36,240 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:49:36,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 87 transitions, 184 flow [2022-12-13 00:49:36,315 INFO L130 PetriNetUnfolder]: 2/85 cut-off events. [2022-12-13 00:49:36,315 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:49:36,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 2/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-13 00:49:36,319 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 87 transitions, 184 flow [2022-12-13 00:49:36,323 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 85 transitions, 176 flow [2022-12-13 00:49:36,325 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:49:36,346 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 85 transitions, 176 flow [2022-12-13 00:49:36,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions, 176 flow [2022-12-13 00:49:36,377 INFO L130 PetriNetUnfolder]: 2/85 cut-off events. [2022-12-13 00:49:36,377 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:49:36,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 2/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-13 00:49:36,380 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 85 transitions, 176 flow [2022-12-13 00:49:36,380 INFO L226 LiptonReduction]: Number of co-enabled transitions 1034 [2022-12-13 00:49:42,196 INFO L241 LiptonReduction]: Total number of compositions: 71 [2022-12-13 00:49:42,207 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:49:42,211 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;@74fb4253, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:49:42,212 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 00:49:42,213 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 00:49:42,213 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:49:42,214 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:49:42,214 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 00:49:42,214 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-13 00:49:42,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:49:42,218 INFO L85 PathProgramCache]: Analyzing trace with hash 406253, now seen corresponding path program 1 times [2022-12-13 00:49:42,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:49:42,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268706798] [2022-12-13 00:49:42,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:49:42,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:49:42,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:49:42,463 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-13 00:49:42,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:49:42,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268706798] [2022-12-13 00:49:42,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268706798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:49:42,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:49:42,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:49:42,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159596692] [2022-12-13 00:49:42,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:49:42,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:49:42,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:49:42,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:49:42,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:49:42,484 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2022-12-13 00:49:42,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-13 00:49:42,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:49:42,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2022-12-13 00:49:42,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:49:42,789 INFO L130 PetriNetUnfolder]: 960/1849 cut-off events. [2022-12-13 00:49:42,789 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 00:49:42,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3456 conditions, 1849 events. 960/1849 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 13014 event pairs, 92 based on Foata normal form. 0/1075 useless extension candidates. Maximal degree in co-relation 3446. Up to 1373 conditions per place. [2022-12-13 00:49:42,795 INFO L137 encePairwiseOnDemand]: 45/50 looper letters, 22 selfloop transitions, 2 changer transitions 49/80 dead transitions. [2022-12-13 00:49:42,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 80 transitions, 313 flow [2022-12-13 00:49:42,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:49:42,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:49:42,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-12-13 00:49:42,803 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6733333333333333 [2022-12-13 00:49:42,804 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 106 flow. Second operand 3 states and 101 transitions. [2022-12-13 00:49:42,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 80 transitions, 313 flow [2022-12-13 00:49:42,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 80 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:49:42,807 INFO L231 Difference]: Finished difference. Result has 54 places, 22 transitions, 52 flow [2022-12-13 00:49:42,833 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=54, PETRI_TRANSITIONS=22} [2022-12-13 00:49:42,835 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, -2 predicate places. [2022-12-13 00:49:42,836 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:49:42,836 INFO L89 Accepts]: Start accepts. Operand has 54 places, 22 transitions, 52 flow [2022-12-13 00:49:42,838 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:49:42,838 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:49:42,838 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 22 transitions, 52 flow [2022-12-13 00:49:42,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 22 transitions, 52 flow [2022-12-13 00:49:42,841 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2022-12-13 00:49:42,841 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:49:42,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 42 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-13 00:49:42,845 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 22 transitions, 52 flow [2022-12-13 00:49:42,845 INFO L226 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-13 00:49:42,936 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:49:42,938 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 00:49:42,938 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 22 transitions, 52 flow [2022-12-13 00:49:42,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-13 00:49:42,939 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:49:42,939 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:49:42,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:49:42,942 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-13 00:49:42,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:49:42,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1571550662, now seen corresponding path program 1 times [2022-12-13 00:49:42,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:49:42,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735073692] [2022-12-13 00:49:42,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:49:42,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:49:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:49:43,545 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-13 00:49:43,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:49:43,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735073692] [2022-12-13 00:49:43,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735073692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:49:43,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:49:43,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:49:43,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517315192] [2022-12-13 00:49:43,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:49:43,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:49:43,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:49:43,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:49:43,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:49:43,547 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2022-12-13 00:49:43,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-13 00:49:43,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:49:43,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2022-12-13 00:49:43,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:49:43,626 INFO L130 PetriNetUnfolder]: 166/316 cut-off events. [2022-12-13 00:49:43,626 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-13 00:49:43,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 316 events. 166/316 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1306 event pairs, 36 based on Foata normal form. 5/275 useless extension candidates. Maximal degree in co-relation 639. Up to 251 conditions per place. [2022-12-13 00:49:43,629 INFO L137 encePairwiseOnDemand]: 19/22 looper letters, 20 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2022-12-13 00:49:43,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 110 flow [2022-12-13 00:49:43,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:49:43,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:49:43,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-13 00:49:43,631 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2022-12-13 00:49:43,631 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 52 flow. Second operand 3 states and 41 transitions. [2022-12-13 00:49:43,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 110 flow [2022-12-13 00:49:43,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 28 transitions, 104 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:49:43,632 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 56 flow [2022-12-13 00:49:43,632 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2022-12-13 00:49:43,633 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, -26 predicate places. [2022-12-13 00:49:43,633 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:49:43,633 INFO L89 Accepts]: Start accepts. Operand has 30 places, 22 transitions, 56 flow [2022-12-13 00:49:43,634 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:49:43,634 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:49:43,634 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 22 transitions, 56 flow [2022-12-13 00:49:43,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 22 transitions, 56 flow [2022-12-13 00:49:43,638 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2022-12-13 00:49:43,638 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:49:43,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 45 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:49:43,639 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 22 transitions, 56 flow [2022-12-13 00:49:43,639 INFO L226 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-13 00:49:43,694 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:49:43,695 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-13 00:49:43,695 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 56 flow [2022-12-13 00:49:43,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-13 00:49:43,695 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:49:43,695 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:49:43,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:49:43,695 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-13 00:49:43,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:49:43,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1473428681, now seen corresponding path program 1 times [2022-12-13 00:49:43,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:49:43,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138240659] [2022-12-13 00:49:43,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:49:43,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:49:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:49:43,815 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-13 00:49:43,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:49:43,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138240659] [2022-12-13 00:49:43,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138240659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:49:43,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:49:43,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:49:43,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685492392] [2022-12-13 00:49:43,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:49:43,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:49:43,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:49:43,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:49:43,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:49:43,817 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2022-12-13 00:49:43,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-13 00:49:43,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:49:43,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2022-12-13 00:49:43,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:49:43,885 INFO L130 PetriNetUnfolder]: 208/425 cut-off events. [2022-12-13 00:49:43,886 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-12-13 00:49:43,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 425 events. 208/425 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2092 event pairs, 44 based on Foata normal form. 24/380 useless extension candidates. Maximal degree in co-relation 860. Up to 157 conditions per place. [2022-12-13 00:49:43,887 INFO L137 encePairwiseOnDemand]: 18/22 looper letters, 22 selfloop transitions, 3 changer transitions 8/38 dead transitions. [2022-12-13 00:49:43,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 157 flow [2022-12-13 00:49:43,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:49:43,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:49:43,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-13 00:49:43,888 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6590909090909091 [2022-12-13 00:49:43,888 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 56 flow. Second operand 4 states and 58 transitions. [2022-12-13 00:49:43,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 157 flow [2022-12-13 00:49:43,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 38 transitions, 151 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:49:43,889 INFO L231 Difference]: Finished difference. Result has 33 places, 21 transitions, 64 flow [2022-12-13 00:49:43,889 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=64, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2022-12-13 00:49:43,890 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, -23 predicate places. [2022-12-13 00:49:43,890 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:49:43,890 INFO L89 Accepts]: Start accepts. Operand has 33 places, 21 transitions, 64 flow [2022-12-13 00:49:43,890 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:49:43,890 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:49:43,891 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 21 transitions, 64 flow [2022-12-13 00:49:43,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 21 transitions, 64 flow [2022-12-13 00:49:43,893 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-13 00:49:43,893 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 00:49:43,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 21 events. 0/21 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 40 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:49:43,894 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 21 transitions, 64 flow [2022-12-13 00:49:43,894 INFO L226 LiptonReduction]: Number of co-enabled transitions 180 [2022-12-13 00:49:43,998 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:49:43,999 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 109 [2022-12-13 00:49:43,999 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 62 flow [2022-12-13 00:49:43,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-13 00:49:44,000 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:49:44,000 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:49:44,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:49:44,000 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-13 00:49:44,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:49:44,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1151812407, now seen corresponding path program 1 times [2022-12-13 00:49:44,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:49:44,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281428925] [2022-12-13 00:49:44,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:49:44,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:49:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:49:44,515 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-13 00:49:44,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:49:44,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281428925] [2022-12-13 00:49:44,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281428925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:49:44,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:49:44,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:49:44,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436004153] [2022-12-13 00:49:44,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:49:44,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:49:44,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:49:44,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:49:44,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:49:44,517 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2022-12-13 00:49:44,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-13 00:49:44,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:49:44,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2022-12-13 00:49:44,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:49:44,594 INFO L130 PetriNetUnfolder]: 134/264 cut-off events. [2022-12-13 00:49:44,594 INFO L131 PetriNetUnfolder]: For 141/141 co-relation queries the response was YES. [2022-12-13 00:49:44,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 264 events. 134/264 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1007 event pairs, 50 based on Foata normal form. 1/224 useless extension candidates. Maximal degree in co-relation 621. Up to 225 conditions per place. [2022-12-13 00:49:44,596 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 23 selfloop transitions, 5 changer transitions 0/32 dead transitions. [2022-12-13 00:49:44,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 154 flow [2022-12-13 00:49:44,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:49:44,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:49:44,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-13 00:49:44,598 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-13 00:49:44,598 INFO L175 Difference]: Start difference. First operand has 31 places, 20 transitions, 62 flow. Second operand 4 states and 45 transitions. [2022-12-13 00:49:44,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 154 flow [2022-12-13 00:49:44,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 32 transitions, 137 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 00:49:44,602 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 85 flow [2022-12-13 00:49:44,602 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=85, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2022-12-13 00:49:44,603 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, -24 predicate places. [2022-12-13 00:49:44,603 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:49:44,603 INFO L89 Accepts]: Start accepts. Operand has 32 places, 24 transitions, 85 flow [2022-12-13 00:49:44,604 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:49:44,604 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:49:44,604 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 24 transitions, 85 flow [2022-12-13 00:49:44,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 24 transitions, 85 flow [2022-12-13 00:49:44,612 INFO L130 PetriNetUnfolder]: 9/57 cut-off events. [2022-12-13 00:49:44,613 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-13 00:49:44,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 57 events. 9/57 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 188 event pairs, 2 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 95. Up to 20 conditions per place. [2022-12-13 00:49:44,613 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 24 transitions, 85 flow [2022-12-13 00:49:44,614 INFO L226 LiptonReduction]: Number of co-enabled transitions 180 [2022-12-13 00:49:44,768 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:49:44,769 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-13 00:49:44,770 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 90 flow [2022-12-13 00:49:44,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-13 00:49:44,770 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:49:44,770 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:49:44,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:49:44,770 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-13 00:49:44,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:49:44,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1568265279, now seen corresponding path program 2 times [2022-12-13 00:49:44,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:49:44,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712042929] [2022-12-13 00:49:44,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:49:44,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:49:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:49:45,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-13 00:49:45,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:49:45,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712042929] [2022-12-13 00:49:45,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712042929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:49:45,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:49:45,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:49:45,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62605059] [2022-12-13 00:49:45,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:49:45,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:49:45,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:49:45,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:49:45,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:49:45,044 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 22 [2022-12-13 00:49:45,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-13 00:49:45,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:49:45,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 22 [2022-12-13 00:49:45,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:49:45,132 INFO L130 PetriNetUnfolder]: 128/250 cut-off events. [2022-12-13 00:49:45,132 INFO L131 PetriNetUnfolder]: For 101/101 co-relation queries the response was YES. [2022-12-13 00:49:45,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 250 events. 128/250 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 969 event pairs, 65 based on Foata normal form. 1/206 useless extension candidates. Maximal degree in co-relation 638. Up to 215 conditions per place. [2022-12-13 00:49:45,134 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 23 selfloop transitions, 7 changer transitions 0/34 dead transitions. [2022-12-13 00:49:45,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 34 transitions, 182 flow [2022-12-13 00:49:45,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:49:45,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:49:45,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-13 00:49:45,136 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2022-12-13 00:49:45,136 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 90 flow. Second operand 4 states and 46 transitions. [2022-12-13 00:49:45,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 34 transitions, 182 flow [2022-12-13 00:49:45,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 34 transitions, 176 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 00:49:45,139 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 117 flow [2022-12-13 00:49:45,139 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2022-12-13 00:49:45,140 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, -21 predicate places. [2022-12-13 00:49:45,140 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:49:45,141 INFO L89 Accepts]: Start accepts. Operand has 35 places, 26 transitions, 117 flow [2022-12-13 00:49:45,142 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:49:45,142 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:49:45,142 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 26 transitions, 117 flow [2022-12-13 00:49:45,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 26 transitions, 117 flow [2022-12-13 00:49:45,148 INFO L130 PetriNetUnfolder]: 6/49 cut-off events. [2022-12-13 00:49:45,148 INFO L131 PetriNetUnfolder]: For 24/26 co-relation queries the response was YES. [2022-12-13 00:49:45,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 49 events. 6/49 cut-off events. For 24/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 156 event pairs, 1 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 100. Up to 14 conditions per place. [2022-12-13 00:49:45,149 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 26 transitions, 117 flow [2022-12-13 00:49:45,149 INFO L226 LiptonReduction]: Number of co-enabled transitions 176 [2022-12-13 00:49:45,184 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:49:45,185 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-13 00:49:45,185 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 119 flow [2022-12-13 00:49:45,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-13 00:49:45,190 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:49:45,191 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:49:45,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:49:45,191 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-13 00:49:45,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:49:45,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1566503797, now seen corresponding path program 1 times [2022-12-13 00:49:45,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:49:45,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20493266] [2022-12-13 00:49:45,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:49:45,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:49:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:49:45,467 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-13 00:49:45,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:49:45,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20493266] [2022-12-13 00:49:45,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20493266] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:49:45,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:49:45,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:49:45,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724610785] [2022-12-13 00:49:45,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:49:45,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:49:45,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:49:45,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:49:45,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:49:45,468 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2022-12-13 00:49:45,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 119 flow. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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-13 00:49:45,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:49:45,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2022-12-13 00:49:45,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:49:45,553 INFO L130 PetriNetUnfolder]: 143/282 cut-off events. [2022-12-13 00:49:45,553 INFO L131 PetriNetUnfolder]: For 230/230 co-relation queries the response was YES. [2022-12-13 00:49:45,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 282 events. 143/282 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1119 event pairs, 65 based on Foata normal form. 4/241 useless extension candidates. Maximal degree in co-relation 760. Up to 229 conditions per place. [2022-12-13 00:49:45,555 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 21 selfloop transitions, 10 changer transitions 0/35 dead transitions. [2022-12-13 00:49:45,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 35 transitions, 207 flow [2022-12-13 00:49:45,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:49:45,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:49:45,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-12-13 00:49:45,556 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43478260869565216 [2022-12-13 00:49:45,556 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 119 flow. Second operand 5 states and 50 transitions. [2022-12-13 00:49:45,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 35 transitions, 207 flow [2022-12-13 00:49:45,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 35 transitions, 190 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 00:49:45,558 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 148 flow [2022-12-13 00:49:45,558 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=148, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2022-12-13 00:49:45,558 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, -18 predicate places. [2022-12-13 00:49:45,558 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:49:45,558 INFO L89 Accepts]: Start accepts. Operand has 38 places, 29 transitions, 148 flow [2022-12-13 00:49:45,559 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:49:45,559 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:49:45,559 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 29 transitions, 148 flow [2022-12-13 00:49:45,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 29 transitions, 148 flow [2022-12-13 00:49:45,565 INFO L130 PetriNetUnfolder]: 17/68 cut-off events. [2022-12-13 00:49:45,565 INFO L131 PetriNetUnfolder]: For 69/75 co-relation queries the response was YES. [2022-12-13 00:49:45,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 68 events. 17/68 cut-off events. For 69/75 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 246 event pairs, 2 based on Foata normal form. 1/54 useless extension candidates. Maximal degree in co-relation 166. Up to 30 conditions per place. [2022-12-13 00:49:45,566 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 29 transitions, 148 flow [2022-12-13 00:49:45,566 INFO L226 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-13 00:49:45,566 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:49:45,567 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 00:49:45,567 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 148 flow [2022-12-13 00:49:45,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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-13 00:49:45,567 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:49:45,567 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:49:45,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:49:45,567 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-13 00:49:45,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:49:45,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1566474967, now seen corresponding path program 1 times [2022-12-13 00:49:45,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:49:45,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990703547] [2022-12-13 00:49:45,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:49:45,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:49:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:49:45,672 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-13 00:49:45,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:49:45,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990703547] [2022-12-13 00:49:45,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990703547] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:49:45,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:49:45,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:49:45,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775833842] [2022-12-13 00:49:45,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:49:45,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:49:45,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:49:45,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:49:45,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:49:45,676 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2022-12-13 00:49:45,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-13 00:49:45,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:49:45,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2022-12-13 00:49:45,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:49:45,760 INFO L130 PetriNetUnfolder]: 154/330 cut-off events. [2022-12-13 00:49:45,760 INFO L131 PetriNetUnfolder]: For 372/382 co-relation queries the response was YES. [2022-12-13 00:49:45,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 971 conditions, 330 events. 154/330 cut-off events. For 372/382 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1552 event pairs, 31 based on Foata normal form. 48/288 useless extension candidates. Maximal degree in co-relation 955. Up to 229 conditions per place. [2022-12-13 00:49:45,762 INFO L137 encePairwiseOnDemand]: 14/23 looper letters, 27 selfloop transitions, 7 changer transitions 25/62 dead transitions. [2022-12-13 00:49:45,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 62 transitions, 373 flow [2022-12-13 00:49:45,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:49:45,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:49:45,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-12-13 00:49:45,765 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-13 00:49:45,765 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 148 flow. Second operand 5 states and 69 transitions. [2022-12-13 00:49:45,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 62 transitions, 373 flow [2022-12-13 00:49:45,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 62 transitions, 334 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-12-13 00:49:45,768 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 163 flow [2022-12-13 00:49:45,768 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=163, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2022-12-13 00:49:45,769 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, -17 predicate places. [2022-12-13 00:49:45,769 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:49:45,769 INFO L89 Accepts]: Start accepts. Operand has 39 places, 31 transitions, 163 flow [2022-12-13 00:49:45,769 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:49:45,770 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:49:45,770 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 163 flow [2022-12-13 00:49:45,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 163 flow [2022-12-13 00:49:45,787 INFO L130 PetriNetUnfolder]: 68/179 cut-off events. [2022-12-13 00:49:45,787 INFO L131 PetriNetUnfolder]: For 207/208 co-relation queries the response was YES. [2022-12-13 00:49:45,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 577 conditions, 179 events. 68/179 cut-off events. For 207/208 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 861 event pairs, 24 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 563. Up to 88 conditions per place. [2022-12-13 00:49:45,788 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 31 transitions, 163 flow [2022-12-13 00:49:45,789 INFO L226 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-13 00:49:45,797 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [396] $Ultimate##0-->L748: Formula: (and (= v_~y$r_buff0_thd2~0_102 v_~y$r_buff1_thd2~0_102) (= v_~y$w_buff0_used~0_459 v_~y$w_buff1_used~0_422) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_30| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_458 256) 0)) (not (= (mod v_~y$w_buff1_used~0_422 256) 0)))) 1 0)) (= v_~y$w_buff0_used~0_458 1) (= 2 v_~y$w_buff0~0_314) (= v_~x~0_42 1) (= |v_P0Thread1of1ForFork1_~arg#1.offset_28| |v_P0Thread1of1ForFork1_#in~arg#1.offset_28|) (= v_~y$w_buff1~0_279 v_~y$w_buff0~0_315) (= v_~y$r_buff0_thd1~0_141 v_~y$r_buff1_thd1~0_112) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_30| 0)) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_30| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_30|) (= v_~y$r_buff0_thd0~0_300 v_~y$r_buff1_thd0~0_311) (= |v_P0Thread1of1ForFork1_~arg#1.base_28| |v_P0Thread1of1ForFork1_#in~arg#1.base_28|) (= v_~y$r_buff0_thd1~0_140 1)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_459, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_28|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_300, ~y$w_buff0~0=v_~y$w_buff0~0_315, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_141, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_102, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_28|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_458, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_28|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_28|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_28|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_28|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_102, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_112, ~y$w_buff1~0=v_~y$w_buff1~0_279, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_30|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_300, ~y$w_buff0~0=v_~y$w_buff0~0_314, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_140, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_102, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_30|, ~x~0=v_~x~0_42, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_311, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_422} AuxVars[] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff1~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd1~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [397] $Ultimate##0-->L768: Formula: (and (= v_~y~0_389 1) (= |v_P1Thread1of1ForFork0_#in~arg.offset_27| v_P1Thread1of1ForFork0_~arg.offset_27) (= v_~x~0_44 v_~__unbuffered_p1_EAX~0_111) (= v_P1Thread1of1ForFork0_~arg.base_27 |v_P1Thread1of1ForFork0_#in~arg.base_27|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_27|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_27|, ~x~0=v_~x~0_44} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_111, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_27, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_27|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_27|, ~y~0=v_~y~0_389, ~x~0=v_~x~0_44} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~y~0] [2022-12-13 00:49:46,002 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [400] $Ultimate##0-->L768: Formula: (and (= v_~y$r_buff0_thd0~0_319 v_~y$r_buff1_thd0~0_329) (= |v_P0Thread1of1ForFork1_~arg#1.offset_32| |v_P0Thread1of1ForFork1_#in~arg#1.offset_32|) (= v_~y~0_418 1) (= v_~y$r_buff0_thd2~0_114 v_~y$r_buff1_thd2~0_114) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_34| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_34|) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_500 256) 0)) (not (= (mod v_~y$w_buff1_used~0_461 256) 0)))) 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_34|) (= |v_P0Thread1of1ForFork1_~arg#1.base_32| |v_P0Thread1of1ForFork1_#in~arg#1.base_32|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_31| v_P1Thread1of1ForFork0_~arg.offset_31) (= v_~x~0_50 v_~__unbuffered_p1_EAX~0_115) (= v_P1Thread1of1ForFork0_~arg.base_31 |v_P1Thread1of1ForFork0_#in~arg.base_31|) (= 2 v_~y$w_buff0~0_334) (= v_~y$r_buff0_thd1~0_173 v_~y$r_buff1_thd1~0_140) (= v_~x~0_50 1) (= v_~y$w_buff0_used~0_500 1) (= v_~y$w_buff0_used~0_501 v_~y$w_buff1_used~0_461) (= v_~y$w_buff1~0_295 v_~y$w_buff0~0_335) (= v_~y$r_buff0_thd1~0_172 1) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_34| 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_501, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_32|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_31|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_319, ~y$w_buff0~0=v_~y$w_buff0~0_335, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_173, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_114, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_31|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_32|} OutVars{P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_31, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_500, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_32|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_32|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_32|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_32|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_114, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_140, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_31, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_115, ~y$w_buff1~0=v_~y$w_buff1~0_295, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_31|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_34|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_319, ~y$w_buff0~0=v_~y$w_buff0~0_334, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_172, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_114, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_31|, ~y~0=v_~y~0_418, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_34|, ~x~0=v_~x~0_50, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_329, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_461} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.base, ~y$w_buff0_used~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [277] L748-->L755: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd1~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_31 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse2))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd1~0_30 (ite .cse0 0 v_~y$r_buff0_thd1~0_31)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse2) (and .cse3 (not (= 0 (mod v_~y$r_buff0_thd1~0_30 256))))) 0 v_~y$r_buff1_thd1~0_24) v_~y$r_buff1_thd1~0_23) (= v_~y$w_buff0_used~0_105 (ite .cse4 0 v_~y$w_buff0_used~0_106)) (= v_~y~0_61 (ite .cse4 v_~y$w_buff0~0_48 (ite .cse1 v_~y$w_buff1~0_39 v_~y~0_62)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_48, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_31, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_48, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_30, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 00:49:46,160 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:49:46,161 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 392 [2022-12-13 00:49:46,161 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 167 flow [2022-12-13 00:49:46,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-13 00:49:46,161 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:49:46,161 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:49:46,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:49:46,161 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:49:46,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:49:46,162 INFO L85 PathProgramCache]: Analyzing trace with hash 2083044639, now seen corresponding path program 1 times [2022-12-13 00:49:46,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:49:46,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787783074] [2022-12-13 00:49:46,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:49:46,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:49:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:49:46,285 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-13 00:49:46,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:49:46,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787783074] [2022-12-13 00:49:46,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787783074] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:49:46,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:49:46,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:49:46,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263828814] [2022-12-13 00:49:46,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:49:46,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:49:46,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:49:46,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:49:46,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:49:46,287 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2022-12-13 00:49:46,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-13 00:49:46,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:49:46,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2022-12-13 00:49:46,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:49:46,360 INFO L130 PetriNetUnfolder]: 52/156 cut-off events. [2022-12-13 00:49:46,360 INFO L131 PetriNetUnfolder]: For 309/321 co-relation queries the response was YES. [2022-12-13 00:49:46,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 594 conditions, 156 events. 52/156 cut-off events. For 309/321 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 712 event pairs, 2 based on Foata normal form. 32/145 useless extension candidates. Maximal degree in co-relation 577. Up to 88 conditions per place. [2022-12-13 00:49:46,361 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 19 selfloop transitions, 13 changer transitions 11/46 dead transitions. [2022-12-13 00:49:46,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 46 transitions, 325 flow [2022-12-13 00:49:46,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:49:46,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:49:46,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-12-13 00:49:46,362 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4420289855072464 [2022-12-13 00:49:46,362 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 167 flow. Second operand 6 states and 61 transitions. [2022-12-13 00:49:46,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 46 transitions, 325 flow [2022-12-13 00:49:46,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 46 transitions, 260 flow, removed 24 selfloop flow, removed 5 redundant places. [2022-12-13 00:49:46,364 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 154 flow [2022-12-13 00:49:46,364 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=154, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2022-12-13 00:49:46,364 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, -17 predicate places. [2022-12-13 00:49:46,365 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:49:46,365 INFO L89 Accepts]: Start accepts. Operand has 39 places, 29 transitions, 154 flow [2022-12-13 00:49:46,365 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:49:46,365 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:49:46,365 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 154 flow [2022-12-13 00:49:46,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 29 transitions, 154 flow [2022-12-13 00:49:46,373 INFO L130 PetriNetUnfolder]: 11/72 cut-off events. [2022-12-13 00:49:46,373 INFO L131 PetriNetUnfolder]: For 70/79 co-relation queries the response was YES. [2022-12-13 00:49:46,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 72 events. 11/72 cut-off events. For 70/79 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 282 event pairs, 0 based on Foata normal form. 1/51 useless extension candidates. Maximal degree in co-relation 213. Up to 40 conditions per place. [2022-12-13 00:49:46,374 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 29 transitions, 154 flow [2022-12-13 00:49:46,374 INFO L226 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-13 00:49:47,578 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [404] $Ultimate##0-->L775: Formula: (let ((.cse2 (= (mod v_~y$w_buff0_used~0_520 256) 0)) (.cse1 (not (= (mod v_~y$r_buff0_thd2~0_123 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_518 256) 0)))) (let ((.cse0 (and .cse1 .cse4)) (.cse3 (and .cse1 (not .cse2)))) (and (= v_~x~0_54 1) (= |v_P1Thread1of1ForFork0_#in~arg.offset_35| v_P1Thread1of1ForFork0_~arg.offset_35) (= v_P1Thread1of1ForFork0_~arg.base_35 |v_P1Thread1of1ForFork0_#in~arg.base_35|) (= v_~y$r_buff0_thd2~0_122 (ite .cse0 0 v_~y$r_buff0_thd2~0_123)) (= v_~y$w_buff0_used~0_518 (ite .cse1 0 1)) (= v_~y$r_buff0_thd1~0_183 v_~y$r_buff1_thd1~0_146) (= v_~y$r_buff0_thd1~0_182 1) (= (ite .cse2 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_38|) (= v_~x~0_54 v_~__unbuffered_p1_EAX~0_119) (= v_~y$r_buff0_thd0~0_327 v_~y$r_buff1_thd0~0_337) (= v_~y~0_432 (ite .cse1 v_~y$w_buff0~0_346 (ite .cse3 v_~y$w_buff1~0_303 1))) (= |v_P0Thread1of1ForFork1_~arg#1.base_36| |v_P0Thread1of1ForFork1_#in~arg#1.base_36|) (= 2 v_~y$w_buff0~0_346) (= |v_P0Thread1of1ForFork1_~arg#1.offset_36| |v_P0Thread1of1ForFork1_#in~arg#1.offset_36|) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_38| 0)) (= v_~y$w_buff1~0_303 v_~y$w_buff0~0_347) (= v_~y$w_buff1_used~0_475 (ite (or .cse0 .cse3) 0 v_~y$w_buff0_used~0_520)) (= (ite (or (and .cse4 (not (= (mod v_~y$r_buff0_thd2~0_122 256) 0))) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_475 256) 0)))) 0 v_~y$r_buff0_thd2~0_123) v_~y$r_buff1_thd2~0_122) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_38| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_38|)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_520, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_36|, ~y$w_buff0~0=v_~y$w_buff0~0_347, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_35|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_327, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_123, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_183, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_35|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_36|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_518, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_35, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_36|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_36|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_36|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_36|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_122, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_146, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_35, ~y$w_buff1~0=v_~y$w_buff1~0_303, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_119, ~y$w_buff0~0=v_~y$w_buff0~0_346, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_35|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_38|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_327, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_122, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_182, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_35|, ~y~0=v_~y~0_432, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_38|, ~x~0=v_~x~0_54, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_337, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_475} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, P1Thread1of1ForFork0_~arg.offset, ~y$w_buff1~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd2~0, ~y$r_buff0_thd1~0, ~y~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [277] L748-->L755: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd1~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_31 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse2))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd1~0_30 (ite .cse0 0 v_~y$r_buff0_thd1~0_31)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse2) (and .cse3 (not (= 0 (mod v_~y$r_buff0_thd1~0_30 256))))) 0 v_~y$r_buff1_thd1~0_24) v_~y$r_buff1_thd1~0_23) (= v_~y$w_buff0_used~0_105 (ite .cse4 0 v_~y$w_buff0_used~0_106)) (= v_~y~0_61 (ite .cse4 v_~y$w_buff0~0_48 (ite .cse1 v_~y$w_buff1~0_39 v_~y~0_62)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_48, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_31, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_48, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_30, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 00:49:47,869 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [402] $Ultimate##0-->L755: Formula: (let ((.cse2 (= (mod v_~y$w_buff0_used~0_510 256) 0)) (.cse1 (not (= (mod v_~y$r_buff0_thd1~0_178 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_508 256) 0)))) (and (= v_~y~0_424 v_~y$w_buff0~0_340) (= (ite (or (and .cse0 (not (= (mod v_~y$r_buff0_thd1~0_176 256) 0))) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_467 256) 0)))) 0 v_~y$r_buff0_thd1~0_178) v_~y$r_buff1_thd1~0_142) (= v_P1Thread1of1ForFork0_~arg.base_33 |v_P1Thread1of1ForFork0_#in~arg.base_33|) (= (ite .cse2 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_36|) (= v_~y$w_buff0_used~0_508 0) (= v_~y$w_buff1~0_299 v_~y$w_buff0~0_341) (= |v_P1Thread1of1ForFork0_#in~arg.offset_33| v_P1Thread1of1ForFork0_~arg.offset_33) (= v_~y$r_buff0_thd0~0_325 v_~y$r_buff1_thd0~0_335) (= (ite (or .cse0 (and (not .cse2) .cse1)) 0 v_~y$w_buff0_used~0_510) v_~y$w_buff1_used~0_467) (= v_~y$r_buff0_thd1~0_176 (ite .cse0 0 1)) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_36| 0)) (= v_~y$r_buff0_thd2~0_116 v_~y$r_buff1_thd2~0_116) (= |v_P0Thread1of1ForFork1_~arg#1.offset_34| |v_P0Thread1of1ForFork1_#in~arg#1.offset_34|) (= |v_P0Thread1of1ForFork1_~arg#1.base_34| |v_P0Thread1of1ForFork1_#in~arg#1.base_34|) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_36| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_36|) (= v_~x~0_52 1) (= v_~x~0_52 v_~__unbuffered_p1_EAX~0_117) (= 2 v_~y$w_buff0~0_340))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_510, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_34|, ~y$w_buff0~0=v_~y$w_buff0~0_341, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_33|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_325, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_178, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_116, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_33|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_34|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_508, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_33, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_34|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_34|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_34|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_34|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_116, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_142, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_33, ~y$w_buff1~0=v_~y$w_buff1~0_299, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_117, ~y$w_buff0~0=v_~y$w_buff0~0_340, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_33|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_36|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_325, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_176, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_116, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_33|, ~y~0=v_~y~0_424, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_36|, ~x~0=v_~x~0_52, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_335, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_467} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, P1Thread1of1ForFork0_~arg.offset, ~y$w_buff1~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd1~0, ~y~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [284] L768-->L775: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_26 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_109 256) 0)))) (let ((.cse2 (and .cse5 .cse3)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_99 256) 0)) .cse4)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_110 256) 0))))) (and (= v_~y~0_65 (ite .cse0 v_~y$w_buff0~0_50 (ite .cse1 v_~y$w_buff1~0_41 v_~y~0_66))) (= v_~y$r_buff0_thd2~0_25 (ite .cse2 0 v_~y$r_buff0_thd2~0_26)) (= v_~y$w_buff1_used~0_98 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_99)) (= (ite .cse0 0 v_~y$w_buff0_used~0_110) v_~y$w_buff0_used~0_109) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_25 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_98 256) 0)) .cse4)) 0 v_~y$r_buff1_thd2~0_24) v_~y$r_buff1_thd2~0_23)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_110, ~y$w_buff1~0=v_~y$w_buff1~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_26, ~y~0=v_~y~0_66, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_99} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_109, ~y$w_buff1~0=v_~y$w_buff1~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_25, ~y~0=v_~y~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_98} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 00:49:48,047 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 00:49:48,047 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1682 [2022-12-13 00:49:48,048 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 138 flow [2022-12-13 00:49:48,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-13 00:49:48,048 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:49:48,048 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:49:48,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:49:48,048 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:49:48,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:49:48,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1474713918, now seen corresponding path program 1 times [2022-12-13 00:49:48,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:49:48,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754632694] [2022-12-13 00:49:48,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:49:48,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:49:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:49:48,067 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:49:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:49:48,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:49:48,095 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:49:48,096 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 00:49:48,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-13 00:49:48,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 00:49:48,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 00:49:48,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-13 00:49:48,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:49:48,097 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:49:48,101 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:49:48,101 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:49:48,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:49:48 BasicIcfg [2022-12-13 00:49:48,128 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:49:48,129 INFO L158 Benchmark]: Toolchain (without parser) took 13094.59ms. Allocated memory was 198.2MB in the beginning and 417.3MB in the end (delta: 219.2MB). Free memory was 172.4MB in the beginning and 313.9MB in the end (delta: -141.5MB). Peak memory consumption was 78.3MB. Max. memory is 8.0GB. [2022-12-13 00:49:48,129 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 198.2MB. Free memory was 176.0MB in the beginning and 175.9MB in the end (delta: 70.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:49:48,129 INFO L158 Benchmark]: CACSL2BoogieTranslator took 438.73ms. Allocated memory is still 198.2MB. Free memory was 172.4MB in the beginning and 147.4MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-13 00:49:48,129 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.28ms. Allocated memory is still 198.2MB. Free memory was 147.4MB in the beginning and 144.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:49:48,130 INFO L158 Benchmark]: Boogie Preprocessor took 30.91ms. Allocated memory is still 198.2MB. Free memory was 144.8MB in the beginning and 143.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:49:48,130 INFO L158 Benchmark]: RCFGBuilder took 601.07ms. Allocated memory was 198.2MB in the beginning and 278.9MB in the end (delta: 80.7MB). Free memory was 143.2MB in the beginning and 250.2MB in the end (delta: -107.0MB). Peak memory consumption was 33.0MB. Max. memory is 8.0GB. [2022-12-13 00:49:48,130 INFO L158 Benchmark]: TraceAbstraction took 11959.69ms. Allocated memory was 278.9MB in the beginning and 417.3MB in the end (delta: 138.4MB). Free memory was 249.1MB in the beginning and 313.9MB in the end (delta: -64.8MB). Peak memory consumption was 73.6MB. Max. memory is 8.0GB. [2022-12-13 00:49:48,131 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 198.2MB. Free memory was 176.0MB in the beginning and 175.9MB in the end (delta: 70.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 438.73ms. Allocated memory is still 198.2MB. Free memory was 172.4MB in the beginning and 147.4MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.28ms. Allocated memory is still 198.2MB. Free memory was 147.4MB in the beginning and 144.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.91ms. Allocated memory is still 198.2MB. Free memory was 144.8MB in the beginning and 143.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 601.07ms. Allocated memory was 198.2MB in the beginning and 278.9MB in the end (delta: 80.7MB). Free memory was 143.2MB in the beginning and 250.2MB in the end (delta: -107.0MB). Peak memory consumption was 33.0MB. Max. memory is 8.0GB. * TraceAbstraction took 11959.69ms. Allocated memory was 278.9MB in the beginning and 417.3MB in the end (delta: 138.4MB). Free memory was 249.1MB in the beginning and 313.9MB in the end (delta: -64.8MB). Peak memory consumption was 73.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 90 PlacesBefore, 56 PlacesAfterwards, 85 TransitionsBefore, 50 TransitionsAfterwards, 1034 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 34 TrivialYvCompositions, 32 ConcurrentYvCompositions, 4 ChoiceCompositions, 71 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1632, independent: 1545, independent conditional: 1545, independent unconditional: 0, dependent: 87, dependent conditional: 87, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1632, independent: 1545, independent conditional: 0, independent unconditional: 1545, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1632, independent: 1545, independent conditional: 0, independent unconditional: 1545, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1632, independent: 1545, independent conditional: 0, independent unconditional: 1545, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 971, independent: 935, independent conditional: 0, independent unconditional: 935, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 971, independent: 929, independent conditional: 0, independent unconditional: 929, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 213, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1632, independent: 610, independent conditional: 0, independent unconditional: 610, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 971, unknown conditional: 0, unknown unconditional: 971] , Statistics on independence cache: Total cache size (in pairs): 1616, Positive cache size: 1580, Positive conditional cache size: 0, Positive unconditional cache size: 1580, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 29 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 106, independent: 82, independent conditional: 82, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 106, independent: 82, independent conditional: 4, independent unconditional: 78, dependent: 24, dependent conditional: 4, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 106, independent: 82, independent conditional: 4, independent unconditional: 78, dependent: 24, dependent conditional: 4, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 106, independent: 82, independent conditional: 4, independent unconditional: 78, dependent: 24, dependent conditional: 4, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 96, independent: 78, independent conditional: 4, independent unconditional: 74, dependent: 18, dependent conditional: 3, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 96, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 36, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 18, dependent conditional: 3, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 88, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 71, dependent conditional: 15, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 106, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 96, unknown conditional: 7, unknown unconditional: 89] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 78, Positive conditional cache size: 4, Positive unconditional cache size: 74, Negative cache size: 18, Negative conditional cache size: 3, Negative unconditional cache size: 15, 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, 30 PlacesBefore, 30 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 101, independent: 79, independent conditional: 79, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 101, independent: 79, independent conditional: 9, independent unconditional: 70, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 101, independent: 79, independent conditional: 0, independent unconditional: 79, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 101, independent: 79, independent conditional: 0, independent unconditional: 79, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 32, independent: 24, independent conditional: 0, independent unconditional: 24, 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: 32, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 52, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 101, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 32, unknown conditional: 0, unknown unconditional: 32] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 102, Positive conditional cache size: 4, Positive unconditional cache size: 98, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 32 PlacesBefore, 31 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 152, independent: 113, independent conditional: 113, independent unconditional: 0, dependent: 39, dependent conditional: 39, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 152, independent: 113, independent conditional: 22, independent unconditional: 91, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 152, independent: 113, independent conditional: 0, independent unconditional: 113, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 152, independent: 113, independent conditional: 0, independent unconditional: 113, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 152, independent: 111, independent conditional: 0, independent unconditional: 111, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 111, Positive conditional cache size: 4, Positive unconditional cache size: 107, Negative cache size: 28, Negative conditional cache size: 3, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 32 PlacesBefore, 32 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 85, independent: 67, independent conditional: 67, 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: 85, independent: 67, independent conditional: 21, independent unconditional: 46, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 85, independent: 67, independent conditional: 14, independent unconditional: 53, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 85, independent: 67, independent conditional: 14, independent unconditional: 53, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 85, independent: 63, independent conditional: 13, independent unconditional: 50, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 4, unknown conditional: 1, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 124, Positive conditional cache size: 5, Positive unconditional cache size: 119, Negative cache size: 28, Negative conditional cache size: 3, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 176 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 75, independent: 51, independent conditional: 51, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 75, independent: 51, independent conditional: 15, independent unconditional: 36, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 75, independent: 51, independent conditional: 9, independent unconditional: 42, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 75, independent: 51, independent conditional: 9, independent unconditional: 42, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 75, independent: 51, independent conditional: 9, independent unconditional: 42, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 126, Positive conditional cache size: 5, Positive unconditional cache size: 121, Negative cache size: 30, Negative conditional cache size: 3, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 126, Positive conditional cache size: 5, Positive unconditional cache size: 121, Negative cache size: 30, Negative conditional cache size: 3, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 37 PlacesBefore, 36 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 2, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, independent: 11, independent conditional: 1, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 1, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 1, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 165, Positive cache size: 135, Positive conditional cache size: 6, Positive unconditional cache size: 129, Negative cache size: 30, Negative conditional cache size: 3, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 37 PlacesBefore, 31 PlacesAfterwards, 29 TransitionsBefore, 23 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 17, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 20, independent conditional: 16, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 16, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 8, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20, independent: 10, independent conditional: 8, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 8, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 154, Positive conditional cache size: 14, Positive unconditional cache size: 140, Negative cache size: 30, Negative conditional cache size: 3, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L717] 0 _Bool y$flush_delayed; [L718] 0 int y$mem_tmp; [L719] 0 _Bool y$r_buff0_thd0; [L720] 0 _Bool y$r_buff0_thd1; [L721] 0 _Bool y$r_buff0_thd2; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$read_delayed; [L726] 0 int *y$read_delayed_var; [L727] 0 int y$w_buff0; [L728] 0 _Bool y$w_buff0_used; [L729] 0 int y$w_buff1; [L730] 0 _Bool y$w_buff1_used; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t2009; [L793] FCALL, FORK 0 pthread_create(&t2009, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2009, ((void *)0), P0, ((void *)0))=-2, t2009={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] 0 pthread_t t2010; [L795] FCALL, FORK 0 pthread_create(&t2010, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2010, ((void *)0), P1, ((void *)0))=-1, t2009={5:0}, t2010={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 2 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L740] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L740] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 [L747] 1 x = 1 [L764] 1 __unbuffered_p1_EAX = x [L767] 1 y = 1 [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L770] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L802] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L804] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 y$flush_delayed = weak$$choice2 [L811] 0 y$mem_tmp = y [L812] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L813] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L814] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L815] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L816] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L818] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L820] 0 y = y$flush_delayed ? y$mem_tmp : y [L821] 0 y$flush_delayed = (_Bool)0 [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - 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: 793]: 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: 795]: 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, 105 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: 11.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 144 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 144 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 498 IncrementalHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 6 mSDtfsCounter, 498 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=7, InterpolantAutomatonStates: 34, 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.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 56 ConstructedInterpolants, 0 QuantifiedInterpolants, 527 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-13 00:49:48,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...