/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/rfi000_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:07:21,301 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:07:21,302 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:07:21,332 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:07:21,332 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:07:21,335 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:07:21,339 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:07:21,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:07:21,343 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:07:21,344 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:07:21,345 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:07:21,346 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:07:21,346 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:07:21,347 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:07:21,348 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:07:21,349 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:07:21,349 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:07:21,350 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:07:21,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:07:21,361 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:07:21,364 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:07:21,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:07:21,370 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:07:21,372 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:07:21,379 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:07:21,379 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:07:21,380 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:07:21,380 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:07:21,381 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:07:21,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:07:21,382 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:07:21,382 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:07:21,383 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:07:21,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:07:21,384 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:07:21,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:07:21,385 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:07:21,385 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:07:21,385 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:07:21,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:07:21,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:07:21,392 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 23:07:21,433 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:07:21,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:07:21,434 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:07:21,434 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:07:21,434 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:07:21,435 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:07:21,435 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:07:21,435 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:07:21,435 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:07:21,435 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:07:21,435 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:07:21,435 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:07:21,435 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:07:21,435 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:07:21,436 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:07:21,436 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:07:21,436 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:07:21,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:07:21,436 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:07:21,436 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:07:21,436 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:07:21,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:07:21,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:07:21,437 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:07:21,437 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:07:21,437 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:07:21,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:07:21,437 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:07:21,437 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 23:07:21,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:07:21,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:07:21,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:07:21,767 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:07:21,768 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:07:21,769 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 23:07:22,707 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:07:22,954 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:07:22,956 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 23:07:22,965 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eee12c9d9/156a0f8e3c0f4906b1d095c787c3ad72/FLAGe1172fe34 [2022-12-05 23:07:22,981 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eee12c9d9/156a0f8e3c0f4906b1d095c787c3ad72 [2022-12-05 23:07:22,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:07:22,984 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:07:22,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:07:22,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:07:22,986 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:07:22,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:07:22" (1/1) ... [2022-12-05 23:07:22,988 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@446f3351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:22, skipping insertion in model container [2022-12-05 23:07:22,988 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:07:22" (1/1) ... [2022-12-05 23:07:22,992 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:07:23,040 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:07:23,165 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/rfi000_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-05 23:07:23,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:23,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:23,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:23,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:23,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:23,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:23,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:23,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:23,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:23,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:23,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:23,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:23,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:23,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:23,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:23,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:23,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:23,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:23,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:23,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:23,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:23,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:23,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:23,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:23,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:23,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:23,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:07:23,380 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:07:23,389 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/rfi000_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-05 23:07:23,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:23,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:23,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:23,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:23,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:23,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:23,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:23,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:23,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:23,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:23,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:23,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:23,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:23,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:23,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:23,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:23,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:23,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:23,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:23,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:23,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:23,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:23,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:23,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:23,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:23,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:23,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:07:23,463 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:07:23,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:23 WrapperNode [2022-12-05 23:07:23,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:07:23,464 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:07:23,465 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:07:23,465 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:07:23,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:23" (1/1) ... [2022-12-05 23:07:23,484 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:23" (1/1) ... [2022-12-05 23:07:23,508 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2022-12-05 23:07:23,509 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:07:23,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:07:23,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:07:23,509 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:07:23,515 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:23" (1/1) ... [2022-12-05 23:07:23,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:23" (1/1) ... [2022-12-05 23:07:23,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:23" (1/1) ... [2022-12-05 23:07:23,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:23" (1/1) ... [2022-12-05 23:07:23,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:23" (1/1) ... [2022-12-05 23:07:23,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:23" (1/1) ... [2022-12-05 23:07:23,541 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:23" (1/1) ... [2022-12-05 23:07:23,542 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:23" (1/1) ... [2022-12-05 23:07:23,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:07:23,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:07:23,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:07:23,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:07:23,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:23" (1/1) ... [2022-12-05 23:07:23,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:07:23,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:07:23,582 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 23:07:23,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 23:07:23,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:07:23,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:07:23,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:07:23,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:07:23,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:07:23,626 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:07:23,626 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:07:23,626 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:07:23,627 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:07:23,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:07:23,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:07:23,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:07:23,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:07:23,629 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:07:23,770 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:07:23,771 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:07:24,049 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:07:24,191 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:07:24,191 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:07:24,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:07:24 BoogieIcfgContainer [2022-12-05 23:07:24,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:07:24,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:07:24,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:07:24,198 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:07:24,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:07:22" (1/3) ... [2022-12-05 23:07:24,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e870aa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:07:24, skipping insertion in model container [2022-12-05 23:07:24,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:23" (2/3) ... [2022-12-05 23:07:24,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e870aa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:07:24, skipping insertion in model container [2022-12-05 23:07:24,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:07:24" (3/3) ... [2022-12-05 23:07:24,200 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 23:07:24,214 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:07:24,214 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:07:24,214 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:07:24,270 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:07:24,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 190 flow [2022-12-05 23:07:24,348 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2022-12-05 23:07:24,348 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:07:24,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-05 23:07:24,352 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 90 transitions, 190 flow [2022-12-05 23:07:24,356 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 88 transitions, 182 flow [2022-12-05 23:07:24,357 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:24,377 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 88 transitions, 182 flow [2022-12-05 23:07:24,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 88 transitions, 182 flow [2022-12-05 23:07:24,411 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2022-12-05 23:07:24,411 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:07:24,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-05 23:07:24,414 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 88 transitions, 182 flow [2022-12-05 23:07:24,414 INFO L188 LiptonReduction]: Number of co-enabled transitions 1174 [2022-12-05 23:07:28,139 INFO L203 LiptonReduction]: Total number of compositions: 69 [2022-12-05 23:07:28,150 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:07:28,154 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;@4fcdde25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:07:28,154 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-05 23:07:28,155 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-05 23:07:28,155 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:07:28,155 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:07:28,156 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-05 23:07:28,156 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:07:28,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:07:28,159 INFO L85 PathProgramCache]: Analyzing trace with hash 467963, now seen corresponding path program 1 times [2022-12-05 23:07:28,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:07:28,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327506428] [2022-12-05 23:07:28,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:07:28,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:07:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:07:28,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:07:28,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:07:28,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327506428] [2022-12-05 23:07:28,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327506428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:07:28,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:07:28,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:07:28,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784656810] [2022-12-05 23:07:28,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:07:28,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:07:28,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:07:28,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:07:28,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:07:28,477 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-05 23:07:28,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:28,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:07:28,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-05 23:07:28,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:07:28,597 INFO L130 PetriNetUnfolder]: 214/387 cut-off events. [2022-12-05 23:07:28,597 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 23:07:28,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 772 conditions, 387 events. 214/387 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1581 event pairs, 73 based on Foata normal form. 0/333 useless extension candidates. Maximal degree in co-relation 762. Up to 307 conditions per place. [2022-12-05 23:07:28,600 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 23 selfloop transitions, 2 changer transitions 6/33 dead transitions. [2022-12-05 23:07:28,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 33 transitions, 137 flow [2022-12-05 23:07:28,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:07:28,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:07:28,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-12-05 23:07:28,608 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6086956521739131 [2022-12-05 23:07:28,610 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 52 flow. Second operand 3 states and 42 transitions. [2022-12-05 23:07:28,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 33 transitions, 137 flow [2022-12-05 23:07:28,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 33 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:07:28,613 INFO L231 Difference]: Finished difference. Result has 27 places, 17 transitions, 42 flow [2022-12-05 23:07:28,614 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=27, PETRI_TRANSITIONS=17} [2022-12-05 23:07:28,616 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -2 predicate places. [2022-12-05 23:07:28,616 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:07:28,617 INFO L89 Accepts]: Start accepts. Operand has 27 places, 17 transitions, 42 flow [2022-12-05 23:07:28,618 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:07:28,619 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:28,619 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 17 transitions, 42 flow [2022-12-05 23:07:28,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 17 transitions, 42 flow [2022-12-05 23:07:28,623 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-05 23:07:28,623 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:07:28,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 17 events. 0/17 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:07:28,624 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 17 transitions, 42 flow [2022-12-05 23:07:28,624 INFO L188 LiptonReduction]: Number of co-enabled transitions 124 [2022-12-05 23:07:28,677 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:07:28,678 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-05 23:07:28,678 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 42 flow [2022-12-05 23:07:28,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:28,679 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:07:28,679 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:07:28,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:07:28,679 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:07:28,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:07:28,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1584771715, now seen corresponding path program 1 times [2022-12-05 23:07:28,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:07:28,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166438598] [2022-12-05 23:07:28,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:07:28,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:07:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:07:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:07:29,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:07:29,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166438598] [2022-12-05 23:07:29,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166438598] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:07:29,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:07:29,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:07:29,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579675965] [2022-12-05 23:07:29,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:07:29,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:07:29,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:07:29,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:07:29,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:07:29,265 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 23:07:29,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 42 flow. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:29,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:07:29,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 23:07:29,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:07:29,368 INFO L130 PetriNetUnfolder]: 199/351 cut-off events. [2022-12-05 23:07:29,368 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-05 23:07:29,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 351 events. 199/351 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1184 event pairs, 75 based on Foata normal form. 19/370 useless extension candidates. Maximal degree in co-relation 735. Up to 212 conditions per place. [2022-12-05 23:07:29,382 INFO L137 encePairwiseOnDemand]: 9/17 looper letters, 22 selfloop transitions, 7 changer transitions 0/29 dead transitions. [2022-12-05 23:07:29,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 29 transitions, 126 flow [2022-12-05 23:07:29,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:07:29,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:07:29,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-05 23:07:29,384 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45588235294117646 [2022-12-05 23:07:29,384 INFO L175 Difference]: Start difference. First operand has 24 places, 17 transitions, 42 flow. Second operand 4 states and 31 transitions. [2022-12-05 23:07:29,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 29 transitions, 126 flow [2022-12-05 23:07:29,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 29 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:07:29,385 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 90 flow [2022-12-05 23:07:29,385 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2022-12-05 23:07:29,385 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -1 predicate places. [2022-12-05 23:07:29,386 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:07:29,386 INFO L89 Accepts]: Start accepts. Operand has 28 places, 22 transitions, 90 flow [2022-12-05 23:07:29,386 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:07:29,386 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:29,387 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 22 transitions, 90 flow [2022-12-05 23:07:29,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 22 transitions, 90 flow [2022-12-05 23:07:29,399 INFO L130 PetriNetUnfolder]: 42/98 cut-off events. [2022-12-05 23:07:29,399 INFO L131 PetriNetUnfolder]: For 19/22 co-relation queries the response was YES. [2022-12-05 23:07:29,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 98 events. 42/98 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 341 event pairs, 21 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 219. Up to 70 conditions per place. [2022-12-05 23:07:29,401 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 22 transitions, 90 flow [2022-12-05 23:07:29,401 INFO L188 LiptonReduction]: Number of co-enabled transitions 106 [2022-12-05 23:07:29,636 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [342] L747-->L750: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [351] L786-->L802: Formula: (let ((.cse10 (= (mod v_~y$r_buff1_thd2~0_98 256) 0)) (.cse4 (= (mod v_~y$r_buff0_thd2~0_100 256) 0))) (let ((.cse5 (not .cse4)) (.cse1 (and .cse4 .cse10)) (.cse8 (and (= (mod v_~y$w_buff1_used~0_181 256) 0) .cse4)) (.cse11 (= (mod v_~y$w_buff0_used~0_180 256) 0))) (let ((.cse6 (or .cse1 .cse8 .cse11)) (.cse7 (and .cse5 (not .cse11))) (.cse2 (= (mod v_~y$w_buff0_used~0_179 256) 0)) (.cse3 (= (mod v_~y$w_buff1_used~0_180 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_88 256) 0)))) (and (= v_~y~0_173 v_~y$mem_tmp~0_62) (= v_~y$r_buff0_thd2~0_99 (ite .cse0 v_~y$r_buff0_thd2~0_100 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~y$r_buff0_thd2~0_100 (ite (and (not .cse2) .cse5) 0 v_~y$r_buff0_thd2~0_100)))) (= (ite .cse0 v_~y$w_buff0_used~0_180 (ite .cse6 v_~y$w_buff0_used~0_180 (ite .cse7 0 v_~y$w_buff0_used~0_180))) v_~y$w_buff0_used~0_179) (= 0 v_~y$flush_delayed~0_75) (= v_~weak$$choice0~0_21 |v_P1Thread1of1ForFork1_#t~nondet5_1|) (= v_~weak$$choice2~0_88 |v_P1Thread1of1ForFork1_#t~nondet6_1|) (= v_~y$w_buff1~0_100 v_~y$w_buff1~0_99) (= v_~y$w_buff0~0_111 v_~y$w_buff0~0_110) (= v_~__unbuffered_p1_EBX~0_18 (ite .cse6 v_~y~0_173 (ite .cse7 v_~y$w_buff0~0_111 v_~y$w_buff1~0_100))) (= v_~y$w_buff1_used~0_180 (ite .cse0 v_~y$w_buff1_used~0_181 (ite (or .cse1 .cse2 .cse8) v_~y$w_buff1_used~0_181 0))) (= (ite .cse0 v_~y$r_buff1_thd2~0_98 (ite (let ((.cse9 (= (mod v_~y$r_buff0_thd2~0_99 256) 0))) (or .cse2 (and .cse3 .cse9) (and .cse9 .cse10))) v_~y$r_buff1_thd2~0_98 0)) v_~y$r_buff1_thd2~0_97) (= v_~y~0_171 (ite .cse0 v_~y$mem_tmp~0_62 v_~__unbuffered_p1_EBX~0_18)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_98, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_180, ~y$w_buff1~0=v_~y$w_buff1~0_100, P1Thread1of1ForFork1_#t~nondet6=|v_P1Thread1of1ForFork1_#t~nondet6_1|, P1Thread1of1ForFork1_#t~nondet5=|v_P1Thread1of1ForFork1_#t~nondet5_1|, ~y$w_buff0~0=v_~y$w_buff0~0_111, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_100, ~y~0=v_~y~0_173, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_181} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_179, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_97, ~weak$$choice0~0=v_~weak$$choice0~0_21, ~y$mem_tmp~0=v_~y$mem_tmp~0_62, ~y$w_buff1~0=v_~y$w_buff1~0_99, ~y$w_buff0~0=v_~y$w_buff0~0_110, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_99, ~y$flush_delayed~0=v_~y$flush_delayed~0_75, ~y~0=v_~y~0_171, ~weak$$choice2~0=v_~weak$$choice2~0_88, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_180} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet6, P1Thread1of1ForFork1_#t~nondet5, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-05 23:07:29,770 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [342] L747-->L750: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [352] L802-->L809: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_175 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd2~0_94 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_96 256) 0)))) (let ((.cse4 (and (not (= (mod v_~y$w_buff0_used~0_176 256) 0)) .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff1_used~0_177 256) 0)) .cse2)) (.cse1 (and .cse3 .cse5))) (and (= v_~y$w_buff1_used~0_176 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_177)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_176 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_95 256) 0)))) 0 v_~y$r_buff1_thd2~0_94) v_~y$r_buff1_thd2~0_93) (= (ite .cse4 0 v_~y$w_buff0_used~0_176) v_~y$w_buff0_used~0_175) (= v_~y~0_167 (ite .cse4 v_~y$w_buff0~0_108 (ite .cse0 v_~y$w_buff1~0_97 v_~y~0_168))) (= (ite .cse1 0 v_~y$r_buff0_thd2~0_96) v_~y$r_buff0_thd2~0_95)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_94, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_176, ~y$w_buff1~0=v_~y$w_buff1~0_97, ~y$w_buff0~0=v_~y$w_buff0~0_108, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_96, ~y~0=v_~y~0_168, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_177} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_93, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_175, ~y$w_buff1~0=v_~y$w_buff1~0_97, ~y$w_buff0~0=v_~y$w_buff0~0_108, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_95, ~y~0=v_~y~0_167, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_176} 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-05 23:07:29,886 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [342] L747-->L750: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [437] L832-->L840: Formula: (let ((.cse0 (not (= (mod v_~y$w_buff0_used~0_371 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd0~0_174 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_171 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_372 256) 0)))) (.cse3 (and (not (= (mod v_~y$w_buff1_used~0_349 256) 0)) .cse1)) (.cse4 (and .cse5 .cse0))) (and (= v_~y$r_buff1_thd0~0_173 (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_170 256) 0)) .cse0) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_348 256) 0)))) 0 v_~y$r_buff1_thd0~0_174)) (= (ite .cse2 0 v_~y$w_buff0_used~0_372) v_~y$w_buff0_used~0_371) (= (mod v_~main$tmp_guard0~0_24 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_19|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_29| 0)) (= v_~y~0_325 (ite .cse2 v_~y$w_buff0~0_270 (ite .cse3 v_~y$w_buff1~0_239 v_~y~0_326))) (= v_~y$w_buff1_used~0_348 (ite (or .cse4 .cse3) 0 v_~y$w_buff1_used~0_349)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_29| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_19|) (= v_~y$r_buff0_thd0~0_170 (ite .cse4 0 v_~y$r_buff0_thd0~0_171))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_372, ~y$w_buff1~0=v_~y$w_buff1~0_239, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_171, ~y$w_buff0~0=v_~y$w_buff0~0_270, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~y~0=v_~y~0_326, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_174, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_349} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_371, ~y$w_buff1~0=v_~y$w_buff1~0_239, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_170, ~y$w_buff0~0=v_~y$w_buff0~0_270, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_29|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~y~0=v_~y~0_325, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_173, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_348, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_19|} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-05 23:07:29,992 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:07:29,993 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 607 [2022-12-05 23:07:29,993 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 90 flow [2022-12-05 23:07:29,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:29,993 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:07:29,993 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:07:29,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:07:29,994 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:07:29,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:07:29,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1898737267, now seen corresponding path program 1 times [2022-12-05 23:07:29,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:07:29,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124798866] [2022-12-05 23:07:29,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:07:30,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:07:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:07:30,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:07:30,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:07:30,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124798866] [2022-12-05 23:07:30,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124798866] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:07:30,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:07:30,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:07:30,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245323997] [2022-12-05 23:07:30,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:07:30,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:07:30,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:07:30,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:07:30,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:07:30,207 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-05 23:07:30,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:30,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:07:30,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-05 23:07:30,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:07:30,271 INFO L130 PetriNetUnfolder]: 150/262 cut-off events. [2022-12-05 23:07:30,271 INFO L131 PetriNetUnfolder]: For 153/153 co-relation queries the response was YES. [2022-12-05 23:07:30,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 262 events. 150/262 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 864 event pairs, 50 based on Foata normal form. 5/259 useless extension candidates. Maximal degree in co-relation 734. Up to 159 conditions per place. [2022-12-05 23:07:30,272 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 23 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2022-12-05 23:07:30,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 28 transitions, 170 flow [2022-12-05 23:07:30,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:07:30,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:07:30,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-05 23:07:30,276 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-05 23:07:30,276 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 90 flow. Second operand 3 states and 33 transitions. [2022-12-05 23:07:30,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 28 transitions, 170 flow [2022-12-05 23:07:30,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 28 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:07:30,277 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 99 flow [2022-12-05 23:07:30,277 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2022-12-05 23:07:30,278 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2022-12-05 23:07:30,278 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:07:30,278 INFO L89 Accepts]: Start accepts. Operand has 29 places, 21 transitions, 99 flow [2022-12-05 23:07:30,279 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:07:30,279 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:30,279 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 21 transitions, 99 flow [2022-12-05 23:07:30,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 21 transitions, 99 flow [2022-12-05 23:07:30,288 INFO L130 PetriNetUnfolder]: 34/80 cut-off events. [2022-12-05 23:07:30,288 INFO L131 PetriNetUnfolder]: For 52/53 co-relation queries the response was YES. [2022-12-05 23:07:30,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 80 events. 34/80 cut-off events. For 52/53 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 258 event pairs, 13 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 201. Up to 59 conditions per place. [2022-12-05 23:07:30,289 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 21 transitions, 99 flow [2022-12-05 23:07:30,289 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-05 23:07:30,298 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:07:30,299 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-05 23:07:30,299 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 99 flow [2022-12-05 23:07:30,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:30,299 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:07:30,299 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:07:30,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:07:30,299 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:07:30,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:07:30,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1280103030, now seen corresponding path program 1 times [2022-12-05 23:07:30,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:07:30,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184185163] [2022-12-05 23:07:30,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:07:30,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:07:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:07:30,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:07:30,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:07:30,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184185163] [2022-12-05 23:07:30,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184185163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:07:30,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:07:30,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:07:30,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966109456] [2022-12-05 23:07:30,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:07:30,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:07:30,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:07:30,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:07:30,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:07:30,828 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-05 23:07:30,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:30,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:07:30,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-05 23:07:30,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:07:30,933 INFO L130 PetriNetUnfolder]: 168/295 cut-off events. [2022-12-05 23:07:30,933 INFO L131 PetriNetUnfolder]: For 182/182 co-relation queries the response was YES. [2022-12-05 23:07:30,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 295 events. 168/295 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 999 event pairs, 46 based on Foata normal form. 1/293 useless extension candidates. Maximal degree in co-relation 862. Up to 248 conditions per place. [2022-12-05 23:07:30,935 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 30 selfloop transitions, 7 changer transitions 0/38 dead transitions. [2022-12-05 23:07:30,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 38 transitions, 231 flow [2022-12-05 23:07:30,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:07:30,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:07:30,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-05 23:07:30,936 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-05 23:07:30,936 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 99 flow. Second operand 4 states and 42 transitions. [2022-12-05 23:07:30,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 38 transitions, 231 flow [2022-12-05 23:07:30,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 38 transitions, 216 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-05 23:07:30,938 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 141 flow [2022-12-05 23:07:30,938 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2022-12-05 23:07:30,939 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2022-12-05 23:07:30,939 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:07:30,939 INFO L89 Accepts]: Start accepts. Operand has 31 places, 26 transitions, 141 flow [2022-12-05 23:07:30,940 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:07:30,940 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:30,940 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 26 transitions, 141 flow [2022-12-05 23:07:30,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 26 transitions, 141 flow [2022-12-05 23:07:30,952 INFO L130 PetriNetUnfolder]: 46/109 cut-off events. [2022-12-05 23:07:30,952 INFO L131 PetriNetUnfolder]: For 75/79 co-relation queries the response was YES. [2022-12-05 23:07:30,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 109 events. 46/109 cut-off events. For 75/79 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 397 event pairs, 13 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 303. Up to 74 conditions per place. [2022-12-05 23:07:30,953 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 26 transitions, 141 flow [2022-12-05 23:07:30,953 INFO L188 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-05 23:07:30,960 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:07:30,961 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-05 23:07:30,961 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 141 flow [2022-12-05 23:07:30,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:30,961 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:07:30,961 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:07:30,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:07:30,962 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:07:30,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:07:30,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1271277016, now seen corresponding path program 2 times [2022-12-05 23:07:30,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:07:30,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441166299] [2022-12-05 23:07:30,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:07:30,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:07:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:07:31,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:07:31,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:07:31,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441166299] [2022-12-05 23:07:31,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441166299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:07:31,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:07:31,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:07:31,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422905770] [2022-12-05 23:07:31,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:07:31,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 23:07:31,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:07:31,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 23:07:31,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-05 23:07:31,535 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-05 23:07:31,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 141 flow. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:31,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:07:31,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-05 23:07:31,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:07:31,702 INFO L130 PetriNetUnfolder]: 166/293 cut-off events. [2022-12-05 23:07:31,703 INFO L131 PetriNetUnfolder]: For 244/244 co-relation queries the response was YES. [2022-12-05 23:07:31,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 983 conditions, 293 events. 166/293 cut-off events. For 244/244 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 998 event pairs, 39 based on Foata normal form. 3/293 useless extension candidates. Maximal degree in co-relation 967. Up to 248 conditions per place. [2022-12-05 23:07:31,705 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 31 selfloop transitions, 13 changer transitions 0/45 dead transitions. [2022-12-05 23:07:31,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 45 transitions, 312 flow [2022-12-05 23:07:31,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:07:31,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:07:31,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-05 23:07:31,707 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2022-12-05 23:07:31,707 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 141 flow. Second operand 5 states and 48 transitions. [2022-12-05 23:07:31,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 45 transitions, 312 flow [2022-12-05 23:07:31,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 45 transitions, 299 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-05 23:07:31,711 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 222 flow [2022-12-05 23:07:31,711 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=222, PETRI_PLACES=36, PETRI_TRANSITIONS=33} [2022-12-05 23:07:31,713 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2022-12-05 23:07:31,713 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:07:31,713 INFO L89 Accepts]: Start accepts. Operand has 36 places, 33 transitions, 222 flow [2022-12-05 23:07:31,715 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:07:31,715 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:31,716 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 33 transitions, 222 flow [2022-12-05 23:07:31,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 33 transitions, 222 flow [2022-12-05 23:07:31,730 INFO L130 PetriNetUnfolder]: 48/111 cut-off events. [2022-12-05 23:07:31,730 INFO L131 PetriNetUnfolder]: For 132/135 co-relation queries the response was YES. [2022-12-05 23:07:31,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 111 events. 48/111 cut-off events. For 132/135 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 397 event pairs, 12 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 351. Up to 68 conditions per place. [2022-12-05 23:07:31,731 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 33 transitions, 222 flow [2022-12-05 23:07:31,731 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-05 23:07:31,750 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:07:31,752 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-05 23:07:31,752 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 222 flow [2022-12-05 23:07:31,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:31,752 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:07:31,752 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:07:31,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:07:31,753 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:07:31,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:07:31,753 INFO L85 PathProgramCache]: Analyzing trace with hash -752402210, now seen corresponding path program 1 times [2022-12-05 23:07:31,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:07:31,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061488976] [2022-12-05 23:07:31,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:07:31,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:07:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:07:32,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:07:32,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:07:32,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061488976] [2022-12-05 23:07:32,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061488976] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:07:32,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:07:32,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 23:07:32,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852729195] [2022-12-05 23:07:32,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:07:32,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 23:07:32,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:07:32,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 23:07:32,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-05 23:07:32,338 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-05 23:07:32,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 222 flow. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:32,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:07:32,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-05 23:07:32,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:07:32,535 INFO L130 PetriNetUnfolder]: 186/321 cut-off events. [2022-12-05 23:07:32,535 INFO L131 PetriNetUnfolder]: For 469/469 co-relation queries the response was YES. [2022-12-05 23:07:32,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1190 conditions, 321 events. 186/321 cut-off events. For 469/469 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1110 event pairs, 21 based on Foata normal form. 1/319 useless extension candidates. Maximal degree in co-relation 1171. Up to 248 conditions per place. [2022-12-05 23:07:32,537 INFO L137 encePairwiseOnDemand]: 8/21 looper letters, 36 selfloop transitions, 22 changer transitions 0/59 dead transitions. [2022-12-05 23:07:32,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 59 transitions, 454 flow [2022-12-05 23:07:32,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:07:32,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:07:32,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-12-05 23:07:32,539 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-05 23:07:32,539 INFO L175 Difference]: Start difference. First operand has 36 places, 33 transitions, 222 flow. Second operand 6 states and 63 transitions. [2022-12-05 23:07:32,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 59 transitions, 454 flow [2022-12-05 23:07:32,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 59 transitions, 449 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:07:32,541 INFO L231 Difference]: Finished difference. Result has 41 places, 42 transitions, 353 flow [2022-12-05 23:07:32,541 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=353, PETRI_PLACES=41, PETRI_TRANSITIONS=42} [2022-12-05 23:07:32,542 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 12 predicate places. [2022-12-05 23:07:32,542 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:07:32,542 INFO L89 Accepts]: Start accepts. Operand has 41 places, 42 transitions, 353 flow [2022-12-05 23:07:32,543 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:07:32,543 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:32,543 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 42 transitions, 353 flow [2022-12-05 23:07:32,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 42 transitions, 353 flow [2022-12-05 23:07:32,558 INFO L130 PetriNetUnfolder]: 68/136 cut-off events. [2022-12-05 23:07:32,558 INFO L131 PetriNetUnfolder]: For 253/260 co-relation queries the response was YES. [2022-12-05 23:07:32,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 575 conditions, 136 events. 68/136 cut-off events. For 253/260 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 460 event pairs, 5 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 557. Up to 91 conditions per place. [2022-12-05 23:07:32,559 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 42 transitions, 353 flow [2022-12-05 23:07:32,560 INFO L188 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-05 23:07:33,182 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:07:33,183 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 641 [2022-12-05 23:07:33,183 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 42 transitions, 359 flow [2022-12-05 23:07:33,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:33,183 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:07:33,183 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:07:33,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:07:33,184 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:07:33,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:07:33,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1336599130, now seen corresponding path program 2 times [2022-12-05 23:07:33,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:07:33,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023787246] [2022-12-05 23:07:33,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:07:33,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:07:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:07:33,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:07:33,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:07:33,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023787246] [2022-12-05 23:07:33,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023787246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:07:33,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:07:33,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 23:07:33,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559887799] [2022-12-05 23:07:33,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:07:33,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 23:07:33,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:07:33,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 23:07:33,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-05 23:07:33,942 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-05 23:07:33,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 42 transitions, 359 flow. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:33,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:07:33,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-05 23:07:33,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:07:34,442 INFO L130 PetriNetUnfolder]: 306/527 cut-off events. [2022-12-05 23:07:34,442 INFO L131 PetriNetUnfolder]: For 1136/1136 co-relation queries the response was YES. [2022-12-05 23:07:34,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2290 conditions, 527 events. 306/527 cut-off events. For 1136/1136 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2165 event pairs, 20 based on Foata normal form. 9/532 useless extension candidates. Maximal degree in co-relation 2269. Up to 299 conditions per place. [2022-12-05 23:07:34,445 INFO L137 encePairwiseOnDemand]: 10/22 looper letters, 62 selfloop transitions, 39 changer transitions 0/102 dead transitions. [2022-12-05 23:07:34,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 102 transitions, 948 flow [2022-12-05 23:07:34,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 23:07:34,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 23:07:34,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2022-12-05 23:07:34,447 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41363636363636364 [2022-12-05 23:07:34,447 INFO L175 Difference]: Start difference. First operand has 41 places, 42 transitions, 359 flow. Second operand 10 states and 91 transitions. [2022-12-05 23:07:34,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 102 transitions, 948 flow [2022-12-05 23:07:34,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 102 transitions, 877 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-05 23:07:34,450 INFO L231 Difference]: Finished difference. Result has 51 places, 69 transitions, 673 flow [2022-12-05 23:07:34,451 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=673, PETRI_PLACES=51, PETRI_TRANSITIONS=69} [2022-12-05 23:07:34,451 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 22 predicate places. [2022-12-05 23:07:34,451 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:07:34,451 INFO L89 Accepts]: Start accepts. Operand has 51 places, 69 transitions, 673 flow [2022-12-05 23:07:34,452 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:07:34,452 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:34,452 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 69 transitions, 673 flow [2022-12-05 23:07:34,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 69 transitions, 673 flow [2022-12-05 23:07:34,478 INFO L130 PetriNetUnfolder]: 106/217 cut-off events. [2022-12-05 23:07:34,478 INFO L131 PetriNetUnfolder]: For 781/782 co-relation queries the response was YES. [2022-12-05 23:07:34,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1075 conditions, 217 events. 106/217 cut-off events. For 781/782 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 943 event pairs, 5 based on Foata normal form. 1/215 useless extension candidates. Maximal degree in co-relation 1052. Up to 159 conditions per place. [2022-12-05 23:07:34,480 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 69 transitions, 673 flow [2022-12-05 23:07:34,480 INFO L188 LiptonReduction]: Number of co-enabled transitions 174 [2022-12-05 23:07:34,483 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:07:34,483 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-05 23:07:34,483 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 69 transitions, 673 flow [2022-12-05 23:07:34,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:34,484 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:07:34,484 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:07:34,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:07:34,484 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-05 23:07:34,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:07:34,484 INFO L85 PathProgramCache]: Analyzing trace with hash 211658869, now seen corresponding path program 1 times [2022-12-05 23:07:34,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:07:34,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681260361] [2022-12-05 23:07:34,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:07:34,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:07:34,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:07:34,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:07:34,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:07:34,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681260361] [2022-12-05 23:07:34,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681260361] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:07:34,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:07:34,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:07:34,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222623380] [2022-12-05 23:07:34,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:07:34,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:07:34,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:07:34,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:07:34,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:07:34,884 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-05 23:07:34,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 69 transitions, 673 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:34,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:07:34,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-05 23:07:34,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:07:35,070 INFO L130 PetriNetUnfolder]: 414/733 cut-off events. [2022-12-05 23:07:35,071 INFO L131 PetriNetUnfolder]: For 2812/2812 co-relation queries the response was YES. [2022-12-05 23:07:35,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3555 conditions, 733 events. 414/733 cut-off events. For 2812/2812 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3372 event pairs, 47 based on Foata normal form. 16/749 useless extension candidates. Maximal degree in co-relation 3529. Up to 402 conditions per place. [2022-12-05 23:07:35,075 INFO L137 encePairwiseOnDemand]: 11/21 looper letters, 66 selfloop transitions, 8 changer transitions 29/103 dead transitions. [2022-12-05 23:07:35,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 103 transitions, 1143 flow [2022-12-05 23:07:35,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:07:35,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:07:35,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-05 23:07:35,077 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2022-12-05 23:07:35,077 INFO L175 Difference]: Start difference. First operand has 51 places, 69 transitions, 673 flow. Second operand 4 states and 40 transitions. [2022-12-05 23:07:35,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 103 transitions, 1143 flow [2022-12-05 23:07:35,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 103 transitions, 1122 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-12-05 23:07:35,086 INFO L231 Difference]: Finished difference. Result has 55 places, 60 transitions, 564 flow [2022-12-05 23:07:35,086 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=564, PETRI_PLACES=55, PETRI_TRANSITIONS=60} [2022-12-05 23:07:35,087 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 26 predicate places. [2022-12-05 23:07:35,088 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:07:35,088 INFO L89 Accepts]: Start accepts. Operand has 55 places, 60 transitions, 564 flow [2022-12-05 23:07:35,089 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:07:35,089 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:35,089 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 60 transitions, 564 flow [2022-12-05 23:07:35,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 60 transitions, 564 flow [2022-12-05 23:07:35,124 INFO L130 PetriNetUnfolder]: 94/256 cut-off events. [2022-12-05 23:07:35,124 INFO L131 PetriNetUnfolder]: For 879/881 co-relation queries the response was YES. [2022-12-05 23:07:35,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1184 conditions, 256 events. 94/256 cut-off events. For 879/881 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1448 event pairs, 9 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 1158. Up to 168 conditions per place. [2022-12-05 23:07:35,126 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 60 transitions, 564 flow [2022-12-05 23:07:35,126 INFO L188 LiptonReduction]: Number of co-enabled transitions 150 [2022-12-05 23:07:35,129 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [448] L747-->L809: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd2~0_288 256) 0))) (.cse3 (not (= 0 (mod v_~y$w_buff0_used~0_584 256)))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_283 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_585 256) 0)) .cse5)) (.cse0 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_530 256) 0)) .cse4))) (and (= v_~x~0_95 1) (= v_~y$r_buff0_thd2~0_282 (ite .cse0 0 v_~y$r_buff0_thd2~0_283)) (= v_~y~0_501 (ite .cse1 v_~y$w_buff0~0_432 (ite .cse2 v_~y$w_buff1~0_376 v_~y~0_502))) (= v_~y$w_buff0_used~0_584 (ite .cse1 0 v_~y$w_buff0_used~0_585)) (= (ite (or .cse0 .cse2) 0 v_~y$w_buff1_used~0_530) v_~y$w_buff1_used~0_529) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_282 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_529 256) 0)) .cse4)) 0 v_~y$r_buff1_thd2~0_288) v_~y$r_buff1_thd2~0_287)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_288, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_585, ~y$w_buff1~0=v_~y$w_buff1~0_376, ~y$w_buff0~0=v_~y$w_buff0~0_432, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_283, ~y~0=v_~y~0_502, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_530} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_287, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_584, ~y$w_buff1~0=v_~y$w_buff1~0_376, ~y$w_buff0~0=v_~y$w_buff0~0_432, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_282, ~y~0=v_~y~0_501, ~x~0=v_~x~0_95, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_529} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~x~0, ~y$w_buff1_used~0] and [385] $Ultimate##0-->L767: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= v_~x~0_25 2)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x~0=v_~x~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_~arg.base, ~x~0] [2022-12-05 23:07:35,246 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:07:35,247 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-05 23:07:35,247 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 60 transitions, 567 flow [2022-12-05 23:07:35,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:35,247 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:07:35,247 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:07:35,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:07:35,248 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-05 23:07:35,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:07:35,248 INFO L85 PathProgramCache]: Analyzing trace with hash -847065670, now seen corresponding path program 3 times [2022-12-05 23:07:35,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:07:35,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7585933] [2022-12-05 23:07:35,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:07:35,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:07:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:07:35,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:07:35,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:07:35,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7585933] [2022-12-05 23:07:35,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7585933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:07:35,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:07:35,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 23:07:35,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824524587] [2022-12-05 23:07:35,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:07:35,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 23:07:35,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:07:35,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 23:07:35,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-05 23:07:35,740 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-05 23:07:35,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 60 transitions, 567 flow. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:35,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:07:35,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-05 23:07:35,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:07:35,944 INFO L130 PetriNetUnfolder]: 341/647 cut-off events. [2022-12-05 23:07:35,944 INFO L131 PetriNetUnfolder]: For 2402/2402 co-relation queries the response was YES. [2022-12-05 23:07:35,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3081 conditions, 647 events. 341/647 cut-off events. For 2402/2402 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3150 event pairs, 77 based on Foata normal form. 3/646 useless extension candidates. Maximal degree in co-relation 3052. Up to 535 conditions per place. [2022-12-05 23:07:35,948 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 42 selfloop transitions, 27 changer transitions 11/81 dead transitions. [2022-12-05 23:07:35,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 81 transitions, 828 flow [2022-12-05 23:07:35,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 23:07:35,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 23:07:35,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-12-05 23:07:35,949 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43609022556390975 [2022-12-05 23:07:35,949 INFO L175 Difference]: Start difference. First operand has 55 places, 60 transitions, 567 flow. Second operand 7 states and 58 transitions. [2022-12-05 23:07:35,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 81 transitions, 828 flow [2022-12-05 23:07:35,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 81 transitions, 828 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:07:35,957 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 620 flow [2022-12-05 23:07:35,957 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=620, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2022-12-05 23:07:35,958 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 35 predicate places. [2022-12-05 23:07:35,958 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:07:35,958 INFO L89 Accepts]: Start accepts. Operand has 64 places, 58 transitions, 620 flow [2022-12-05 23:07:35,958 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:07:35,959 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:35,959 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 58 transitions, 620 flow [2022-12-05 23:07:35,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 58 transitions, 620 flow [2022-12-05 23:07:35,985 INFO L130 PetriNetUnfolder]: 79/219 cut-off events. [2022-12-05 23:07:35,985 INFO L131 PetriNetUnfolder]: For 946/948 co-relation queries the response was YES. [2022-12-05 23:07:35,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1127 conditions, 219 events. 79/219 cut-off events. For 946/948 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1188 event pairs, 9 based on Foata normal form. 1/215 useless extension candidates. Maximal degree in co-relation 1096. Up to 144 conditions per place. [2022-12-05 23:07:35,987 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 58 transitions, 620 flow [2022-12-05 23:07:35,987 INFO L188 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-05 23:07:36,411 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [349] L767-->L770: Formula: (= v_~y~0_8 1) InVars {} OutVars{~y~0=v_~y~0_8} AuxVars[] AssignedVars[~y~0] and [343] L750-->L757: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_155 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd1~0_16 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_25 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff0_used~0_156 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_157 256) 0)) .cse1)) (.cse3 (and .cse2 .cse5))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_156) v_~y$w_buff0_used~0_155) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_156 256) 0)) .cse1) (and .cse2 (not (= (mod v_~y$r_buff0_thd1~0_24 256) 0)))) 0 v_~y$r_buff1_thd1~0_16) v_~y$r_buff1_thd1~0_15) (= v_~y$r_buff0_thd1~0_24 (ite .cse3 0 v_~y$r_buff0_thd1~0_25)) (= v_~y~0_145 (ite .cse0 v_~y$w_buff0~0_94 (ite .cse4 v_~y$w_buff1~0_83 v_~y~0_146))) (= (ite (or .cse4 .cse3) 0 v_~y$w_buff1_used~0_157) v_~y$w_buff1_used~0_156)))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_156, ~y$w_buff1~0=v_~y$w_buff1~0_83, ~y$w_buff0~0=v_~y$w_buff0~0_94, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_25, ~y~0=v_~y~0_146, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_157} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_155, ~y$w_buff1~0=v_~y$w_buff1~0_83, ~y$w_buff0~0=v_~y$w_buff0~0_94, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_24, ~y~0=v_~y~0_145, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_156} 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-05 23:07:36,466 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:07:36,467 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 509 [2022-12-05 23:07:36,467 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 58 transitions, 634 flow [2022-12-05 23:07:36,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:36,467 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:07:36,468 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:07:36,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:07:36,468 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:07:36,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:07:36,468 INFO L85 PathProgramCache]: Analyzing trace with hash -352705322, now seen corresponding path program 1 times [2022-12-05 23:07:36,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:07:36,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161455407] [2022-12-05 23:07:36,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:07:36,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:07:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:07:37,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:07:37,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:07:37,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161455407] [2022-12-05 23:07:37,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161455407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:07:37,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:07:37,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 23:07:37,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738578211] [2022-12-05 23:07:37,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:07:37,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 23:07:37,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:07:37,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 23:07:37,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-05 23:07:37,282 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-05 23:07:37,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 58 transitions, 634 flow. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:37,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:07:37,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-05 23:07:37,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:07:37,594 INFO L130 PetriNetUnfolder]: 325/646 cut-off events. [2022-12-05 23:07:37,594 INFO L131 PetriNetUnfolder]: For 3552/3552 co-relation queries the response was YES. [2022-12-05 23:07:37,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3359 conditions, 646 events. 325/646 cut-off events. For 3552/3552 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3337 event pairs, 97 based on Foata normal form. 8/652 useless extension candidates. Maximal degree in co-relation 3325. Up to 421 conditions per place. [2022-12-05 23:07:37,598 INFO L137 encePairwiseOnDemand]: 10/20 looper letters, 48 selfloop transitions, 15 changer transitions 25/89 dead transitions. [2022-12-05 23:07:37,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 89 transitions, 1042 flow [2022-12-05 23:07:37,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 23:07:37,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 23:07:37,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-12-05 23:07:37,600 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.425 [2022-12-05 23:07:37,600 INFO L175 Difference]: Start difference. First operand has 65 places, 58 transitions, 634 flow. Second operand 8 states and 68 transitions. [2022-12-05 23:07:37,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 89 transitions, 1042 flow [2022-12-05 23:07:37,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 89 transitions, 992 flow, removed 13 selfloop flow, removed 3 redundant places. [2022-12-05 23:07:37,608 INFO L231 Difference]: Finished difference. Result has 72 places, 46 transitions, 498 flow [2022-12-05 23:07:37,609 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=498, PETRI_PLACES=72, PETRI_TRANSITIONS=46} [2022-12-05 23:07:37,609 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 43 predicate places. [2022-12-05 23:07:37,609 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:07:37,609 INFO L89 Accepts]: Start accepts. Operand has 72 places, 46 transitions, 498 flow [2022-12-05 23:07:37,610 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:07:37,610 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:37,610 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 46 transitions, 498 flow [2022-12-05 23:07:37,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 46 transitions, 498 flow [2022-12-05 23:07:37,632 INFO L130 PetriNetUnfolder]: 57/177 cut-off events. [2022-12-05 23:07:37,632 INFO L131 PetriNetUnfolder]: For 954/956 co-relation queries the response was YES. [2022-12-05 23:07:37,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 177 events. 57/177 cut-off events. For 954/956 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 943 event pairs, 25 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 907. Up to 116 conditions per place. [2022-12-05 23:07:37,634 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 46 transitions, 498 flow [2022-12-05 23:07:37,634 INFO L188 LiptonReduction]: Number of co-enabled transitions 118 [2022-12-05 23:07:38,292 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:07:38,292 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 683 [2022-12-05 23:07:38,292 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 45 transitions, 497 flow [2022-12-05 23:07:38,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:38,293 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:07:38,293 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:07:38,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:07:38,293 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:07:38,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:07:38,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1253302871, now seen corresponding path program 1 times [2022-12-05 23:07:38,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:07:38,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150023849] [2022-12-05 23:07:38,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:07:38,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:07:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:07:38,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:07:38,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:07:38,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150023849] [2022-12-05 23:07:38,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150023849] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:07:38,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:07:38,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:07:38,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765516119] [2022-12-05 23:07:38,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:07:38,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:07:38,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:07:38,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:07:38,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:07:38,418 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2022-12-05 23:07:38,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 45 transitions, 497 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:38,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:07:38,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2022-12-05 23:07:38,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:07:38,523 INFO L130 PetriNetUnfolder]: 159/371 cut-off events. [2022-12-05 23:07:38,523 INFO L131 PetriNetUnfolder]: For 2676/2677 co-relation queries the response was YES. [2022-12-05 23:07:38,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1926 conditions, 371 events. 159/371 cut-off events. For 2676/2677 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1931 event pairs, 44 based on Foata normal form. 69/437 useless extension candidates. Maximal degree in co-relation 1890. Up to 191 conditions per place. [2022-12-05 23:07:38,525 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 49 selfloop transitions, 4 changer transitions 5/60 dead transitions. [2022-12-05 23:07:38,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 60 transitions, 712 flow [2022-12-05 23:07:38,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:07:38,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:07:38,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-05 23:07:38,526 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2022-12-05 23:07:38,526 INFO L175 Difference]: Start difference. First operand has 69 places, 45 transitions, 497 flow. Second operand 4 states and 48 transitions. [2022-12-05 23:07:38,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 60 transitions, 712 flow [2022-12-05 23:07:38,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 60 transitions, 615 flow, removed 22 selfloop flow, removed 15 redundant places. [2022-12-05 23:07:38,531 INFO L231 Difference]: Finished difference. Result has 57 places, 33 transitions, 293 flow [2022-12-05 23:07:38,531 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=293, PETRI_PLACES=57, PETRI_TRANSITIONS=33} [2022-12-05 23:07:38,532 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 28 predicate places. [2022-12-05 23:07:38,532 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:07:38,532 INFO L89 Accepts]: Start accepts. Operand has 57 places, 33 transitions, 293 flow [2022-12-05 23:07:38,532 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:07:38,532 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:38,533 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 33 transitions, 293 flow [2022-12-05 23:07:38,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 33 transitions, 293 flow [2022-12-05 23:07:38,543 INFO L130 PetriNetUnfolder]: 22/89 cut-off events. [2022-12-05 23:07:38,544 INFO L131 PetriNetUnfolder]: For 402/413 co-relation queries the response was YES. [2022-12-05 23:07:38,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 89 events. 22/89 cut-off events. For 402/413 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 10 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 424. Up to 52 conditions per place. [2022-12-05 23:07:38,544 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 33 transitions, 293 flow [2022-12-05 23:07:38,544 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-05 23:07:38,901 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [457] L767-->L802: Formula: (let ((.cse21 (= (mod v_~y$r_buff1_thd2~0_352 256) 0)) (.cse24 (= (mod v_~y$r_buff0_thd2~0_343 256) 0))) (let ((.cse25 (not .cse24)) (.cse27 (= (mod v_~y$w_buff0_used~0_694 256) 0)) (.cse23 (and .cse24 .cse21)) (.cse26 (and .cse24 (= (mod v_~y$w_buff1_used~0_628 256) 0)))) (let ((.cse18 (not (= (mod |v_P1Thread1of1ForFork1_#t~nondet4_76| 256) 0))) (.cse13 (or .cse27 .cse23 .cse26)) (.cse14 (and .cse25 (not .cse27)))) (let ((.cse12 (ite .cse18 v_~y$w_buff0_used~0_694 (ite .cse13 v_~y$w_buff0_used~0_694 (ite .cse14 0 v_~y$w_buff0_used~0_694))))) (let ((.cse20 (= (mod .cse12 256) 0))) (let ((.cse4 (ite .cse18 v_~y$w_buff1_used~0_628 (ite (or .cse23 .cse26 .cse20) v_~y$w_buff1_used~0_628 0)))) (let ((.cse22 (= (mod .cse4 256) 0)) (.cse19 (not .cse20))) (let ((.cse15 (ite .cse18 v_~y$r_buff0_thd2~0_343 (ite (or .cse23 (and .cse24 .cse22) .cse20) v_~y$r_buff0_thd2~0_343 (ite (and .cse19 .cse25) 0 v_~y$r_buff0_thd2~0_343))))) (let ((.cse16 (= (mod .cse15 256) 0))) (let ((.cse7 (and .cse22 .cse16))) (let ((.cse8 (ite .cse18 v_~y$r_buff1_thd2~0_352 (ite (or (and .cse16 .cse21) .cse7 .cse20) v_~y$r_buff1_thd2~0_352 0)))) (let ((.cse9 (= (mod .cse8 256) 0))) (let ((.cse17 (not .cse16)) (.cse6 (and .cse9 .cse16))) (let ((.cse1 (or .cse6 .cse7 .cse20)) (.cse3 (and .cse17 .cse19)) (.cse0 (not (= (mod v_~weak$$choice2~0_214 256) 0))) (.cse11 (= (mod v_~y$w_buff1_used~0_626 256) 0)) (.cse5 (= (mod v_~y$w_buff0_used~0_692 256) 0)) (.cse2 (ite .cse18 1 v_~__unbuffered_p1_EAX~0_118))) (and (= v_~y$w_buff1~0_457 v_~y$w_buff1~0_455) (= v_~weak$$choice0~0_147 |v_P1Thread1of1ForFork1_#t~nondet5_50|) (= v_~y$flush_delayed~0_209 0) (= v_~y~0_594 (ite .cse0 v_~y$mem_tmp~0_190 v_~__unbuffered_p1_EBX~0_99)) (= v_~__unbuffered_p1_EBX~0_99 (ite .cse1 .cse2 (ite .cse3 v_~y$w_buff0~0_515 v_~y$w_buff1~0_455))) (= v_~y$w_buff1_used~0_626 (ite .cse0 .cse4 (ite (or .cse5 .cse6 .cse7) .cse4 0))) (= (ite .cse0 .cse8 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd2~0_341 256) 0))) (or (and .cse9 .cse10) .cse5 (and .cse10 .cse11))) .cse8 0)) v_~y$r_buff1_thd2~0_350) (= (ite .cse0 .cse12 (ite .cse1 .cse12 (ite .cse3 0 .cse12))) v_~y$w_buff0_used~0_692) (= v_~y$w_buff0~0_517 v_~y$w_buff0~0_515) (= v_~weak$$choice2~0_214 |v_P1Thread1of1ForFork1_#t~nondet6_50|) (= v_~__unbuffered_p1_EAX~0_118 (ite .cse13 1 (ite .cse14 v_~y$w_buff0~0_517 v_~y$w_buff1~0_457))) (= v_~y$r_buff0_thd2~0_341 (ite .cse0 .cse15 (ite (or .cse5 .cse6 (and .cse16 .cse11)) .cse15 (ite (and .cse17 (not .cse5)) 0 .cse15)))) (= v_~y$mem_tmp~0_190 .cse2)))))))))))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_352, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_694, ~y$w_buff1~0=v_~y$w_buff1~0_457, P1Thread1of1ForFork1_#t~nondet6=|v_P1Thread1of1ForFork1_#t~nondet6_50|, P1Thread1of1ForFork1_#t~nondet5=|v_P1Thread1of1ForFork1_#t~nondet5_50|, ~y$w_buff0~0=v_~y$w_buff0~0_517, P1Thread1of1ForFork1_#t~nondet4=|v_P1Thread1of1ForFork1_#t~nondet4_76|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_343, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_628} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_99, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_692, P1Thread1of1ForFork1_#t~nondet3=|v_P1Thread1of1ForFork1_#t~nondet3_75|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_350, ~weak$$choice0~0=v_~weak$$choice0~0_147, ~y$mem_tmp~0=v_~y$mem_tmp~0_190, ~y$w_buff1~0=v_~y$w_buff1~0_455, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_118, ~y$w_buff0~0=v_~y$w_buff0~0_515, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_341, ~y$flush_delayed~0=v_~y$flush_delayed~0_209, ~y~0=v_~y~0_594, ~weak$$choice2~0=v_~weak$$choice2~0_214, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_626} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet6, P1Thread1of1ForFork1_#t~nondet5, P1Thread1of1ForFork1_#t~nondet4, P1Thread1of1ForFork1_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] and [422] $Ultimate##0-->L747: Formula: (and (= |v_P0Thread1of1ForFork0_~arg#1.offset_7| |v_P0Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~y$w_buff0_used~0_283 1) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_17| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_17|) (= v_~y$r_buff0_thd1~0_52 1) (= v_~y$r_buff0_thd0~0_109 v_~y$r_buff1_thd0~0_109) (= |v_P0Thread1of1ForFork0_~arg#1.base_7| |v_P0Thread1of1ForFork0_#in~arg#1.base_7|) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_17| 0)) (= v_~y$w_buff0_used~0_284 v_~y$w_buff1_used~0_264) (= v_~y$r_buff0_thd2~0_141 v_~y$r_buff1_thd2~0_142) (= v_~y$r_buff0_thd1~0_53 v_~y$r_buff1_thd1~0_37) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_283 256) 0)) (not (= (mod v_~y$w_buff1_used~0_264 256) 0)))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_17|) (= 2 v_~y$w_buff0~0_198) (= v_~y$w_buff1~0_171 v_~y$w_buff0~0_199)) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_284, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_109, ~y$w_buff0~0=v_~y$w_buff0~0_199, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_141, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_7|} OutVars{P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_283, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_7|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_7|, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_142, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_37, ~y$w_buff1~0=v_~y$w_buff1~0_171, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_109, ~y$w_buff0~0=v_~y$w_buff0~0_198, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_17|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_52, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_141, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_17|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_109, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_264} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_~arg#1.base, P0Thread1of1ForFork0_~arg#1.offset, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-05 23:07:39,471 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 23:07:39,471 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 939 [2022-12-05 23:07:39,471 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 32 transitions, 301 flow [2022-12-05 23:07:39,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:39,472 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:07:39,472 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:07:39,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 23:07:39,472 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:07:39,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:07:39,472 INFO L85 PathProgramCache]: Analyzing trace with hash 106821970, now seen corresponding path program 1 times [2022-12-05 23:07:39,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:07:39,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107119118] [2022-12-05 23:07:39,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:07:39,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:07:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:07:40,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:07:40,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:07:40,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107119118] [2022-12-05 23:07:40,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107119118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:07:40,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:07:40,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:07:40,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396978139] [2022-12-05 23:07:40,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:07:40,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:07:40,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:07:40,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:07:40,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:07:40,649 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-05 23:07:40,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 32 transitions, 301 flow. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:40,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:07:40,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-05 23:07:40,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:07:40,828 INFO L130 PetriNetUnfolder]: 59/151 cut-off events. [2022-12-05 23:07:40,829 INFO L131 PetriNetUnfolder]: For 808/808 co-relation queries the response was YES. [2022-12-05 23:07:40,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 151 events. 59/151 cut-off events. For 808/808 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 531 event pairs, 26 based on Foata normal form. 1/152 useless extension candidates. Maximal degree in co-relation 814. Up to 126 conditions per place. [2022-12-05 23:07:40,830 INFO L137 encePairwiseOnDemand]: 15/23 looper letters, 30 selfloop transitions, 6 changer transitions 5/42 dead transitions. [2022-12-05 23:07:40,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 42 transitions, 448 flow [2022-12-05 23:07:40,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:07:40,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:07:40,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-05 23:07:40,831 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41304347826086957 [2022-12-05 23:07:40,831 INFO L175 Difference]: Start difference. First operand has 55 places, 32 transitions, 301 flow. Second operand 4 states and 38 transitions. [2022-12-05 23:07:40,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 42 transitions, 448 flow [2022-12-05 23:07:40,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 42 transitions, 372 flow, removed 28 selfloop flow, removed 7 redundant places. [2022-12-05 23:07:40,833 INFO L231 Difference]: Finished difference. Result has 52 places, 27 transitions, 222 flow [2022-12-05 23:07:40,833 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=52, PETRI_TRANSITIONS=27} [2022-12-05 23:07:40,834 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 23 predicate places. [2022-12-05 23:07:40,834 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:07:40,834 INFO L89 Accepts]: Start accepts. Operand has 52 places, 27 transitions, 222 flow [2022-12-05 23:07:40,835 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:07:40,835 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:40,836 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 27 transitions, 222 flow [2022-12-05 23:07:40,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 27 transitions, 222 flow [2022-12-05 23:07:40,844 INFO L130 PetriNetUnfolder]: 18/68 cut-off events. [2022-12-05 23:07:40,844 INFO L131 PetriNetUnfolder]: For 201/201 co-relation queries the response was YES. [2022-12-05 23:07:40,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 68 events. 18/68 cut-off events. For 201/201 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 228 event pairs, 7 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 263. Up to 42 conditions per place. [2022-12-05 23:07:40,845 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 27 transitions, 222 flow [2022-12-05 23:07:40,845 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-05 23:07:41,177 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [464] $Ultimate##0-->L750: Formula: (and (= v_~y$r_buff0_thd2~0_357 v_~y$r_buff1_thd2~0_368) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_722 256) 0)) (not (= (mod v_~y$w_buff1_used~0_654 256) 0)))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_90|) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_90| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_90|) (= v_~y$r_buff0_thd0~0_322 v_~y$r_buff1_thd0~0_324) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_90| 0)) (= v_~y$r_buff0_thd1~0_215 v_~y$r_buff1_thd1~0_142) (= 2 v_~y$w_buff0~0_539) (= v_~y$r_buff0_thd1~0_214 1) (= v_~y$w_buff0_used~0_722 1) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_80| |v_P0Thread1of1ForFork0_~arg#1.offset_80|) (= v_~y$w_buff0_used~0_723 v_~y$w_buff1_used~0_654) (= v_~x~0_117 1) (= v_~y$w_buff1~0_477 v_~y$w_buff0~0_540) (= |v_P0Thread1of1ForFork0_~arg#1.base_80| |v_P0Thread1of1ForFork0_#in~arg#1.base_80|)) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_80|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_723, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_322, ~y$w_buff0~0=v_~y$w_buff0~0_540, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_215, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_357, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_80|} OutVars{P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_80|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_722, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_80|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_80|, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_80|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_368, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_142, ~y$w_buff1~0=v_~y$w_buff1~0_477, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_322, ~y$w_buff0~0=v_~y$w_buff0~0_539, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_90|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_214, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_357, ~x~0=v_~x~0_117, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_90|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_324, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_654} AuxVars[] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork0_~arg#1.base, P0Thread1of1ForFork0_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd1~0, ~x~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [462] $Ultimate##0-->L757: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd1~0_211 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_714 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd1~0_139 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_647 256) 0)) .cse4)) (.cse2 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_715 256) 0))))) (and (= v_~y~0_610 (ite .cse0 v_~y$w_buff0~0_533 (ite .cse1 v_~y$w_buff1~0_471 1))) (= v_P1Thread1of1ForFork1_~arg.base_17 |v_P1Thread1of1ForFork1_#in~arg.base_17|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_17| v_P1Thread1of1ForFork1_~arg.offset_17) (= v_~y$r_buff0_thd1~0_210 (ite .cse2 0 v_~y$r_buff0_thd1~0_211)) (= v_~y$w_buff1_used~0_646 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_647)) (= v_~y$w_buff0_used~0_714 (ite .cse0 0 v_~y$w_buff0_used~0_715)) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd1~0_210 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_646 256) 0)) .cse4)) 0 v_~y$r_buff1_thd1~0_139) v_~y$r_buff1_thd1~0_138) (= 2 v_~x~0_113)))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_139, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_715, ~y$w_buff1~0=v_~y$w_buff1~0_471, ~y$w_buff0~0=v_~y$w_buff0~0_533, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_211, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_17|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_17|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_647} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_138, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_714, ~y$w_buff1~0=v_~y$w_buff1~0_471, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_17, ~y$w_buff0~0=v_~y$w_buff0~0_533, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_210, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_17|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_17|, ~y~0=v_~y~0_610, ~x~0=v_~x~0_113, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_646} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, P1Thread1of1ForFork1_~arg.base, ~y$r_buff0_thd1~0, ~y~0, ~x~0, ~y$w_buff1_used~0] [2022-12-05 23:07:41,412 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [464] $Ultimate##0-->L750: Formula: (and (= v_~y$r_buff0_thd2~0_357 v_~y$r_buff1_thd2~0_368) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_722 256) 0)) (not (= (mod v_~y$w_buff1_used~0_654 256) 0)))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_90|) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_90| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_90|) (= v_~y$r_buff0_thd0~0_322 v_~y$r_buff1_thd0~0_324) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_90| 0)) (= v_~y$r_buff0_thd1~0_215 v_~y$r_buff1_thd1~0_142) (= 2 v_~y$w_buff0~0_539) (= v_~y$r_buff0_thd1~0_214 1) (= v_~y$w_buff0_used~0_722 1) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_80| |v_P0Thread1of1ForFork0_~arg#1.offset_80|) (= v_~y$w_buff0_used~0_723 v_~y$w_buff1_used~0_654) (= v_~x~0_117 1) (= v_~y$w_buff1~0_477 v_~y$w_buff0~0_540) (= |v_P0Thread1of1ForFork0_~arg#1.base_80| |v_P0Thread1of1ForFork0_#in~arg#1.base_80|)) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_80|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_723, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_322, ~y$w_buff0~0=v_~y$w_buff0~0_540, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_215, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_357, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_80|} OutVars{P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_80|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_722, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_80|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_80|, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_80|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_368, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_142, ~y$w_buff1~0=v_~y$w_buff1~0_477, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_322, ~y$w_buff0~0=v_~y$w_buff0~0_539, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_90|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_214, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_357, ~x~0=v_~x~0_117, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_90|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_324, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_654} AuxVars[] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork0_~arg#1.base, P0Thread1of1ForFork0_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd1~0, ~x~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [463] $Ultimate##0-->L786: Formula: (let ((.cse2 (= (mod v_~y$r_buff1_thd2~0_365 256) 0)) (.cse9 (= (mod v_~y$r_buff0_thd2~0_354 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~y$w_buff0_used~0_719 256) 0)) (.cse7 (and (= (mod v_~y$w_buff1_used~0_651 256) 0) .cse9)) (.cse8 (and .cse2 .cse9))) (let ((.cse5 (or .cse11 .cse7 .cse8)) (.cse6 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_220 256) 0))) (.cse4 (= (mod v_~y$w_buff1_used~0_650 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_718 256) 0))) (and (= v_~y$r_buff1_thd2~0_364 (ite .cse0 v_~y$r_buff1_thd2~0_365 (ite (let ((.cse1 (= (mod v_~y$r_buff0_thd2~0_353 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse1))) v_~y$r_buff1_thd2~0_365 0))) (= |v_P1Thread1of1ForFork1_#in~arg.offset_19| v_P1Thread1of1ForFork1_~arg.offset_19) (= v_~weak$$choice2~0_220 |v_P1Thread1of1ForFork1_#t~nondet4_84|) (= v_~y$w_buff0_used~0_718 (ite .cse0 v_~y$w_buff0_used~0_719 (ite .cse5 v_~y$w_buff0_used~0_719 (ite .cse6 0 v_~y$w_buff0_used~0_719)))) (= v_~y$mem_tmp~0_196 1) (= v_~y~0_612 (ite .cse0 v_~y$mem_tmp~0_196 v_~__unbuffered_p1_EAX~0_122)) (= v_P1Thread1of1ForFork1_~arg.base_19 |v_P1Thread1of1ForFork1_#in~arg.base_19|) (= v_~y$w_buff0~0_536 v_~y$w_buff0~0_535) (= v_~weak$$choice0~0_153 |v_P1Thread1of1ForFork1_#t~nondet3_82|) (= v_~y$w_buff1~0_474 v_~y$w_buff1~0_473) (= v_~y$w_buff1_used~0_650 (ite .cse0 v_~y$w_buff1_used~0_651 (ite (or .cse3 .cse7 .cse8) v_~y$w_buff1_used~0_651 0))) (= (ite .cse5 1 (ite .cse6 v_~y$w_buff0~0_536 v_~y$w_buff1~0_474)) v_~__unbuffered_p1_EAX~0_122) (= 2 v_~x~0_115) (= (ite .cse0 v_~y$r_buff0_thd2~0_354 (ite (or .cse3 (and .cse4 .cse9) .cse8) v_~y$r_buff0_thd2~0_354 (ite (and .cse10 (not .cse3)) 0 v_~y$r_buff0_thd2~0_354))) v_~y$r_buff0_thd2~0_353) (= v_~y$flush_delayed~0_215 0))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_365, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_719, ~y$w_buff1~0=v_~y$w_buff1~0_474, ~y$w_buff0~0=v_~y$w_buff0~0_536, P1Thread1of1ForFork1_#t~nondet4=|v_P1Thread1of1ForFork1_#t~nondet4_84|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_354, P1Thread1of1ForFork1_#t~nondet3=|v_P1Thread1of1ForFork1_#t~nondet3_82|, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_19|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_19|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_651} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_718, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_19, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_364, ~weak$$choice0~0=v_~weak$$choice0~0_153, ~y$mem_tmp~0=v_~y$mem_tmp~0_196, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_122, ~y$w_buff1~0=v_~y$w_buff1~0_473, ~y$w_buff0~0=v_~y$w_buff0~0_535, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_353, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_19|, ~y$flush_delayed~0=v_~y$flush_delayed~0_215, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_19|, ~y~0=v_~y~0_612, ~weak$$choice2~0=v_~weak$$choice2~0_220, ~x~0=v_~x~0_115, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_650} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#t~nondet4, P1Thread1of1ForFork1_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, P1Thread1of1ForFork1_~arg.offset, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~x~0, ~y$w_buff1_used~0] [2022-12-05 23:07:41,677 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 23:07:41,678 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 844 [2022-12-05 23:07:41,678 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 24 transitions, 217 flow [2022-12-05 23:07:41,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:41,678 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:07:41,678 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:07:41,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 23:07:41,678 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:07:41,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:07:41,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1198243927, now seen corresponding path program 1 times [2022-12-05 23:07:41,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:07:41,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002702965] [2022-12-05 23:07:41,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:07:41,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:07:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:07:42,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-05 23:07:42,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:07:42,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002702965] [2022-12-05 23:07:42,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002702965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:07:42,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:07:42,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 23:07:42,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826726537] [2022-12-05 23:07:42,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:07:42,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 23:07:42,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:07:42,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 23:07:42,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-05 23:07:42,674 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 23:07:42,674 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 24 transitions, 217 flow. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:42,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:07:42,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 23:07:42,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:07:42,941 INFO L130 PetriNetUnfolder]: 61/159 cut-off events. [2022-12-05 23:07:42,941 INFO L131 PetriNetUnfolder]: For 752/752 co-relation queries the response was YES. [2022-12-05 23:07:42,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 159 events. 61/159 cut-off events. For 752/752 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 650 event pairs, 12 based on Foata normal form. 9/168 useless extension candidates. Maximal degree in co-relation 700. Up to 75 conditions per place. [2022-12-05 23:07:42,942 INFO L137 encePairwiseOnDemand]: 8/17 looper letters, 16 selfloop transitions, 4 changer transitions 26/46 dead transitions. [2022-12-05 23:07:42,942 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 46 transitions, 419 flow [2022-12-05 23:07:42,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 23:07:42,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 23:07:42,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-12-05 23:07:42,945 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33613445378151263 [2022-12-05 23:07:42,945 INFO L175 Difference]: Start difference. First operand has 46 places, 24 transitions, 217 flow. Second operand 7 states and 40 transitions. [2022-12-05 23:07:42,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 46 transitions, 419 flow [2022-12-05 23:07:42,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 46 transitions, 361 flow, removed 11 selfloop flow, removed 11 redundant places. [2022-12-05 23:07:42,947 INFO L231 Difference]: Finished difference. Result has 44 places, 17 transitions, 125 flow [2022-12-05 23:07:42,947 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=125, PETRI_PLACES=44, PETRI_TRANSITIONS=17} [2022-12-05 23:07:42,948 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 15 predicate places. [2022-12-05 23:07:42,948 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:07:42,948 INFO L89 Accepts]: Start accepts. Operand has 44 places, 17 transitions, 125 flow [2022-12-05 23:07:42,948 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:07:42,948 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:42,949 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 17 transitions, 125 flow [2022-12-05 23:07:42,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 17 transitions, 125 flow [2022-12-05 23:07:42,954 INFO L130 PetriNetUnfolder]: 7/35 cut-off events. [2022-12-05 23:07:42,954 INFO L131 PetriNetUnfolder]: For 113/115 co-relation queries the response was YES. [2022-12-05 23:07:42,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 35 events. 7/35 cut-off events. For 113/115 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 74 event pairs, 3 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 134. Up to 19 conditions per place. [2022-12-05 23:07:42,954 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 17 transitions, 125 flow [2022-12-05 23:07:42,954 INFO L188 LiptonReduction]: Number of co-enabled transitions 16 [2022-12-05 23:07:44,013 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [467] $Ultimate##0-->L802: Formula: (let ((.cse18 (= (mod v_~y$w_buff0_used~0_740 256) 0)) (.cse22 (= 0 (mod v_~y$r_buff0_thd2~0_367 256)))) (let ((.cse24 (and .cse18 .cse22))) (let ((.cse20 (not (= (mod |v_P1Thread1of1ForFork1_#t~nondet4_92| 256) 0))) (.cse1 (or .cse24 .cse22)) (.cse2 (not .cse22))) (let ((.cse12 (ite .cse20 1 (ite .cse1 1 (ite .cse2 0 1))))) (let ((.cse21 (= (mod .cse12 256) 0))) (let ((.cse4 (ite .cse20 v_~y$w_buff0_used~0_740 (ite (or .cse24 .cse21 .cse22) v_~y$w_buff0_used~0_740 0)))) (let ((.cse23 (= (mod .cse4 256) 0)) (.cse19 (not .cse21))) (let ((.cse15 (ite .cse20 v_~y$r_buff0_thd2~0_367 (ite (or .cse21 (and .cse23 .cse22) .cse22) v_~y$r_buff0_thd2~0_367 (ite (and .cse2 .cse19) 0 v_~y$r_buff0_thd2~0_367))))) (let ((.cse16 (= (mod .cse15 256) 0))) (let ((.cse6 (and .cse16 .cse23))) (let ((.cse8 (ite .cse20 v_~y$r_buff0_thd2~0_367 (ite (or .cse21 (and .cse16 .cse22) .cse6) v_~y$r_buff0_thd2~0_367 0)))) (let ((.cse9 (= (mod .cse8 256) 0))) (let ((.cse17 (not .cse16)) (.cse5 (and .cse16 .cse9))) (let ((.cse0 (not (= (mod v_~weak$$choice2~0_224 256) 0))) (.cse11 (= (mod v_~y$w_buff1_used~0_664 256) 0)) (.cse7 (= (mod v_~y$w_buff0_used~0_738 256) 0)) (.cse13 (or .cse21 .cse5 .cse6)) (.cse3 (ite .cse20 1 v_~__unbuffered_p1_EAX~0_126)) (.cse14 (and .cse17 .cse19))) (and (= v_~y~0_618 (ite .cse0 v_~y$mem_tmp~0_200 v_~__unbuffered_p1_EBX~0_103)) (= v_~__unbuffered_p1_EAX~0_126 (ite .cse1 1 (ite .cse2 v_~y$w_buff0~0_553 v_~y$w_buff0~0_555))) (= v_~y$r_buff0_thd1~0_229 v_~y$r_buff1_thd1~0_150) (= v_~y$r_buff0_thd0~0_328 v_~y$r_buff1_thd0~0_330) (= |v_P1Thread1of1ForFork1_#in~arg.offset_25| v_P1Thread1of1ForFork1_~arg.offset_25) (= |v_P0Thread1of1ForFork0_~arg#1.base_86| |v_P0Thread1of1ForFork0_#in~arg#1.base_86|) (= v_~y$mem_tmp~0_200 .cse3) (= (ite .cse0 .cse4 (ite (or .cse5 .cse6 .cse7) .cse4 0)) v_~y$w_buff1_used~0_664) (= (ite .cse0 .cse8 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd2~0_365 256) 0))) (or (and .cse9 .cse10) (and .cse11 .cse10) .cse7)) .cse8 0)) v_~y$r_buff1_thd2~0_376) (= v_~y$w_buff0_used~0_738 (ite .cse0 .cse12 (ite .cse13 .cse12 (ite .cse14 0 .cse12)))) (= v_~y$r_buff0_thd2~0_365 (ite .cse0 .cse15 (ite (or (and .cse16 .cse11) .cse5 .cse7) .cse15 (ite (and (not .cse7) .cse17) 0 .cse15)))) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_96| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_96|) (= v_~y$r_buff0_thd1~0_228 1) (= 2 v_~y$w_buff0~0_553) (= v_~weak$$choice2~0_224 |v_P1Thread1of1ForFork1_#t~nondet6_58|) (= v_~__unbuffered_p1_EBX~0_103 (ite .cse13 .cse3 (ite .cse14 v_~y$w_buff0~0_553 v_~y$w_buff0~0_555))) (= v_~y$flush_delayed~0_219 0) (= v_~y$w_buff1~0_485 v_~y$w_buff0~0_555) (= v_~weak$$choice0~0_157 |v_P1Thread1of1ForFork1_#t~nondet5_58|) (= (ite .cse18 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_96|) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_96| 0)) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_86| |v_P0Thread1of1ForFork0_~arg#1.offset_86|) (= v_P1Thread1of1ForFork1_~arg.base_25 |v_P1Thread1of1ForFork1_#in~arg.base_25|) (= 2 v_~x~0_127)))))))))))))))) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_86|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_740, P1Thread1of1ForFork1_#t~nondet6=|v_P1Thread1of1ForFork1_#t~nondet6_58|, P1Thread1of1ForFork1_#t~nondet5=|v_P1Thread1of1ForFork1_#t~nondet5_58|, P1Thread1of1ForFork1_#t~nondet4=|v_P1Thread1of1ForFork1_#t~nondet4_92|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_86|, ~y$w_buff0~0=v_~y$w_buff0~0_555, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_328, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_367, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_25|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_229, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_25|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_738, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_86|, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_86|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_150, ~y$mem_tmp~0=v_~y$mem_tmp~0_200, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_126, ~y$w_buff0~0=v_~y$w_buff0~0_553, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_25|, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_96|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_228, ~y$flush_delayed~0=v_~y$flush_delayed~0_219, ~y~0=v_~y~0_618, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_96|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_103, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_86|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_25, P1Thread1of1ForFork1_#t~nondet3=|v_P1Thread1of1ForFork1_#t~nondet3_89|, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_86|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_376, ~weak$$choice0~0=v_~weak$$choice0~0_157, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_25, ~y$w_buff1~0=v_~y$w_buff1~0_485, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_328, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_365, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_25|, ~weak$$choice2~0=v_~weak$$choice2~0_224, ~x~0=v_~x~0_127, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_330, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_664} AuxVars[] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork0_~arg#1.offset, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~y~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_#t~nondet6, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#t~nondet5, P1Thread1of1ForFork1_#t~nondet4, P1Thread1of1ForFork1_#t~nondet3, P0Thread1of1ForFork0_~arg#1.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff1~0, ~y$r_buff0_thd2~0, ~weak$$choice2~0, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [343] L750-->L757: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_155 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd1~0_16 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_25 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff0_used~0_156 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_157 256) 0)) .cse1)) (.cse3 (and .cse2 .cse5))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_156) v_~y$w_buff0_used~0_155) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_156 256) 0)) .cse1) (and .cse2 (not (= (mod v_~y$r_buff0_thd1~0_24 256) 0)))) 0 v_~y$r_buff1_thd1~0_16) v_~y$r_buff1_thd1~0_15) (= v_~y$r_buff0_thd1~0_24 (ite .cse3 0 v_~y$r_buff0_thd1~0_25)) (= v_~y~0_145 (ite .cse0 v_~y$w_buff0~0_94 (ite .cse4 v_~y$w_buff1~0_83 v_~y~0_146))) (= (ite (or .cse4 .cse3) 0 v_~y$w_buff1_used~0_157) v_~y$w_buff1_used~0_156)))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_156, ~y$w_buff1~0=v_~y$w_buff1~0_83, ~y$w_buff0~0=v_~y$w_buff0~0_94, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_25, ~y~0=v_~y~0_146, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_157} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_155, ~y$w_buff1~0=v_~y$w_buff1~0_83, ~y$w_buff0~0=v_~y$w_buff0~0_94, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_24, ~y~0=v_~y~0_145, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_156} 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-05 23:07:44,534 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:07:44,535 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1587 [2022-12-05 23:07:44,535 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 15 transitions, 119 flow [2022-12-05 23:07:44,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:44,535 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:07:44,535 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:07:44,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 23:07:44,536 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:07:44,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:07:44,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1802107426, now seen corresponding path program 1 times [2022-12-05 23:07:44,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:07:44,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246134021] [2022-12-05 23:07:44,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:07:44,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:07:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:07:44,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:07:44,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:07:44,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246134021] [2022-12-05 23:07:44,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246134021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:07:44,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:07:44,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:07:44,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409039481] [2022-12-05 23:07:44,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:07:44,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:07:44,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:07:44,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:07:44,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:07:44,657 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-05 23:07:44,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 15 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:07:44,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:07:44,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-05 23:07:44,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:07:44,700 INFO L130 PetriNetUnfolder]: 7/27 cut-off events. [2022-12-05 23:07:44,700 INFO L131 PetriNetUnfolder]: For 88/88 co-relation queries the response was YES. [2022-12-05 23:07:44,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 27 events. 7/27 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 38 event pairs, 0 based on Foata normal form. 5/31 useless extension candidates. Maximal degree in co-relation 116. Up to 12 conditions per place. [2022-12-05 23:07:44,701 INFO L137 encePairwiseOnDemand]: 8/13 looper letters, 11 selfloop transitions, 6 changer transitions 1/18 dead transitions. [2022-12-05 23:07:44,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 18 transitions, 176 flow [2022-12-05 23:07:44,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:07:44,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:07:44,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-12-05 23:07:44,702 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3076923076923077 [2022-12-05 23:07:44,702 INFO L175 Difference]: Start difference. First operand has 36 places, 15 transitions, 119 flow. Second operand 5 states and 20 transitions. [2022-12-05 23:07:44,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 18 transitions, 176 flow [2022-12-05 23:07:44,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 18 transitions, 100 flow, removed 25 selfloop flow, removed 14 redundant places. [2022-12-05 23:07:44,703 INFO L231 Difference]: Finished difference. Result has 28 places, 15 transitions, 80 flow [2022-12-05 23:07:44,703 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=28, PETRI_TRANSITIONS=15} [2022-12-05 23:07:44,703 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -1 predicate places. [2022-12-05 23:07:44,703 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:07:44,703 INFO L89 Accepts]: Start accepts. Operand has 28 places, 15 transitions, 80 flow [2022-12-05 23:07:44,704 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:07:44,704 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:44,704 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 15 transitions, 80 flow [2022-12-05 23:07:44,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 15 transitions, 80 flow [2022-12-05 23:07:44,707 INFO L130 PetriNetUnfolder]: 2/16 cut-off events. [2022-12-05 23:07:44,707 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-05 23:07:44,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 16 events. 2/16 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 43. Up to 7 conditions per place. [2022-12-05 23:07:44,707 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 15 transitions, 80 flow [2022-12-05 23:07:44,707 INFO L188 LiptonReduction]: Number of co-enabled transitions 4 [2022-12-05 23:07:45,285 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [469] $Ultimate##0-->L757: Formula: (let ((.cse13 (= (mod v_~y$w_buff0_used~0_752 256) 0)) (.cse28 (= (mod v_~y$r_buff0_thd2~0_378 256) 0))) (let ((.cse30 (and .cse13 .cse28))) (let ((.cse22 (not (= (mod |v_P1Thread1of1ForFork1_#t~nondet4_100| 256) 0))) (.cse14 (or .cse30 .cse28)) (.cse15 (not .cse28))) (let ((.cse25 (ite .cse22 1 (ite .cse14 1 (ite .cse15 0 1))))) (let ((.cse27 (= (mod .cse25 256) 0))) (let ((.cse23 (ite .cse22 v_~y$w_buff0_used~0_752 (ite (or .cse27 .cse30 .cse28) v_~y$w_buff0_used~0_752 0)))) (let ((.cse29 (= (mod .cse23 256) 0)) (.cse26 (not .cse27))) (let ((.cse17 (ite .cse22 v_~y$r_buff0_thd2~0_378 (ite (or .cse27 (and .cse28 .cse29) .cse28) v_~y$r_buff0_thd2~0_378 (ite (and .cse15 .cse26) 0 v_~y$r_buff0_thd2~0_378))))) (let ((.cse18 (= (mod .cse17 256) 0))) (let ((.cse24 (and .cse29 .cse18))) (let ((.cse8 (ite .cse22 v_~y$r_buff0_thd2~0_378 (ite (or .cse27 (and .cse28 .cse18) .cse24) v_~y$r_buff0_thd2~0_378 0)))) (let ((.cse12 (= (mod .cse8 256) 0))) (let ((.cse20 (not .cse18)) (.cse19 (and .cse12 .cse18))) (let ((.cse7 (not (= (mod v_~weak$$choice2~0_230 256) 0))) (.cse4 (or .cse27 .cse19 .cse24)) (.cse6 (and .cse20 .cse26))) (let ((.cse21 (ite .cse7 .cse25 (ite .cse4 .cse25 (ite .cse6 0 .cse25))))) (let ((.cse11 (= (mod .cse21 256) 0))) (let ((.cse2 (ite .cse7 .cse23 (ite (or .cse19 .cse11 .cse24) .cse23 0)))) (let ((.cse9 (= (mod .cse2 256) 0)) (.cse3 (not (= (mod v_~y$r_buff0_thd1~0_238 256) 0)))) (let ((.cse1 (and (not .cse9) .cse3)) (.cse0 (not (= (mod v_~y$w_buff0_used~0_750 256) 0))) (.cse16 (not .cse11)) (.cse5 (ite .cse22 1 v_~__unbuffered_p1_EAX~0_130))) (and (= |v_P0Thread1of1ForFork0_~arg#1.base_90| |v_P0Thread1of1ForFork0_#in~arg#1.base_90|) (= v_~y$w_buff1_used~0_672 (ite (or .cse0 .cse1) 0 .cse2)) (= v_~y$r_buff0_thd0~0_332 v_~y$r_buff1_thd0~0_334) (= v_P1Thread1of1ForFork1_~arg.base_29 |v_P1Thread1of1ForFork1_#in~arg.base_29|) (= v_~y$r_buff1_thd1~0_154 (ite (or (and (not (= 0 (mod v_~y$w_buff1_used~0_672 256))) .cse3) (and .cse0 (not (= (mod v_~y$r_buff0_thd1~0_236 256) 0)))) 0 v_~y$r_buff0_thd1~0_238)) (= 2 v_~x~0_131) (= (ite .cse4 .cse5 (ite .cse6 v_~y$w_buff0~0_563 v_~y$w_buff0~0_564)) v_~__unbuffered_p1_EBX~0_107) (= (ite .cse7 .cse8 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd2~0_377 256) 0))) (or (and .cse9 .cse10) .cse11 (and .cse12 .cse10))) .cse8 0)) v_~y$r_buff1_thd2~0_384) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_100| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_100|) (= v_~y$flush_delayed~0_225 0) (= (ite .cse13 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_100|) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_90| |v_P0Thread1of1ForFork0_~arg#1.offset_90|) (= v_~__unbuffered_p1_EAX~0_130 (ite .cse14 1 (ite .cse15 v_~y$w_buff0~0_563 v_~y$w_buff0~0_564))) (= v_~weak$$choice2~0_230 |v_P1Thread1of1ForFork1_#t~nondet6_66|) (= v_~y$w_buff1~0_491 v_~y$w_buff0~0_564) (= v_~y~0_626 (ite .cse16 v_~y$w_buff0~0_563 (ite .cse1 v_~y$w_buff1~0_491 (ite .cse7 v_~y$mem_tmp~0_206 v_~__unbuffered_p1_EBX~0_107)))) (= v_~y$r_buff0_thd1~0_236 (ite .cse0 0 1)) (= v_~weak$$choice0~0_163 |v_P1Thread1of1ForFork1_#t~nondet5_66|) (= v_~y$r_buff0_thd2~0_377 (ite .cse7 .cse17 (ite (or (and .cse9 .cse18) .cse19 .cse11) .cse17 (ite (and .cse20 .cse16) 0 .cse17)))) (= v_~y$w_buff0_used~0_750 (ite .cse16 0 .cse21)) (= .cse5 v_~y$mem_tmp~0_206) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_100| 0)) (= 2 v_~y$w_buff0~0_563) (= |v_P1Thread1of1ForFork1_#in~arg.offset_29| v_P1Thread1of1ForFork1_~arg.offset_29))))))))))))))))))))) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_90|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_752, P1Thread1of1ForFork1_#t~nondet6=|v_P1Thread1of1ForFork1_#t~nondet6_66|, P1Thread1of1ForFork1_#t~nondet5=|v_P1Thread1of1ForFork1_#t~nondet5_66|, ~y$w_buff0~0=v_~y$w_buff0~0_564, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_332, P1Thread1of1ForFork1_#t~nondet4=|v_P1Thread1of1ForFork1_#t~nondet4_100|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_238, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_29|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_378, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_90|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_29|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_750, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_90|, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_90|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_154, ~y$mem_tmp~0=v_~y$mem_tmp~0_206, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_130, ~y$w_buff0~0=v_~y$w_buff0~0_563, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_236, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_29|, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_100|, ~y$flush_delayed~0=v_~y$flush_delayed~0_225, ~y~0=v_~y~0_626, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_100|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_107, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_90|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_29, P1Thread1of1ForFork1_#t~nondet3=|v_P1Thread1of1ForFork1_#t~nondet3_95|, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_90|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_384, ~weak$$choice0~0=v_~weak$$choice0~0_163, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_29, ~y$w_buff1~0=v_~y$w_buff1~0_491, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_332, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_377, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_29|, ~weak$$choice2~0=v_~weak$$choice2~0_230, ~x~0=v_~x~0_131, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_334, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_672} AuxVars[] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork0_~arg#1.offset, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$flush_delayed~0, ~y~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_#t~nondet6, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#t~nondet5, P1Thread1of1ForFork1_#t~nondet4, P1Thread1of1ForFork1_#t~nondet3, P0Thread1of1ForFork0_~arg#1.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff1~0, ~y$r_buff0_thd2~0, ~weak$$choice2~0, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [352] L802-->L809: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_175 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd2~0_94 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_96 256) 0)))) (let ((.cse4 (and (not (= (mod v_~y$w_buff0_used~0_176 256) 0)) .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff1_used~0_177 256) 0)) .cse2)) (.cse1 (and .cse3 .cse5))) (and (= v_~y$w_buff1_used~0_176 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_177)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_176 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_95 256) 0)))) 0 v_~y$r_buff1_thd2~0_94) v_~y$r_buff1_thd2~0_93) (= (ite .cse4 0 v_~y$w_buff0_used~0_176) v_~y$w_buff0_used~0_175) (= v_~y~0_167 (ite .cse4 v_~y$w_buff0~0_108 (ite .cse0 v_~y$w_buff1~0_97 v_~y~0_168))) (= (ite .cse1 0 v_~y$r_buff0_thd2~0_96) v_~y$r_buff0_thd2~0_95)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_94, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_176, ~y$w_buff1~0=v_~y$w_buff1~0_97, ~y$w_buff0~0=v_~y$w_buff0~0_108, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_96, ~y~0=v_~y~0_168, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_177} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_93, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_175, ~y$w_buff1~0=v_~y$w_buff1~0_97, ~y$w_buff0~0=v_~y$w_buff0~0_108, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_95, ~y~0=v_~y~0_167, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_176} 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-05 23:07:46,039 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [432] L757-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= |v_P0Thread1of1ForFork0_#res#1.base_9| 0) (= |v_P0Thread1of1ForFork0_#res#1.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P0Thread1of1ForFork0_#res#1.offset=|v_P0Thread1of1ForFork0_#res#1.offset_9|, P0Thread1of1ForFork0_#res#1.base=|v_P0Thread1of1ForFork0_#res#1.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res#1.offset, P0Thread1of1ForFork0_#res#1.base, ~__unbuffered_cnt~0] and [410] L829-3-->L832: Formula: (= (ite (= (ite (= 2 v_~__unbuffered_cnt~0_27) 1 0) 0) 0 1) v_~main$tmp_guard0~0_16) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_9|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0] [2022-12-05 23:07:46,059 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [386] L809-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.offset_7| 0) (= |v_P1Thread1of1ForFork1_#res.base_7| 0) (= v_~__unbuffered_cnt~0_21 (+ v_~__unbuffered_cnt~0_22 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] and [410] L829-3-->L832: Formula: (= (ite (= (ite (= 2 v_~__unbuffered_cnt~0_27) 1 0) 0) 0 1) v_~main$tmp_guard0~0_16) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_9|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0] [2022-12-05 23:08:27,258 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [468] $Ultimate##0-->L809: Formula: (let ((.cse15 (= (mod v_~y$w_buff0_used~0_746 256) 0)) (.cse33 (= (mod v_~y$r_buff0_thd2~0_373 256) 0))) (let ((.cse35 (and .cse15 .cse33))) (let ((.cse17 (not (= (mod |v_P1Thread1of1ForFork1_#t~nondet4_96| 256) 0))) (.cse5 (or .cse35 .cse33)) (.cse6 (not .cse33))) (let ((.cse30 (ite .cse17 1 (ite .cse5 1 (ite .cse6 0 1))))) (let ((.cse32 (= (mod .cse30 256) 0))) (let ((.cse28 (ite .cse17 v_~y$w_buff0_used~0_746 (ite (or .cse32 .cse35 .cse33) v_~y$w_buff0_used~0_746 0)))) (let ((.cse34 (= (mod .cse28 256) 0)) (.cse31 (not .cse32))) (let ((.cse24 (ite .cse17 v_~y$r_buff0_thd2~0_373 (ite (or .cse32 (and .cse34 .cse33) .cse33) v_~y$r_buff0_thd2~0_373 (ite (and .cse6 .cse31) 0 v_~y$r_buff0_thd2~0_373))))) (let ((.cse26 (= (mod .cse24 256) 0))) (let ((.cse29 (and .cse34 .cse26))) (let ((.cse21 (ite .cse17 v_~y$r_buff0_thd2~0_373 (ite (or .cse32 .cse29 (and .cse26 .cse33)) v_~y$r_buff0_thd2~0_373 0)))) (let ((.cse23 (= (mod .cse21 256) 0))) (let ((.cse27 (not .cse26)) (.cse25 (and .cse23 .cse26))) (let ((.cse4 (not (= (mod v_~weak$$choice2~0_228 256) 0))) (.cse8 (or .cse32 .cse29 .cse25)) (.cse10 (and .cse31 .cse27))) (let ((.cse7 (ite .cse4 .cse30 (ite .cse8 .cse30 (ite .cse10 0 .cse30))))) (let ((.cse22 (= (mod .cse7 256) 0))) (let ((.cse2 (ite .cse4 .cse28 (ite (or .cse29 .cse25 .cse22) .cse28 0)))) (let ((.cse19 (= (mod .cse2 256) 0)) (.cse18 (not .cse22))) (let ((.cse11 (ite .cse4 .cse24 (ite (or .cse25 .cse22 (and .cse26 .cse19)) .cse24 (ite (and .cse18 .cse27) 0 .cse24))))) (let ((.cse20 (= (mod .cse11 256) 0))) (let ((.cse14 (ite .cse4 .cse21 (ite (or (and .cse20 .cse19) .cse22 (and .cse23 .cse20)) .cse21 0)))) (let ((.cse12 (not (= (mod v_~y$w_buff0_used~0_744 256) 0))) (.cse16 (not .cse20)) (.cse13 (not (= (mod .cse14 256) 0)))) (let ((.cse1 (and (not .cse19) .cse13)) (.cse3 (and .cse18 .cse16)) (.cse9 (ite .cse17 1 v_~__unbuffered_p1_EAX~0_128)) (.cse0 (and .cse12 .cse16))) (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_27| v_P1Thread1of1ForFork1_~arg.offset_27) (= v_~y$w_buff1~0_489 v_~y$w_buff0~0_560) (= v_~y$r_buff0_thd0~0_330 v_~y$r_buff1_thd0~0_332) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_88| |v_P0Thread1of1ForFork0_~arg#1.offset_88|) (= |v_P0Thread1of1ForFork0_~arg#1.base_88| |v_P0Thread1of1ForFork0_#in~arg#1.base_88|) (= 2 v_~y$w_buff0~0_559) (= v_~y$w_buff1_used~0_668 (ite (or .cse0 .cse1) 0 .cse2)) (= v_~y~0_622 (ite .cse3 v_~y$w_buff0~0_559 (ite .cse1 v_~y$w_buff1~0_489 (ite .cse4 v_~y$mem_tmp~0_204 v_~__unbuffered_p1_EBX~0_105)))) (= v_~__unbuffered_p1_EAX~0_128 (ite .cse5 1 (ite .cse6 v_~y$w_buff0~0_559 v_~y$w_buff0~0_560))) (= 2 v_~x~0_129) (= v_~y$w_buff0_used~0_744 (ite .cse3 0 .cse7)) (= v_~y$flush_delayed~0_223 0) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_98| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_98|) (= v_P1Thread1of1ForFork1_~arg.base_27 |v_P1Thread1of1ForFork1_#in~arg.base_27|) (= (ite .cse8 .cse9 (ite .cse10 v_~y$w_buff0~0_559 v_~y$w_buff0~0_560)) v_~__unbuffered_p1_EBX~0_105) (= v_~weak$$choice2~0_228 |v_P1Thread1of1ForFork1_#t~nondet6_62|) (= v_~y$mem_tmp~0_204 .cse9) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_98| 0)) (= v_~weak$$choice0~0_161 |v_P1Thread1of1ForFork1_#t~nondet5_62|) (= v_~y$r_buff0_thd2~0_371 (ite .cse0 0 .cse11)) (= v_~y$r_buff1_thd2~0_380 (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_371 256) 0)) .cse12) (and (not (= (mod v_~y$w_buff1_used~0_668 256) 0)) .cse13)) 0 .cse14)) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_98| (ite .cse15 1 0)) (= v_~y$r_buff0_thd1~0_233 v_~y$r_buff1_thd1~0_152) (= v_~y$r_buff0_thd1~0_232 1))))))))))))))))))))))))) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_88|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_746, P1Thread1of1ForFork1_#t~nondet6=|v_P1Thread1of1ForFork1_#t~nondet6_62|, P1Thread1of1ForFork1_#t~nondet5=|v_P1Thread1of1ForFork1_#t~nondet5_62|, ~y$w_buff0~0=v_~y$w_buff0~0_560, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_330, P1Thread1of1ForFork1_#t~nondet4=|v_P1Thread1of1ForFork1_#t~nondet4_96|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_373, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_27|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_233, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_88|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_27|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_744, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_88|, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_88|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_152, ~y$mem_tmp~0=v_~y$mem_tmp~0_204, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_128, ~y$w_buff0~0=v_~y$w_buff0~0_559, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_27|, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_98|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_232, ~y$flush_delayed~0=v_~y$flush_delayed~0_223, ~y~0=v_~y~0_622, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_98|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_105, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_88|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_27, P1Thread1of1ForFork1_#t~nondet3=|v_P1Thread1of1ForFork1_#t~nondet3_93|, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_88|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_380, ~weak$$choice0~0=v_~weak$$choice0~0_161, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_27, ~y$w_buff1~0=v_~y$w_buff1~0_489, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_330, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_371, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_27|, ~weak$$choice2~0=v_~weak$$choice2~0_228, ~x~0=v_~x~0_129, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_332, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_668} AuxVars[] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork0_~arg#1.offset, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~y~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_#t~nondet6, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#t~nondet5, P1Thread1of1ForFork1_#t~nondet4, P1Thread1of1ForFork1_#t~nondet3, P0Thread1of1ForFork0_~arg#1.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff1~0, ~y$r_buff0_thd2~0, ~weak$$choice2~0, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [343] L750-->L757: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_155 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd1~0_16 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_25 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff0_used~0_156 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_157 256) 0)) .cse1)) (.cse3 (and .cse2 .cse5))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_156) v_~y$w_buff0_used~0_155) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_156 256) 0)) .cse1) (and .cse2 (not (= (mod v_~y$r_buff0_thd1~0_24 256) 0)))) 0 v_~y$r_buff1_thd1~0_16) v_~y$r_buff1_thd1~0_15) (= v_~y$r_buff0_thd1~0_24 (ite .cse3 0 v_~y$r_buff0_thd1~0_25)) (= v_~y~0_145 (ite .cse0 v_~y$w_buff0~0_94 (ite .cse4 v_~y$w_buff1~0_83 v_~y~0_146))) (= (ite (or .cse4 .cse3) 0 v_~y$w_buff1_used~0_157) v_~y$w_buff1_used~0_156)))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_156, ~y$w_buff1~0=v_~y$w_buff1~0_83, ~y$w_buff0~0=v_~y$w_buff0~0_94, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_25, ~y~0=v_~y~0_146, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_157} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_155, ~y$w_buff1~0=v_~y$w_buff1~0_83, ~y$w_buff0~0=v_~y$w_buff0~0_94, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_24, ~y~0=v_~y~0_145, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_156} 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-05 23:08:28,060 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-05 23:08:28,060 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43357 [2022-12-05 23:08:28,060 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 10 transitions, 71 flow [2022-12-05 23:08:28,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:28,060 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:28,061 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:28,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 23:08:28,061 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:28,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:28,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1584709824, now seen corresponding path program 1 times [2022-12-05 23:08:28,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:28,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966694836] [2022-12-05 23:08:28,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:28,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:08:28,082 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 23:08:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:08:28,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 23:08:28,117 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 23:08:28,118 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-05 23:08:28,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-05 23:08:28,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-05 23:08:28,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-05 23:08:28,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-05 23:08:28,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-05 23:08:28,119 INFO L458 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:28,123 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:08:28,123 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:08:28,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:08:28 BasicIcfg [2022-12-05 23:08:28,149 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:08:28,150 INFO L158 Benchmark]: Toolchain (without parser) took 65165.98ms. Allocated memory was 220.2MB in the beginning and 808.5MB in the end (delta: 588.3MB). Free memory was 194.7MB in the beginning and 616.8MB in the end (delta: -422.1MB). Peak memory consumption was 166.6MB. Max. memory is 8.0GB. [2022-12-05 23:08:28,150 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 220.2MB. Free memory was 196.8MB in the beginning and 196.7MB in the end (delta: 103.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:08:28,150 INFO L158 Benchmark]: CACSL2BoogieTranslator took 479.38ms. Allocated memory is still 220.2MB. Free memory was 194.7MB in the beginning and 166.8MB in the end (delta: 27.9MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-05 23:08:28,150 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.41ms. Allocated memory is still 220.2MB. Free memory was 166.8MB in the beginning and 164.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:08:28,150 INFO L158 Benchmark]: Boogie Preprocessor took 34.84ms. Allocated memory is still 220.2MB. Free memory was 164.2MB in the beginning and 162.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:08:28,150 INFO L158 Benchmark]: RCFGBuilder took 648.30ms. Allocated memory was 220.2MB in the beginning and 272.6MB in the end (delta: 52.4MB). Free memory was 162.1MB in the beginning and 243.7MB in the end (delta: -81.6MB). Peak memory consumption was 45.1MB. Max. memory is 8.0GB. [2022-12-05 23:08:28,150 INFO L158 Benchmark]: TraceAbstraction took 63954.38ms. Allocated memory was 272.6MB in the beginning and 808.5MB in the end (delta: 535.8MB). Free memory was 243.2MB in the beginning and 616.8MB in the end (delta: -373.6MB). Peak memory consumption was 162.8MB. Max. memory is 8.0GB. [2022-12-05 23:08:28,151 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 220.2MB. Free memory was 196.8MB in the beginning and 196.7MB in the end (delta: 103.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 479.38ms. Allocated memory is still 220.2MB. Free memory was 194.7MB in the beginning and 166.8MB in the end (delta: 27.9MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.41ms. Allocated memory is still 220.2MB. Free memory was 166.8MB in the beginning and 164.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.84ms. Allocated memory is still 220.2MB. Free memory was 164.2MB in the beginning and 162.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 648.30ms. Allocated memory was 220.2MB in the beginning and 272.6MB in the end (delta: 52.4MB). Free memory was 162.1MB in the beginning and 243.7MB in the end (delta: -81.6MB). Peak memory consumption was 45.1MB. Max. memory is 8.0GB. * TraceAbstraction took 63954.38ms. Allocated memory was 272.6MB in the beginning and 808.5MB in the end (delta: 535.8MB). Free memory was 243.2MB in the beginning and 616.8MB in the end (delta: -373.6MB). Peak memory consumption was 162.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 93 PlacesBefore, 29 PlacesAfterwards, 88 TransitionsBefore, 23 TransitionsAfterwards, 1174 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 35 TrivialYvCompositions, 32 ConcurrentYvCompositions, 1 ChoiceCompositions, 69 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 965, independent: 916, independent conditional: 916, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 965, independent: 916, independent conditional: 0, independent unconditional: 916, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 965, independent: 916, independent conditional: 0, independent unconditional: 916, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 965, independent: 916, independent conditional: 0, independent unconditional: 916, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 700, independent: 662, independent conditional: 0, independent unconditional: 662, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 700, independent: 646, independent conditional: 0, independent unconditional: 646, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 54, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 289, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 271, dependent conditional: 0, dependent unconditional: 271, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 965, independent: 254, independent conditional: 0, independent unconditional: 254, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 700, unknown conditional: 0, unknown unconditional: 700] , Statistics on independence cache: Total cache size (in pairs): 1141, Positive cache size: 1103, Positive conditional cache size: 0, Positive unconditional cache size: 1103, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, 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, 24 PlacesBefore, 24 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 57, independent: 37, independent conditional: 10, independent unconditional: 27, dependent: 20, dependent conditional: 10, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 57, independent: 37, independent conditional: 10, independent unconditional: 27, dependent: 20, dependent conditional: 10, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 57, independent: 37, independent conditional: 10, independent unconditional: 27, dependent: 20, dependent conditional: 10, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 48, independent: 33, independent conditional: 8, independent unconditional: 25, dependent: 15, dependent conditional: 9, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 48, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 15, dependent conditional: 9, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 51, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 50, dependent conditional: 42, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 57, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 48, unknown conditional: 17, unknown unconditional: 31] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 33, Positive conditional cache size: 8, Positive unconditional cache size: 25, Negative cache size: 15, Negative conditional cache size: 9, Negative unconditional cache size: 6, 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.6s, 28 PlacesBefore, 27 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 106 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84, independent: 60, independent conditional: 60, 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: 84, independent: 60, independent conditional: 0, independent unconditional: 60, 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: 84, independent: 60, independent conditional: 0, independent unconditional: 60, 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: 84, independent: 60, independent conditional: 0, independent unconditional: 60, 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: 13, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 84, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 54, Positive conditional cache size: 8, Positive unconditional cache size: 46, Negative cache size: 16, Negative conditional cache size: 9, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 29 PlacesBefore, 29 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 54, Positive conditional cache size: 8, Positive unconditional cache size: 46, Negative cache size: 18, Negative conditional cache size: 9, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 31 PlacesBefore, 31 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 19, independent conditional: 10, independent unconditional: 9, dependent: 7, dependent conditional: 2, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 19, independent conditional: 10, independent unconditional: 9, dependent: 7, dependent conditional: 2, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 19, independent conditional: 10, independent unconditional: 9, dependent: 7, dependent conditional: 2, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, independent: 19, independent conditional: 10, independent unconditional: 9, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 54, Positive conditional cache size: 8, Positive unconditional cache size: 46, Negative cache size: 19, Negative conditional cache size: 10, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 52, independent: 39, independent conditional: 17, independent unconditional: 22, dependent: 13, dependent conditional: 4, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 52, independent: 39, independent conditional: 17, independent unconditional: 22, dependent: 13, dependent conditional: 4, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 52, independent: 39, independent conditional: 17, independent unconditional: 22, dependent: 13, dependent conditional: 4, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 52, independent: 38, independent conditional: 17, independent unconditional: 21, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 55, Positive conditional cache size: 8, Positive unconditional cache size: 47, Negative cache size: 21, Negative conditional cache size: 12, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 41 PlacesBefore, 41 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 146, independent: 116, independent conditional: 116, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 146, independent: 116, independent conditional: 46, independent unconditional: 70, dependent: 30, dependent conditional: 2, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 150, independent: 116, independent conditional: 46, independent unconditional: 70, dependent: 34, dependent conditional: 6, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 150, independent: 116, independent conditional: 46, independent unconditional: 70, dependent: 34, dependent conditional: 6, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 150, independent: 114, independent conditional: 46, independent unconditional: 68, dependent: 31, dependent conditional: 3, dependent unconditional: 28, unknown: 5, unknown conditional: 3, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 59, Positive conditional cache size: 8, Positive unconditional cache size: 51, Negative cache size: 24, Negative conditional cache size: 15, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 174 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 187, independent: 162, independent conditional: 162, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 187, independent: 162, independent conditional: 89, independent unconditional: 73, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 187, independent: 162, independent conditional: 83, independent unconditional: 79, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 187, independent: 162, independent conditional: 83, independent unconditional: 79, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 2, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 187, independent: 158, independent conditional: 81, independent unconditional: 77, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 63, Positive conditional cache size: 10, Positive unconditional cache size: 53, Negative cache size: 24, Negative conditional cache size: 15, Negative unconditional cache size: 9, 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.1s, 55 PlacesBefore, 55 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 150 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 206, independent: 178, independent conditional: 178, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 206, independent: 178, independent conditional: 122, independent unconditional: 56, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 206, independent: 178, independent conditional: 88, independent unconditional: 90, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 206, independent: 178, independent conditional: 88, independent unconditional: 90, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 206, independent: 176, independent conditional: 88, independent unconditional: 88, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 65, Positive conditional cache size: 10, Positive unconditional cache size: 55, Negative cache size: 24, Negative conditional cache size: 15, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 34, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 64 PlacesBefore, 65 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 160, independent: 134, independent conditional: 134, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 160, independent: 134, independent conditional: 82, independent unconditional: 52, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 160, independent: 134, independent conditional: 46, independent unconditional: 88, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 160, independent: 134, independent conditional: 46, independent unconditional: 88, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 160, independent: 132, independent conditional: 46, independent unconditional: 86, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 70, Positive conditional cache size: 10, Positive unconditional cache size: 60, Negative cache size: 24, Negative conditional cache size: 15, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 70 PlacesBefore, 69 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 154, independent: 130, independent conditional: 130, 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: 154, independent: 130, independent conditional: 70, independent unconditional: 60, 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: 154, independent: 130, independent conditional: 59, independent unconditional: 71, 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: 154, independent: 130, independent conditional: 59, independent unconditional: 71, 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: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 154, independent: 129, independent conditional: 58, independent unconditional: 71, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 73, Positive conditional cache size: 11, Positive unconditional cache size: 62, Negative cache size: 24, Negative conditional cache size: 15, Negative unconditional cache size: 9, 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.9s, 56 PlacesBefore, 55 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17, independent: 11, independent conditional: 5, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17, independent: 11, independent conditional: 5, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17, independent: 8, independent conditional: 3, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 87, Positive conditional cache size: 13, Positive unconditional cache size: 74, Negative cache size: 25, Negative conditional cache size: 15, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 50 PlacesBefore, 46 PlacesAfterwards, 27 TransitionsBefore, 24 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 39, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 39, independent: 35, independent conditional: 6, independent unconditional: 29, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 39, independent: 35, independent conditional: 6, independent unconditional: 29, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 4, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 39, independent: 25, independent conditional: 2, independent unconditional: 23, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 11, unknown conditional: 4, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 111, Positive conditional cache size: 19, Positive unconditional cache size: 92, Negative cache size: 26, Negative conditional cache size: 15, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 38 PlacesBefore, 36 PlacesAfterwards, 17 TransitionsBefore, 15 TransitionsAfterwards, 16 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 9, dependent conditional: 0, dependent unconditional: 9, 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: 27, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 111, Positive conditional cache size: 19, Positive unconditional cache size: 92, Negative cache size: 26, Negative conditional cache size: 15, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 27, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 43.4s, 28 PlacesBefore, 23 PlacesAfterwards, 15 TransitionsBefore, 10 TransitionsAfterwards, 4 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 130, Positive conditional cache size: 21, Positive unconditional cache size: 109, Negative cache size: 26, Negative conditional cache size: 15, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L826] 0 pthread_t t1585; [L827] FCALL, FORK 0 pthread_create(&t1585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1585, ((void *)0), P0, ((void *)0))=-2, t1585={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] [L828] 0 pthread_t t1586; [L829] FCALL, FORK 0 pthread_create(&t1586, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1586, ((void *)0), P1, ((void *)0))=-1, t1585={5:0}, t1586={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] [L738] 1 y$w_buff1 = y$w_buff0 [L739] 1 y$w_buff0 = 2 [L740] 1 y$w_buff1_used = y$w_buff0_used [L741] 1 y$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L746] 1 y$r_buff0_thd1 = (_Bool)1 [L749] 1 x = 1 [L766] 1 x = 2 [L769] 1 y = 1 [L772] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 1 y$flush_delayed = weak$$choice2 [L775] 1 y$mem_tmp = y [L776] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 1 __unbuffered_p1_EAX = y [L784] 1 y = y$flush_delayed ? y$mem_tmp : y [L785] 1 y$flush_delayed = (_Bool)0 [L788] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 1 y$flush_delayed = weak$$choice2 [L791] 1 y$mem_tmp = y [L792] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L793] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L794] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L795] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L796] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L797] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L798] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L799] 1 __unbuffered_p1_EBX = y [L800] 1 y = y$flush_delayed ? y$mem_tmp : y [L801] 1 y$flush_delayed = (_Bool)0 [L804] 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) [L805] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L806] 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 [L807] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] 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 [L752] 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) [L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] 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 [L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L756] 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 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, 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] [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 2 return 0; [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L831] 1 main$tmp_guard0 = __unbuffered_cnt == 2 [L833] CALL 1 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 1 !(!cond) [L833] RET 1 assume_abort_if_not(main$tmp_guard0) [L835] 1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 1 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 [L838] 1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 1 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 [L842] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L843] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L844] 1 y$flush_delayed = weak$$choice2 [L845] 1 y$mem_tmp = y [L846] 1 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) [L847] 1 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)) [L848] 1 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)) [L849] 1 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)) [L850] 1 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)) [L851] 1 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)) [L852] 1 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)) [L853] 1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L854] 1 y = y$flush_delayed ? y$mem_tmp : y [L855] 1 y$flush_delayed = (_Bool)0 [L857] CALL 1 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 1 !expression [L18] 1 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, 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: 827]: 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: 829]: 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, 110 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: 63.8s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 307 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 307 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 276 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1090 IncrementalHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 276 mSolverCounterUnsat, 14 mSDtfsCounter, 1090 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=673occurred in iteration=7, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 157 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 2183 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 23:08:28,189 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...