/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:29:56,313 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:29:56,315 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:29:56,345 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:29:56,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:29:56,359 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:29:56,361 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:29:56,365 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:29:56,368 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:29:56,372 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:29:56,373 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:29:56,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:29:56,374 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:29:56,376 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:29:56,377 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:29:56,379 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:29:56,380 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:29:56,380 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:29:56,382 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:29:56,385 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:29:56,386 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:29:56,387 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:29:56,387 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:29:56,388 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:29:56,393 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:29:56,393 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:29:56,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:29:56,395 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:29:56,395 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:29:56,395 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:29:56,396 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:29:56,397 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:29:56,398 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:29:56,398 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:29:56,399 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:29:56,399 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:29:56,399 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:29:56,399 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:29:56,400 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:29:56,400 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:29:56,401 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:29:56,403 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 09:29:56,429 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:29:56,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:29:56,431 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:29:56,432 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:29:56,432 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:29:56,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:29:56,432 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:29:56,433 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:29:56,433 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:29:56,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:29:56,433 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:29:56,433 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:29:56,434 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:29:56,434 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:29:56,434 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:29:56,434 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:29:56,434 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:29:56,434 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:29:56,434 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:29:56,434 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:29:56,434 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:29:56,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:29:56,435 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:29:56,435 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:29:56,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:29:56,435 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:29:56,435 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:29:56,435 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:29:56,435 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:29:56,435 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 09:29:56,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:29:56,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:29:56,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:29:56,718 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:29:56,719 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:29:56,720 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_tso.i [2022-12-13 09:29:57,715 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:29:57,961 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:29:57,962 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_tso.i [2022-12-13 09:29:57,978 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59b11c32c/4e6fc70028b74bc09908767ae249a8ab/FLAG7efb62f40 [2022-12-13 09:29:57,989 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59b11c32c/4e6fc70028b74bc09908767ae249a8ab [2022-12-13 09:29:57,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:29:57,991 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:29:57,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:29:57,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:29:57,994 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:29:57,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:29:57" (1/1) ... [2022-12-13 09:29:57,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e7687db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:29:57, skipping insertion in model container [2022-12-13 09:29:57,995 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:29:57" (1/1) ... [2022-12-13 09:29:57,999 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:29:58,030 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:29:58,120 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_tso.i[944,957] [2022-12-13 09:29:58,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:29:58,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:29:58,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:29:58,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:29:58,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:29:58,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:29:58,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:29:58,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:29:58,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:29:58,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:29:58,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:29:58,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:29:58,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:29:58,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:29:58,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:29:58,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:29:58,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:29:58,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:29:58,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:29:58,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:29:58,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:29:58,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:29:58,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:29:58,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:29:58,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:29:58,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:29:58,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:29:58,317 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:29:58,328 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_tso.i[944,957] [2022-12-13 09:29:58,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:29:58,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:29:58,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:29:58,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:29:58,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:29:58,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:29:58,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:29:58,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:29:58,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:29:58,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:29:58,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:29:58,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:29:58,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:29:58,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:29:58,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:29:58,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:29:58,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:29:58,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:29:58,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:29:58,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:29:58,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:29:58,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:29:58,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:29:58,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:29:58,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:29:58,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:29:58,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:29:58,410 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:29:58,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:29:58 WrapperNode [2022-12-13 09:29:58,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:29:58,412 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:29:58,412 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:29:58,412 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:29:58,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:29:58" (1/1) ... [2022-12-13 09:29:58,443 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:29:58" (1/1) ... [2022-12-13 09:29:58,476 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2022-12-13 09:29:58,477 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:29:58,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:29:58,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:29:58,478 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:29:58,484 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:29:58" (1/1) ... [2022-12-13 09:29:58,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:29:58" (1/1) ... [2022-12-13 09:29:58,502 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:29:58" (1/1) ... [2022-12-13 09:29:58,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:29:58" (1/1) ... [2022-12-13 09:29:58,523 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:29:58" (1/1) ... [2022-12-13 09:29:58,525 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:29:58" (1/1) ... [2022-12-13 09:29:58,526 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:29:58" (1/1) ... [2022-12-13 09:29:58,527 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:29:58" (1/1) ... [2022-12-13 09:29:58,529 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:29:58,530 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:29:58,530 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:29:58,530 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:29:58,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:29:58" (1/1) ... [2022-12-13 09:29:58,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:29:58,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:29:58,605 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 09:29:58,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-13 09:29:58,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:29:58,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:29:58,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:29:58,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:29:58,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:29:58,648 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:29:58,648 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:29:58,648 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:29:58,648 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:29:58,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:29:58,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:29:58,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:29:58,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:29:58,650 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 09:29:58,793 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:29:58,795 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:29:59,070 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:29:59,213 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:29:59,214 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:29:59,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:29:59 BoogieIcfgContainer [2022-12-13 09:29:59,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:29:59,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:29:59,218 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:29:59,220 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:29:59,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:29:57" (1/3) ... [2022-12-13 09:29:59,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3b04a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:29:59, skipping insertion in model container [2022-12-13 09:29:59,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:29:58" (2/3) ... [2022-12-13 09:29:59,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3b04a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:29:59, skipping insertion in model container [2022-12-13 09:29:59,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:29:59" (3/3) ... [2022-12-13 09:29:59,224 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_tso.i [2022-12-13 09:29:59,237 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:29:59,237 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 09:29:59,237 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:29:59,284 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:29:59,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 190 flow [2022-12-13 09:29:59,354 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2022-12-13 09:29:59,354 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:29:59,358 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 49 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-13 09:29:59,358 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 90 transitions, 190 flow [2022-12-13 09:29:59,361 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 88 transitions, 182 flow [2022-12-13 09:29:59,363 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:29:59,381 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 88 transitions, 182 flow [2022-12-13 09:29:59,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 88 transitions, 182 flow [2022-12-13 09:29:59,416 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2022-12-13 09:29:59,416 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:29:59,416 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 49 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-13 09:29:59,419 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 88 transitions, 182 flow [2022-12-13 09:29:59,419 INFO L226 LiptonReduction]: Number of co-enabled transitions 1156 [2022-12-13 09:30:05,428 INFO L241 LiptonReduction]: Total number of compositions: 71 [2022-12-13 09:30:05,440 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:30:05,444 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;@56a55419, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:30:05,445 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 09:30:05,448 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-13 09:30:05,448 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:30:05,448 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:05,449 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 09:30:05,449 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:05,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:05,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1458424011, now seen corresponding path program 1 times [2022-12-13 09:30:05,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:05,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166031656] [2022-12-13 09:30:05,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:05,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:05,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:05,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:05,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166031656] [2022-12-13 09:30:05,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166031656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:05,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:05,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:30:05,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561818206] [2022-12-13 09:30:05,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:05,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:30:05,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:05,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:30:05,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:30:05,787 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 46 [2022-12-13 09:30:05,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:05,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:05,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 46 [2022-12-13 09:30:05,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:06,316 INFO L130 PetriNetUnfolder]: 1577/2679 cut-off events. [2022-12-13 09:30:06,316 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 09:30:06,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5243 conditions, 2679 events. 1577/2679 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 16085 event pairs, 311 based on Foata normal form. 0/1564 useless extension candidates. Maximal degree in co-relation 5233. Up to 1987 conditions per place. [2022-12-13 09:30:06,325 INFO L137 encePairwiseOnDemand]: 42/46 looper letters, 23 selfloop transitions, 2 changer transitions 40/71 dead transitions. [2022-12-13 09:30:06,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 278 flow [2022-12-13 09:30:06,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:06,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:30:06,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2022-12-13 09:30:06,334 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6231884057971014 [2022-12-13 09:30:06,335 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 98 flow. Second operand 3 states and 86 transitions. [2022-12-13 09:30:06,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 71 transitions, 278 flow [2022-12-13 09:30:06,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 71 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:30:06,338 INFO L231 Difference]: Finished difference. Result has 51 places, 24 transitions, 56 flow [2022-12-13 09:30:06,339 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=51, PETRI_TRANSITIONS=24} [2022-12-13 09:30:06,342 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2022-12-13 09:30:06,342 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:06,343 INFO L89 Accepts]: Start accepts. Operand has 51 places, 24 transitions, 56 flow [2022-12-13 09:30:06,344 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:06,344 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:06,344 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 24 transitions, 56 flow [2022-12-13 09:30:06,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 56 flow [2022-12-13 09:30:06,348 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-12-13 09:30:06,348 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:30:06,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 44 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-13 09:30:06,350 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 24 transitions, 56 flow [2022-12-13 09:30:06,350 INFO L226 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-13 09:30:06,441 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:30:06,442 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 09:30:06,442 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 56 flow [2022-12-13 09:30:06,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:06,443 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:06,443 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:06,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:30:06,443 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:06,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:06,444 INFO L85 PathProgramCache]: Analyzing trace with hash -2033493015, now seen corresponding path program 1 times [2022-12-13 09:30:06,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:06,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398696552] [2022-12-13 09:30:06,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:06,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:06,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:06,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:06,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398696552] [2022-12-13 09:30:06,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398696552] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:06,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:06,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:30:06,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898507639] [2022-12-13 09:30:06,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:06,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:30:06,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:06,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:30:06,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:30:06,672 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2022-12-13 09:30:06,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:06,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:06,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2022-12-13 09:30:06,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:06,736 INFO L130 PetriNetUnfolder]: 210/392 cut-off events. [2022-12-13 09:30:06,736 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-13 09:30:06,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 392 events. 210/392 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1545 event pairs, 80 based on Foata normal form. 15/355 useless extension candidates. Maximal degree in co-relation 779. Up to 251 conditions per place. [2022-12-13 09:30:06,739 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 22 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2022-12-13 09:30:06,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 116 flow [2022-12-13 09:30:06,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:06,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:30:06,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-13 09:30:06,741 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5972222222222222 [2022-12-13 09:30:06,741 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 56 flow. Second operand 3 states and 43 transitions. [2022-12-13 09:30:06,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 116 flow [2022-12-13 09:30:06,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:30:06,742 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 60 flow [2022-12-13 09:30:06,742 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2022-12-13 09:30:06,743 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -21 predicate places. [2022-12-13 09:30:06,743 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:06,743 INFO L89 Accepts]: Start accepts. Operand has 32 places, 24 transitions, 60 flow [2022-12-13 09:30:06,743 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:06,744 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:06,744 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 24 transitions, 60 flow [2022-12-13 09:30:06,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 24 transitions, 60 flow [2022-12-13 09:30:06,749 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-12-13 09:30:06,749 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:30:06,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 09:30:06,749 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 24 transitions, 60 flow [2022-12-13 09:30:06,749 INFO L226 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-13 09:30:06,770 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:30:06,771 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-13 09:30:06,771 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 60 flow [2022-12-13 09:30:06,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:06,771 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:06,771 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:06,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:30:06,772 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:06,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:06,772 INFO L85 PathProgramCache]: Analyzing trace with hash 751129583, now seen corresponding path program 1 times [2022-12-13 09:30:06,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:06,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324871149] [2022-12-13 09:30:06,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:06,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:07,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:07,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:07,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324871149] [2022-12-13 09:30:07,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324871149] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:07,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:07,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:30:07,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020442174] [2022-12-13 09:30:07,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:07,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:30:07,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:07,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:30:07,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:30:07,633 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2022-12-13 09:30:07,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 60 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:07,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:07,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2022-12-13 09:30:07,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:07,817 INFO L130 PetriNetUnfolder]: 268/493 cut-off events. [2022-12-13 09:30:07,817 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-13 09:30:07,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 493 events. 268/493 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1977 event pairs, 61 based on Foata normal form. 10/445 useless extension candidates. Maximal degree in co-relation 1029. Up to 251 conditions per place. [2022-12-13 09:30:07,819 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 32 selfloop transitions, 11 changer transitions 0/48 dead transitions. [2022-12-13 09:30:07,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 48 transitions, 199 flow [2022-12-13 09:30:07,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:07,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:30:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-12-13 09:30:07,821 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2022-12-13 09:30:07,821 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 60 flow. Second operand 6 states and 75 transitions. [2022-12-13 09:30:07,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 48 transitions, 199 flow [2022-12-13 09:30:07,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 48 transitions, 193 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:30:07,822 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 141 flow [2022-12-13 09:30:07,822 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=141, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2022-12-13 09:30:07,823 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -13 predicate places. [2022-12-13 09:30:07,823 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:07,823 INFO L89 Accepts]: Start accepts. Operand has 40 places, 33 transitions, 141 flow [2022-12-13 09:30:07,824 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:07,824 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:07,824 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 33 transitions, 141 flow [2022-12-13 09:30:07,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 33 transitions, 141 flow [2022-12-13 09:30:07,835 INFO L130 PetriNetUnfolder]: 41/130 cut-off events. [2022-12-13 09:30:07,836 INFO L131 PetriNetUnfolder]: For 57/62 co-relation queries the response was YES. [2022-12-13 09:30:07,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 130 events. 41/130 cut-off events. For 57/62 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 587 event pairs, 16 based on Foata normal form. 1/100 useless extension candidates. Maximal degree in co-relation 288. Up to 58 conditions per place. [2022-12-13 09:30:07,836 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 33 transitions, 141 flow [2022-12-13 09:30:07,837 INFO L226 LiptonReduction]: Number of co-enabled transitions 306 [2022-12-13 09:30:07,958 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L739-->L742: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [396] L2-1-->L840: Formula: (let ((.cse2 (not (= 0 (mod v_~y$r_buff1_thd0~0_92 256)))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_98 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_243 256) 0)))) (let ((.cse0 (and .cse5 .cse1)) (.cse4 (and .cse2 (not (= (mod v_~y$w_buff1_used~0_241 256) 0)))) (.cse3 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_244 256) 0))))) (and (= v_~y$r_buff0_thd0~0_97 (ite .cse0 0 v_~y$r_buff0_thd0~0_98)) (= (ite (or (and .cse1 (not (= (mod v_~y$r_buff0_thd0~0_97 256) 0))) (and .cse2 (not (= (mod v_~y$w_buff1_used~0_240 256) 0)))) 0 v_~y$r_buff1_thd0~0_92) v_~y$r_buff1_thd0~0_91) (= v_~y~0_211 (ite .cse3 v_~y$w_buff0~0_152 (ite .cse4 v_~y$w_buff1~0_131 v_~y~0_212))) (= (ite (or .cse0 .cse4) 0 v_~y$w_buff1_used~0_241) v_~y$w_buff1_used~0_240) (= (ite .cse3 0 v_~y$w_buff0_used~0_244) v_~y$w_buff0_used~0_243)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_244, ~y$w_buff1~0=v_~y$w_buff1~0_131, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_98, ~y$w_buff0~0=v_~y$w_buff0~0_152, ~y~0=v_~y~0_212, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_92, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_241} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_243, ~y$w_buff1~0=v_~y$w_buff1~0_131, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_97, ~y$w_buff0~0=v_~y$w_buff0~0_152, ~y~0=v_~y~0_211, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_91, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_240} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 09:30:08,021 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L739-->L742: 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$r_buff1_thd2~0_96 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_177 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_103 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff0_used~0_178 256) 0)) .cse5)) (.cse4 (and .cse5 .cse2)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_177 256) 0)) .cse3))) (and (= v_~y~0_159 (ite .cse0 v_~y$w_buff0~0_96 (ite .cse1 v_~y$w_buff1~0_87 v_~y~0_160))) (= (ite .cse0 0 v_~y$w_buff0_used~0_178) v_~y$w_buff0_used~0_177) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_102 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_176 256) 0)) .cse3)) 0 v_~y$r_buff1_thd2~0_96) v_~y$r_buff1_thd2~0_95) (= v_~y$r_buff0_thd2~0_102 (ite .cse4 0 v_~y$r_buff0_thd2~0_103)) (= v_~y$w_buff1_used~0_176 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_177))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_96, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_178, ~y$w_buff1~0=v_~y$w_buff1~0_87, ~y$w_buff0~0=v_~y$w_buff0~0_96, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_103, ~y~0=v_~y~0_160, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_177} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_95, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_177, ~y$w_buff1~0=v_~y$w_buff1~0_87, ~y$w_buff0~0=v_~y$w_buff0~0_96, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_102, ~y~0=v_~y~0_159, ~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-13 09:30:08,429 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:30:08,430 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 607 [2022-12-13 09:30:08,430 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 141 flow [2022-12-13 09:30:08,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:08,430 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:08,430 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:08,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:30:08,430 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:08,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:08,431 INFO L85 PathProgramCache]: Analyzing trace with hash 754883280, now seen corresponding path program 1 times [2022-12-13 09:30:08,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:08,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017973390] [2022-12-13 09:30:08,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:08,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:08,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:08,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:08,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017973390] [2022-12-13 09:30:08,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017973390] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:08,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:08,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:30:08,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624466033] [2022-12-13 09:30:08,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:08,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:30:08,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:08,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:30:08,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:30:08,893 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2022-12-13 09:30:08,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 141 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:08,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:08,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2022-12-13 09:30:08,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:09,074 INFO L130 PetriNetUnfolder]: 238/438 cut-off events. [2022-12-13 09:30:09,075 INFO L131 PetriNetUnfolder]: For 438/438 co-relation queries the response was YES. [2022-12-13 09:30:09,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1302 conditions, 438 events. 238/438 cut-off events. For 438/438 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1806 event pairs, 93 based on Foata normal form. 1/384 useless extension candidates. Maximal degree in co-relation 1286. Up to 389 conditions per place. [2022-12-13 09:30:09,077 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 27 selfloop transitions, 11 changer transitions 0/44 dead transitions. [2022-12-13 09:30:09,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 44 transitions, 265 flow [2022-12-13 09:30:09,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:30:09,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:30:09,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-13 09:30:09,081 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2022-12-13 09:30:09,081 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 141 flow. Second operand 5 states and 68 transitions. [2022-12-13 09:30:09,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 44 transitions, 265 flow [2022-12-13 09:30:09,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 257 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 09:30:09,085 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 202 flow [2022-12-13 09:30:09,086 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=202, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2022-12-13 09:30:09,087 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -9 predicate places. [2022-12-13 09:30:09,087 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:09,087 INFO L89 Accepts]: Start accepts. Operand has 44 places, 37 transitions, 202 flow [2022-12-13 09:30:09,088 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:09,088 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:09,088 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 37 transitions, 202 flow [2022-12-13 09:30:09,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 37 transitions, 202 flow [2022-12-13 09:30:09,101 INFO L130 PetriNetUnfolder]: 41/137 cut-off events. [2022-12-13 09:30:09,102 INFO L131 PetriNetUnfolder]: For 142/142 co-relation queries the response was YES. [2022-12-13 09:30:09,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 137 events. 41/137 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 691 event pairs, 9 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 355. Up to 58 conditions per place. [2022-12-13 09:30:09,103 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 37 transitions, 202 flow [2022-12-13 09:30:09,103 INFO L226 LiptonReduction]: Number of co-enabled transitions 316 [2022-12-13 09:30:09,112 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L786-->L802: Formula: (let ((.cse10 (= (mod v_~y$r_buff1_thd2~0_100 256) 0)) (.cse4 (= (mod v_~y$r_buff0_thd2~0_107 256) 0))) (let ((.cse5 (not .cse4)) (.cse11 (= (mod v_~y$w_buff0_used~0_182 256) 0)) (.cse2 (and .cse4 .cse10)) (.cse6 (and (= (mod v_~y$w_buff1_used~0_181 256) 0) .cse4))) (let ((.cse3 (= (mod v_~y$w_buff1_used~0_180 256) 0)) (.cse1 (= (mod v_~y$w_buff0_used~0_181 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_88 256) 0))) (.cse7 (or .cse11 .cse2 .cse6)) (.cse8 (and (not .cse11) .cse5))) (and (= (ite .cse0 v_~y$r_buff0_thd2~0_107 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~y$r_buff0_thd2~0_107 (ite (and (not .cse1) .cse5) 0 v_~y$r_buff0_thd2~0_107))) v_~y$r_buff0_thd2~0_106) (= v_~y$w_buff1_used~0_180 (ite .cse0 v_~y$w_buff1_used~0_181 (ite (or .cse1 .cse2 .cse6) v_~y$w_buff1_used~0_181 0))) (= v_~y$w_buff0_used~0_181 (ite .cse0 v_~y$w_buff0_used~0_182 (ite .cse7 v_~y$w_buff0_used~0_182 (ite .cse8 0 v_~y$w_buff0_used~0_182)))) (= (ite .cse0 v_~y$r_buff1_thd2~0_100 (ite (let ((.cse9 (= (mod v_~y$r_buff0_thd2~0_106 256) 0))) (or (and .cse9 .cse3) .cse1 (and .cse9 .cse10))) v_~y$r_buff1_thd2~0_100 0)) v_~y$r_buff1_thd2~0_99) (= v_~y$w_buff0~0_99 v_~y$w_buff0~0_98) (= v_~y$w_buff1~0_90 v_~y$w_buff1~0_89) (= |v_P1Thread1of1ForFork1_#t~nondet6#1_1| v_~weak$$choice2~0_88) (= v_~y~0_163 (ite .cse0 v_~y$mem_tmp~0_62 v_~__unbuffered_p1_EBX~0_18)) (= 0 v_~y$flush_delayed~0_75) (= v_~__unbuffered_p1_EBX~0_18 (ite .cse7 v_~y~0_165 (ite .cse8 v_~y$w_buff0~0_99 v_~y$w_buff1~0_90))) (= v_~y~0_165 v_~y$mem_tmp~0_62) (= |v_P1Thread1of1ForFork1_#t~nondet5#1_1| v_~weak$$choice0~0_21))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_100, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_182, ~y$w_buff1~0=v_~y$w_buff1~0_90, P1Thread1of1ForFork1_#t~nondet5#1=|v_P1Thread1of1ForFork1_#t~nondet5#1_1|, ~y$w_buff0~0=v_~y$w_buff0~0_99, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P1Thread1of1ForFork1_#t~nondet6#1=|v_P1Thread1of1ForFork1_#t~nondet6#1_1|, ~y~0=v_~y~0_165, ~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_181, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_99, ~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_89, ~y$w_buff0~0=v_~y$w_buff0~0_98, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_106, ~y$flush_delayed~0=v_~y$flush_delayed~0_75, ~y~0=v_~y~0_163, ~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~nondet5#1, P1Thread1of1ForFork1_#t~nondet6#1, ~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] and [396] L2-1-->L840: Formula: (let ((.cse2 (not (= 0 (mod v_~y$r_buff1_thd0~0_92 256)))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_98 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_243 256) 0)))) (let ((.cse0 (and .cse5 .cse1)) (.cse4 (and .cse2 (not (= (mod v_~y$w_buff1_used~0_241 256) 0)))) (.cse3 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_244 256) 0))))) (and (= v_~y$r_buff0_thd0~0_97 (ite .cse0 0 v_~y$r_buff0_thd0~0_98)) (= (ite (or (and .cse1 (not (= (mod v_~y$r_buff0_thd0~0_97 256) 0))) (and .cse2 (not (= (mod v_~y$w_buff1_used~0_240 256) 0)))) 0 v_~y$r_buff1_thd0~0_92) v_~y$r_buff1_thd0~0_91) (= v_~y~0_211 (ite .cse3 v_~y$w_buff0~0_152 (ite .cse4 v_~y$w_buff1~0_131 v_~y~0_212))) (= (ite (or .cse0 .cse4) 0 v_~y$w_buff1_used~0_241) v_~y$w_buff1_used~0_240) (= (ite .cse3 0 v_~y$w_buff0_used~0_244) v_~y$w_buff0_used~0_243)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_244, ~y$w_buff1~0=v_~y$w_buff1~0_131, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_98, ~y$w_buff0~0=v_~y$w_buff0~0_152, ~y~0=v_~y~0_212, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_92, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_241} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_243, ~y$w_buff1~0=v_~y$w_buff1~0_131, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_97, ~y$w_buff0~0=v_~y$w_buff0~0_152, ~y~0=v_~y~0_211, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_91, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_240} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 09:30:09,460 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L786-->L802: Formula: (let ((.cse10 (= (mod v_~y$r_buff1_thd2~0_100 256) 0)) (.cse4 (= (mod v_~y$r_buff0_thd2~0_107 256) 0))) (let ((.cse5 (not .cse4)) (.cse11 (= (mod v_~y$w_buff0_used~0_182 256) 0)) (.cse2 (and .cse4 .cse10)) (.cse6 (and (= (mod v_~y$w_buff1_used~0_181 256) 0) .cse4))) (let ((.cse3 (= (mod v_~y$w_buff1_used~0_180 256) 0)) (.cse1 (= (mod v_~y$w_buff0_used~0_181 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_88 256) 0))) (.cse7 (or .cse11 .cse2 .cse6)) (.cse8 (and (not .cse11) .cse5))) (and (= (ite .cse0 v_~y$r_buff0_thd2~0_107 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~y$r_buff0_thd2~0_107 (ite (and (not .cse1) .cse5) 0 v_~y$r_buff0_thd2~0_107))) v_~y$r_buff0_thd2~0_106) (= v_~y$w_buff1_used~0_180 (ite .cse0 v_~y$w_buff1_used~0_181 (ite (or .cse1 .cse2 .cse6) v_~y$w_buff1_used~0_181 0))) (= v_~y$w_buff0_used~0_181 (ite .cse0 v_~y$w_buff0_used~0_182 (ite .cse7 v_~y$w_buff0_used~0_182 (ite .cse8 0 v_~y$w_buff0_used~0_182)))) (= (ite .cse0 v_~y$r_buff1_thd2~0_100 (ite (let ((.cse9 (= (mod v_~y$r_buff0_thd2~0_106 256) 0))) (or (and .cse9 .cse3) .cse1 (and .cse9 .cse10))) v_~y$r_buff1_thd2~0_100 0)) v_~y$r_buff1_thd2~0_99) (= v_~y$w_buff0~0_99 v_~y$w_buff0~0_98) (= v_~y$w_buff1~0_90 v_~y$w_buff1~0_89) (= |v_P1Thread1of1ForFork1_#t~nondet6#1_1| v_~weak$$choice2~0_88) (= v_~y~0_163 (ite .cse0 v_~y$mem_tmp~0_62 v_~__unbuffered_p1_EBX~0_18)) (= 0 v_~y$flush_delayed~0_75) (= v_~__unbuffered_p1_EBX~0_18 (ite .cse7 v_~y~0_165 (ite .cse8 v_~y$w_buff0~0_99 v_~y$w_buff1~0_90))) (= v_~y~0_165 v_~y$mem_tmp~0_62) (= |v_P1Thread1of1ForFork1_#t~nondet5#1_1| v_~weak$$choice0~0_21))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_100, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_182, ~y$w_buff1~0=v_~y$w_buff1~0_90, P1Thread1of1ForFork1_#t~nondet5#1=|v_P1Thread1of1ForFork1_#t~nondet5#1_1|, ~y$w_buff0~0=v_~y$w_buff0~0_99, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P1Thread1of1ForFork1_#t~nondet6#1=|v_P1Thread1of1ForFork1_#t~nondet6#1_1|, ~y~0=v_~y~0_165, ~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_181, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_99, ~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_89, ~y$w_buff0~0=v_~y$w_buff0~0_98, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_106, ~y$flush_delayed~0=v_~y$flush_delayed~0_75, ~y~0=v_~y~0_163, ~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~nondet5#1, P1Thread1of1ForFork1_#t~nondet6#1, ~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] and [426] $Ultimate##0-->L739: Formula: (and (= v_~y~0_238 2) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~y~0=v_~y~0_238, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-13 09:30:09,822 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:30:09,823 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 736 [2022-12-13 09:30:09,823 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 212 flow [2022-12-13 09:30:09,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:09,824 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:09,824 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:09,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:30:09,824 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:09,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:09,825 INFO L85 PathProgramCache]: Analyzing trace with hash 24353639, now seen corresponding path program 1 times [2022-12-13 09:30:09,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:09,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937887732] [2022-12-13 09:30:09,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:09,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:09,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:10,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:10,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:10,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937887732] [2022-12-13 09:30:10,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937887732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:10,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:10,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:30:10,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599176984] [2022-12-13 09:30:10,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:10,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:30:10,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:10,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:30:10,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:30:10,275 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2022-12-13 09:30:10,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:10,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:10,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2022-12-13 09:30:10,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:10,450 INFO L130 PetriNetUnfolder]: 242/451 cut-off events. [2022-12-13 09:30:10,451 INFO L131 PetriNetUnfolder]: For 783/783 co-relation queries the response was YES. [2022-12-13 09:30:10,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1513 conditions, 451 events. 242/451 cut-off events. For 783/783 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 1973 event pairs, 84 based on Foata normal form. 7/401 useless extension candidates. Maximal degree in co-relation 1493. Up to 382 conditions per place. [2022-12-13 09:30:10,453 INFO L137 encePairwiseOnDemand]: 21/31 looper letters, 30 selfloop transitions, 17 changer transitions 0/53 dead transitions. [2022-12-13 09:30:10,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 401 flow [2022-12-13 09:30:10,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:30:10,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:30:10,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2022-12-13 09:30:10,454 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4838709677419355 [2022-12-13 09:30:10,454 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 212 flow. Second operand 5 states and 75 transitions. [2022-12-13 09:30:10,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 401 flow [2022-12-13 09:30:10,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 396 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:30:10,459 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 346 flow [2022-12-13 09:30:10,459 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=346, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2022-12-13 09:30:10,460 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2022-12-13 09:30:10,461 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:10,461 INFO L89 Accepts]: Start accepts. Operand has 48 places, 44 transitions, 346 flow [2022-12-13 09:30:10,462 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:10,462 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:10,462 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 44 transitions, 346 flow [2022-12-13 09:30:10,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 44 transitions, 346 flow [2022-12-13 09:30:10,476 INFO L130 PetriNetUnfolder]: 42/146 cut-off events. [2022-12-13 09:30:10,476 INFO L131 PetriNetUnfolder]: For 287/287 co-relation queries the response was YES. [2022-12-13 09:30:10,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 146 events. 42/146 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 763 event pairs, 8 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 468. Up to 60 conditions per place. [2022-12-13 09:30:10,477 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 44 transitions, 346 flow [2022-12-13 09:30:10,477 INFO L226 LiptonReduction]: Number of co-enabled transitions 330 [2022-12-13 09:30:10,490 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [349] L759-->L770: Formula: (and (= v_~y$r_buff0_thd0~0_In_1 v_~y$r_buff1_thd0~0_Out_2) (= v_~y$w_buff0_used~0_Out_2 1) (= v_~y$r_buff0_thd2~0_In_1 v_~y$r_buff1_thd2~0_Out_2) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_Out_2 256) 0)) (not (= (mod v_~y$w_buff1_used~0_Out_2 256) 0)))) 1 0)) (= v_~y$w_buff0_used~0_In_1 v_~y$w_buff1_used~0_Out_2) (= 1 v_~y$r_buff0_thd2~0_Out_2) (= v_~y$w_buff1~0_Out_2 v_~y$w_buff0~0_In_1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_3| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_3| 0)) (= v_~y$w_buff0~0_Out_2 1) (= v_~y$r_buff1_thd1~0_Out_2 v_~y$r_buff0_thd1~0_In_1)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_1, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_In_1, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_In_1, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_2, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_Out_2, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_Out_2, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3|, ~y$w_buff1~0=v_~y$w_buff1~0_Out_2, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_Out_2, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_Out_2, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_Out_2, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_Out_2} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$w_buff1_used~0] and [426] $Ultimate##0-->L739: Formula: (and (= v_~y~0_238 2) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~y~0=v_~y~0_238, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-13 09:30:10,594 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:30:10,594 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 09:30:10,594 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 351 flow [2022-12-13 09:30:10,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:10,595 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:10,595 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:10,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:30:10,595 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:10,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:10,595 INFO L85 PathProgramCache]: Analyzing trace with hash 754962516, now seen corresponding path program 1 times [2022-12-13 09:30:10,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:10,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839873378] [2022-12-13 09:30:10,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:10,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:10,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:10,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839873378] [2022-12-13 09:30:10,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839873378] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:10,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:10,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:30:10,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634986481] [2022-12-13 09:30:10,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:10,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:30:10,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:10,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:30:10,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:30:10,736 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 32 [2022-12-13 09:30:10,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 351 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-13 09:30:10,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:10,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 32 [2022-12-13 09:30:10,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:10,823 INFO L130 PetriNetUnfolder]: 170/354 cut-off events. [2022-12-13 09:30:10,823 INFO L131 PetriNetUnfolder]: For 830/830 co-relation queries the response was YES. [2022-12-13 09:30:10,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1309 conditions, 354 events. 170/354 cut-off events. For 830/830 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1541 event pairs, 33 based on Foata normal form. 19/300 useless extension candidates. Maximal degree in co-relation 1286. Up to 301 conditions per place. [2022-12-13 09:30:10,826 INFO L137 encePairwiseOnDemand]: 24/32 looper letters, 40 selfloop transitions, 7 changer transitions 2/52 dead transitions. [2022-12-13 09:30:10,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 52 transitions, 406 flow [2022-12-13 09:30:10,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:10,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:30:10,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-13 09:30:10,828 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-13 09:30:10,828 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 351 flow. Second operand 3 states and 56 transitions. [2022-12-13 09:30:10,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 52 transitions, 406 flow [2022-12-13 09:30:10,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 52 transitions, 361 flow, removed 16 selfloop flow, removed 2 redundant places. [2022-12-13 09:30:10,832 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 238 flow [2022-12-13 09:30:10,832 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2022-12-13 09:30:10,834 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -4 predicate places. [2022-12-13 09:30:10,834 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:10,834 INFO L89 Accepts]: Start accepts. Operand has 49 places, 40 transitions, 238 flow [2022-12-13 09:30:10,835 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:10,835 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:10,835 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 40 transitions, 238 flow [2022-12-13 09:30:10,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 40 transitions, 238 flow [2022-12-13 09:30:10,856 INFO L130 PetriNetUnfolder]: 77/221 cut-off events. [2022-12-13 09:30:10,856 INFO L131 PetriNetUnfolder]: For 370/370 co-relation queries the response was YES. [2022-12-13 09:30:10,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 760 conditions, 221 events. 77/221 cut-off events. For 370/370 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1196 event pairs, 12 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 739. Up to 99 conditions per place. [2022-12-13 09:30:10,857 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 40 transitions, 238 flow [2022-12-13 09:30:10,857 INFO L226 LiptonReduction]: Number of co-enabled transitions 208 [2022-12-13 09:30:11,243 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [475] L759-->L786: Formula: (let ((.cse0 (not (= (mod v_~weak$$choice2~0_272 256) 0))) (.cse1 (= (mod v_~y$w_buff0_used~0_711 256) 0))) (and (= (ite .cse0 1 (ite .cse1 1 (ite (not .cse1) 0 1))) v_~y$r_buff0_thd2~0_374) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_41| 0)) (= v_~y~0_657 (ite .cse0 v_~y$mem_tmp~0_240 1)) (= (ite .cse0 1 0) v_~y$w_buff0_used~0_711) (= v_~y$r_buff1_thd2~0_339 (ite .cse0 v_~y$r_buff0_thd2~0_376 (ite (let ((.cse2 (= (mod v_~y$r_buff0_thd2~0_374 256) 0))) (or .cse1 (and (= (mod v_~y$w_buff1_used~0_690 256) 0) .cse2) (and (= (mod v_~y$r_buff0_thd2~0_376 256) 0) .cse2))) v_~y$r_buff0_thd2~0_376 0))) (= v_~y$flush_delayed~0_255 0) (= v_~y~0_658 v_~y$mem_tmp~0_240) (= v_~weak$$choice0~0_207 |v_P1Thread1of1ForFork1_#t~nondet3#1_50|) (= v_~__unbuffered_p1_EAX~0_148 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_41| (ite (= (mod v_~y$w_buff0_used~0_713 256) 0) 1 0)) (= v_~y$w_buff1~0_474 v_~y$w_buff0~0_515) (= v_~y$w_buff0~0_513 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_41| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_41|) (= v_~y$r_buff0_thd0~0_370 v_~y$r_buff1_thd0~0_371) (= v_~y$r_buff0_thd1~0_125 v_~y$r_buff1_thd1~0_128) (= v_~weak$$choice2~0_272 |v_P1Thread1of1ForFork1_#t~nondet4#1_50|) (= v_~y$w_buff1_used~0_690 (ite .cse0 v_~y$w_buff0_used~0_713 (ite .cse1 v_~y$w_buff0_used~0_713 0))))) InVars {P1Thread1of1ForFork1_#t~nondet4#1=|v_P1Thread1of1ForFork1_#t~nondet4#1_50|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_713, ~y$w_buff0~0=v_~y$w_buff0~0_515, P1Thread1of1ForFork1_#t~nondet3#1=|v_P1Thread1of1ForFork1_#t~nondet3#1_50|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_370, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_376, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~y~0=v_~y~0_658} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_711, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_41|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_339, ~weak$$choice0~0=v_~weak$$choice0~0_207, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_128, ~y$mem_tmp~0=v_~y$mem_tmp~0_240, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_148, ~y$w_buff1~0=v_~y$w_buff1~0_474, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_41|, ~y$w_buff0~0=v_~y$w_buff0~0_513, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_370, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_374, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~y$flush_delayed~0=v_~y$flush_delayed~0_255, ~y~0=v_~y~0_657, ~weak$$choice2~0=v_~weak$$choice2~0_272, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_371, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_690} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet3#1, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, P1Thread1of1ForFork1_#t~nondet4#1, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [426] $Ultimate##0-->L739: Formula: (and (= v_~y~0_238 2) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~y~0=v_~y~0_238, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-13 09:30:11,539 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [460] L829-3-->L2-1: Formula: (and (= v_~main$tmp_guard0~0_Out_2 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_In_1) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (mod v_~main$tmp_guard0~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_1} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_Out_2|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_1, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [472] L739-->L840: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_691 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd0~0_362 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_360 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff0_used~0_692 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_670 256) 0)) .cse3)) (.cse1 (and .cse4 .cse5))) (and (= v_~x~0_139 1) (= v_~y$w_buff0_used~0_691 (ite .cse0 0 v_~y$w_buff0_used~0_692)) (= v_~y$r_buff0_thd0~0_359 (ite .cse1 0 v_~y$r_buff0_thd0~0_360)) (= v_~y~0_636 (ite .cse0 v_~y$w_buff0~0_500 (ite .cse2 v_~y$w_buff1~0_462 v_~y~0_637))) (= v_~y$r_buff1_thd0~0_361 (ite (or (and (not (= (mod v_~y$w_buff1_used~0_669 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd0~0_359 256) 0)))) 0 v_~y$r_buff1_thd0~0_362)) (= v_~y$w_buff1_used~0_669 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_670))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_692, ~y$w_buff1~0=v_~y$w_buff1~0_462, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_360, ~y$w_buff0~0=v_~y$w_buff0~0_500, ~y~0=v_~y~0_637, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_362, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_670} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_691, ~y$w_buff1~0=v_~y$w_buff1~0_462, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_359, ~y$w_buff0~0=v_~y$w_buff0~0_500, ~y~0=v_~y~0_636, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_361, ~x~0=v_~x~0_139, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_669} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] [2022-12-13 09:30:49,027 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L829-3-->L840: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd0~0_401 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_773 256) 0))) (.cse2 (not (= 0 (mod v_~y$r_buff1_thd0~0_402 256))))) (let ((.cse0 (and (not (= (mod v_~y$w_buff1_used~0_745 256) 0)) .cse2)) (.cse1 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_774 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_745) v_~y$w_buff1_used~0_744) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_47| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_43|) (= v_~y$r_buff1_thd0~0_401 (ite (or (and (not (= (mod v_~y$w_buff1_used~0_744 256) 0)) .cse2) (and (not (= (mod v_~y$r_buff0_thd0~0_400 256) 0)) .cse3)) 0 v_~y$r_buff1_thd0~0_402)) (= (mod v_~main$tmp_guard0~0_82 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_43|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_279 2) 1 0) 0) 0 1) v_~main$tmp_guard0~0_82) (= v_~y~0_719 (ite .cse4 v_~y$w_buff0~0_563 (ite .cse0 v_~y$w_buff1~0_516 v_~y~0_720))) (= v_~y$r_buff0_thd0~0_400 (ite .cse1 0 v_~y$r_buff0_thd0~0_401)) (= (ite .cse4 0 v_~y$w_buff0_used~0_774) v_~y$w_buff0_used~0_773) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_47| 0))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_774, ~y$w_buff1~0=v_~y$w_buff1~0_516, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_401, ~y$w_buff0~0=v_~y$w_buff0~0_563, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_279, ~y~0=v_~y~0_720, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_402, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_745} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_67|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_773, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_77|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_82, ~y$w_buff1~0=v_~y$w_buff1~0_516, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_400, ~y$w_buff0~0=v_~y$w_buff0~0_563, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_47|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_279, ~y~0=v_~y~0_719, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_401, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_744, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_43|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [426] $Ultimate##0-->L739: Formula: (and (= v_~y~0_238 2) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~y~0=v_~y~0_238, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-13 09:30:49,806 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [485] L829-3-->L739: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff0_thd0~0_411 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_787 256) 0)))) (let ((.cse0 (not (= (mod v_~y$r_buff1_thd0~0_412 256) 0))) (.cse1 (and .cse3 .cse2))) (and (= v_P0Thread1of1ForFork0_~arg.base_38 |v_P0Thread1of1ForFork0_#in~arg.base_38|) (= v_~y$w_buff1_used~0_756 (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_757 256) 0))) .cse1) 0 v_~y$w_buff1_used~0_757)) (= v_~y$r_buff1_thd0~0_411 (ite (or (and (not (= (mod v_~y$w_buff1_used~0_756 256) 0)) .cse0) (and (not (= (mod v_~y$r_buff0_thd0~0_410 256) 0)) .cse2)) 0 v_~y$r_buff1_thd0~0_412)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_51| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= v_~y$r_buff0_thd0~0_410 (ite .cse1 0 v_~y$r_buff0_thd0~0_411)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_51| 0)) (= v_~main$tmp_guard0~0_86 (ite (= (ite (= v_~__unbuffered_cnt~0_283 2) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_86 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= (ite (and .cse3 (not (= (mod v_~y$w_buff0_used~0_788 256) 0))) 0 v_~y$w_buff0_used~0_788) v_~y$w_buff0_used~0_787) (= v_~y~0_733 2) (= v_P0Thread1of1ForFork0_~arg.offset_38 |v_P0Thread1of1ForFork0_#in~arg.offset_38|)))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_38|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_788, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_411, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_283, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_412, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_757} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_71|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_787, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_81|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_38|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_86, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_38, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_38|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_410, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_51|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_283, ~y~0=v_~y~0_733, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_411, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_38, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_756, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ~y~0, P0Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd0~0, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [451] L840-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse8 (= (mod v_~y$r_buff1_thd0~0_160 256) 0)) (.cse10 (= (mod v_~y$r_buff0_thd0~0_162 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (= (mod v_~y$w_buff0_used~0_338 256) 0)) (.cse5 (and .cse8 .cse10)) (.cse6 (and (= (mod v_~y$w_buff1_used~0_330 256) 0) .cse10))) (let ((.cse1 (or .cse12 .cse5 .cse6)) (.cse2 (and (not .cse12) .cse11))) (let ((.cse9 (= (mod v_~y$w_buff1_used~0_329 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_337 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_132 256) 0))) (.cse3 (ite .cse1 v_~y~0_299 (ite .cse2 v_~y$w_buff0~0_219 v_~y$w_buff1~0_193)))) (and (= v_~y$w_buff0_used~0_337 (ite .cse0 v_~y$w_buff0_used~0_338 (ite .cse1 v_~y$w_buff0_used~0_338 (ite .cse2 0 v_~y$w_buff0_used~0_338)))) (= v_~main$tmp_guard1~0_40 (ite (= 0 (ite (not (and (= .cse3 2) (= v_~x~0_52 2) (= v_~__unbuffered_p1_EBX~0_54 1) (= v_~__unbuffered_p1_EAX~0_56 1))) 1 0)) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_53| 0) (= v_~y$w_buff1_used~0_329 (ite .cse0 v_~y$w_buff1_used~0_330 (ite (or .cse4 .cse5 .cse6) v_~y$w_buff1_used~0_330 0))) (= v_~y$r_buff1_thd0~0_159 (ite .cse0 v_~y$r_buff1_thd0~0_160 (ite (let ((.cse7 (= (mod v_~y$r_buff0_thd0~0_161 256) 0))) (or .cse4 (and .cse7 .cse8) (and .cse9 .cse7))) v_~y$r_buff1_thd0~0_160 0))) (= v_~weak$$choice0~0_67 |v_ULTIMATE.start_main_#t~nondet11#1_69|) (= v_~y$r_buff0_thd0~0_161 (ite .cse0 v_~y$r_buff0_thd0~0_162 (ite (or .cse4 .cse5 (and .cse9 .cse10)) v_~y$r_buff0_thd0~0_162 (ite (and (not .cse4) .cse11) 0 v_~y$r_buff0_thd0~0_162)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_35| (mod v_~main$tmp_guard1~0_40 256)) (= v_~y$flush_delayed~0_115 0) (= v_~y$w_buff0~0_219 v_~y$w_buff0~0_218) (= v_~y$w_buff1~0_193 v_~y$w_buff1~0_192) (= v_~y~0_299 v_~y$mem_tmp~0_100) (= v_~weak$$choice2~0_132 |v_ULTIMATE.start_main_#t~nondet12#1_75|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_35| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_53|) (= v_~y~0_298 (ite .cse0 v_~y$mem_tmp~0_100 .cse3))))))) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_69|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_54, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_338, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_56, ~y$w_buff1~0=v_~y$w_buff1~0_193, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_162, ~y$w_buff0~0=v_~y$w_buff0~0_219, ~y~0=v_~y~0_299, ~x~0=v_~x~0_52, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_160, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_75|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_330} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_53|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_54, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_337, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~weak$$choice0~0=v_~weak$$choice0~0_67, ~y$mem_tmp~0=v_~y$mem_tmp~0_100, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_35|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_56, ~y$w_buff1~0=v_~y$w_buff1~0_192, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_161, ~y$w_buff0~0=v_~y$w_buff0~0_218, ~y$flush_delayed~0=v_~y$flush_delayed~0_115, ~y~0=v_~y~0_298, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~x~0=v_~x~0_52, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_159, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_329} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~nondet12#1, ~weak$$choice0~0, ~y$mem_tmp~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$r_buff0_thd0~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 09:30:50,430 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 09:30:50,431 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39597 [2022-12-13 09:30:50,431 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 260 flow [2022-12-13 09:30:50,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-13 09:30:50,432 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:50,432 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:50,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:30:50,432 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:50,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:50,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1795527044, now seen corresponding path program 1 times [2022-12-13 09:30:50,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:50,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406579608] [2022-12-13 09:30:50,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:50,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:50,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:50,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:50,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406579608] [2022-12-13 09:30:50,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406579608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:50,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:50,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:30:50,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251209124] [2022-12-13 09:30:50,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:50,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:30:50,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:50,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:30:50,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:30:50,996 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 32 [2022-12-13 09:30:50,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 260 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:50,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:50,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 32 [2022-12-13 09:30:50,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:51,408 INFO L130 PetriNetUnfolder]: 230/512 cut-off events. [2022-12-13 09:30:51,408 INFO L131 PetriNetUnfolder]: For 1173/1182 co-relation queries the response was YES. [2022-12-13 09:30:51,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2004 conditions, 512 events. 230/512 cut-off events. For 1173/1182 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2651 event pairs, 23 based on Foata normal form. 23/470 useless extension candidates. Maximal degree in co-relation 1980. Up to 250 conditions per place. [2022-12-13 09:30:51,411 INFO L137 encePairwiseOnDemand]: 22/32 looper letters, 38 selfloop transitions, 9 changer transitions 12/64 dead transitions. [2022-12-13 09:30:51,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 64 transitions, 490 flow [2022-12-13 09:30:51,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:51,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:30:51,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-12-13 09:30:51,412 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.515625 [2022-12-13 09:30:51,412 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 260 flow. Second operand 4 states and 66 transitions. [2022-12-13 09:30:51,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 64 transitions, 490 flow [2022-12-13 09:30:51,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 64 transitions, 429 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-12-13 09:30:51,418 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 226 flow [2022-12-13 09:30:51,418 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2022-12-13 09:30:51,418 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2022-12-13 09:30:51,418 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:51,418 INFO L89 Accepts]: Start accepts. Operand has 47 places, 38 transitions, 226 flow [2022-12-13 09:30:51,419 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:51,419 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:51,419 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 38 transitions, 226 flow [2022-12-13 09:30:51,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 38 transitions, 226 flow [2022-12-13 09:30:51,448 INFO L130 PetriNetUnfolder]: 96/319 cut-off events. [2022-12-13 09:30:51,448 INFO L131 PetriNetUnfolder]: For 271/271 co-relation queries the response was YES. [2022-12-13 09:30:51,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 848 conditions, 319 events. 96/319 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 1982 event pairs, 41 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 827. Up to 187 conditions per place. [2022-12-13 09:30:51,451 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 38 transitions, 226 flow [2022-12-13 09:30:51,451 INFO L226 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-13 09:30:51,463 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [484] L759-->L809: Formula: (let ((.cse9 (not (= (mod |v_P1Thread1of1ForFork1_#t~nondet4#1_74| 256) 0)))) (let ((.cse26 (ite .cse9 1 0))) (let ((.cse28 (= (mod .cse26 256) 0))) (let ((.cse27 (not .cse28))) (let ((.cse20 (ite .cse9 1 (ite .cse28 1 (ite .cse27 0 1))))) (let ((.cse24 (ite .cse9 v_~y$w_buff0_used~0_783 (ite .cse28 v_~y$w_buff0_used~0_783 0))) (.cse21 (= (mod .cse20 256) 0))) (let ((.cse25 (and (= (mod .cse24 256) 0) .cse21))) (let ((.cse17 (ite .cse9 v_~y$r_buff0_thd2~0_428 (ite (or .cse28 .cse25 (and (= (mod v_~y$r_buff0_thd2~0_428 256) 0) .cse21)) v_~y$r_buff0_thd2~0_428 0)))) (let ((.cse19 (= (mod .cse17 256) 0))) (let ((.cse23 (not .cse21)) (.cse22 (and .cse19 .cse21))) (let ((.cse5 (not (= (mod v_~weak$$choice2~0_295 256) 0))) (.cse6 (or .cse28 .cse25 .cse22)) (.cse7 (and .cse27 .cse23))) (let ((.cse8 (ite .cse5 .cse26 (ite .cse6 .cse26 (ite .cse7 0 .cse26))))) (let ((.cse18 (= (mod .cse8 256) 0))) (let ((.cse2 (ite .cse5 .cse24 (ite (or .cse25 .cse18 .cse22) .cse24 0)))) (let ((.cse15 (= (mod .cse2 256) 0)) (.cse14 (not .cse18))) (let ((.cse3 (ite .cse5 .cse20 (ite (or .cse18 (and .cse15 .cse21) .cse22) .cse20 (ite (and .cse23 .cse14) 0 .cse20))))) (let ((.cse16 (= (mod .cse3 256) 0))) (let ((.cse12 (ite .cse5 .cse17 (ite (or (and .cse16 .cse15) .cse18 (and .cse16 .cse19)) .cse17 0)))) (let ((.cse11 (not (= (mod .cse12 256) 0))) (.cse10 (not (= (mod v_~y$w_buff0_used~0_781 256) 0))) (.cse13 (not .cse16))) (let ((.cse1 (and .cse10 .cse13)) (.cse0 (and (not .cse15) .cse11)) (.cse4 (and .cse13 .cse14))) (and (= (ite (or .cse0 .cse1) 0 .cse2) v_~y$w_buff1_used~0_752) (= v_~__unbuffered_p1_EAX~0_160 1) (= v_~y$w_buff1~0_520 v_~y$w_buff0~0_569) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_49| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_49|) (= (ite .cse1 0 .cse3) v_~y$r_buff0_thd2~0_426) (= v_~y$flush_delayed~0_278 0) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_49| 0)) (= v_~y~0_727 (ite .cse4 v_~y$w_buff0~0_567 (ite .cse0 v_~y$w_buff1~0_520 (ite .cse5 v_~y$mem_tmp~0_263 v_~__unbuffered_p1_EBX~0_157)))) (= (ite .cse6 v_~y$mem_tmp~0_263 (ite .cse7 v_~y$w_buff0~0_567 v_~y$w_buff1~0_520)) v_~__unbuffered_p1_EBX~0_157) (= v_~weak$$choice2~0_295 |v_P1Thread1of1ForFork1_#t~nondet6#1_68|) (= v_~y$w_buff0_used~0_781 (ite .cse4 0 .cse8)) (= (ite (= (mod v_~y$w_buff0_used~0_783 256) 0) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_49|) (= v_~y$r_buff0_thd0~0_408 v_~y$r_buff1_thd0~0_409) (= (ite .cse9 v_~y~0_729 1) v_~y$mem_tmp~0_263) (= v_~y$w_buff0~0_567 1) (= v_~y$r_buff0_thd1~0_133 v_~y$r_buff1_thd1~0_136) (= v_~weak$$choice0~0_230 |v_P1Thread1of1ForFork1_#t~nondet5#1_68|) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_426 256) 0)) .cse10) (and (not (= (mod v_~y$w_buff1_used~0_752 256) 0)) .cse11)) 0 .cse12) v_~y$r_buff1_thd2~0_383)))))))))))))))))))))) InVars {P1Thread1of1ForFork1_#t~nondet4#1=|v_P1Thread1of1ForFork1_#t~nondet4#1_74|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_783, P1Thread1of1ForFork1_#t~nondet5#1=|v_P1Thread1of1ForFork1_#t~nondet5#1_68|, ~y$w_buff0~0=v_~y$w_buff0~0_569, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_408, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_428, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_133, P1Thread1of1ForFork1_#t~nondet6#1=|v_P1Thread1of1ForFork1_#t~nondet6#1_68|, ~y~0=v_~y~0_729} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_157, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_781, P1Thread1of1ForFork1_#t~nondet3#1=|v_P1Thread1of1ForFork1_#t~nondet3#1_73|, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_49|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_383, ~weak$$choice0~0=v_~weak$$choice0~0_230, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_136, ~y$mem_tmp~0=v_~y$mem_tmp~0_263, ~y$w_buff1~0=v_~y$w_buff1~0_520, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_160, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_49|, ~y$w_buff0~0=v_~y$w_buff0~0_567, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_408, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_426, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_133, ~y$flush_delayed~0=v_~y$flush_delayed~0_278, ~y~0=v_~y~0_727, ~weak$$choice2~0=v_~weak$$choice2~0_295, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_409, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_752} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet5#1, P1Thread1of1ForFork1_#t~nondet3#1, P1Thread1of1ForFork1_#t~nondet6#1, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, P1Thread1of1ForFork1_#t~nondet4#1, ~y$mem_tmp~0, ~y$w_buff1~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [426] $Ultimate##0-->L739: Formula: (and (= v_~y~0_238 2) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~y~0=v_~y~0_238, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-13 09:30:51,894 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:30:51,896 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 478 [2022-12-13 09:30:51,896 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 233 flow [2022-12-13 09:30:51,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:51,896 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:51,896 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:51,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:30:51,896 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:51,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:51,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1386278200, now seen corresponding path program 1 times [2022-12-13 09:30:51,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:51,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096997229] [2022-12-13 09:30:51,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:51,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:52,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:52,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:52,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096997229] [2022-12-13 09:30:52,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096997229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:52,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:52,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:30:52,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044871502] [2022-12-13 09:30:52,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:52,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:30:52,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:52,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:30:52,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:30:52,117 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 09:30:52,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 233 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:52,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:52,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 09:30:52,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:52,249 INFO L130 PetriNetUnfolder]: 80/242 cut-off events. [2022-12-13 09:30:52,249 INFO L131 PetriNetUnfolder]: For 257/258 co-relation queries the response was YES. [2022-12-13 09:30:52,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 242 events. 80/242 cut-off events. For 257/258 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1128 event pairs, 9 based on Foata normal form. 54/232 useless extension candidates. Maximal degree in co-relation 847. Up to 112 conditions per place. [2022-12-13 09:30:52,250 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 21 selfloop transitions, 13 changer transitions 10/46 dead transitions. [2022-12-13 09:30:52,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 350 flow [2022-12-13 09:30:52,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:52,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:30:52,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-13 09:30:52,253 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4396551724137931 [2022-12-13 09:30:52,253 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 233 flow. Second operand 4 states and 51 transitions. [2022-12-13 09:30:52,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 350 flow [2022-12-13 09:30:52,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 310 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-13 09:30:52,255 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 158 flow [2022-12-13 09:30:52,255 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2022-12-13 09:30:52,257 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -9 predicate places. [2022-12-13 09:30:52,257 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:52,257 INFO L89 Accepts]: Start accepts. Operand has 44 places, 28 transitions, 158 flow [2022-12-13 09:30:52,259 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:52,259 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:52,259 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 28 transitions, 158 flow [2022-12-13 09:30:52,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 28 transitions, 158 flow [2022-12-13 09:30:52,270 INFO L130 PetriNetUnfolder]: 10/69 cut-off events. [2022-12-13 09:30:52,270 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-13 09:30:52,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 69 events. 10/69 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 259 event pairs, 1 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 181. Up to 37 conditions per place. [2022-12-13 09:30:52,271 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 28 transitions, 158 flow [2022-12-13 09:30:52,271 INFO L226 LiptonReduction]: Number of co-enabled transitions 108 [2022-12-13 09:30:54,689 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 09:30:54,690 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2433 [2022-12-13 09:30:54,690 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 24 transitions, 148 flow [2022-12-13 09:30:54,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:54,690 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:54,690 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:54,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:30:54,690 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:54,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:54,691 INFO L85 PathProgramCache]: Analyzing trace with hash 895288352, now seen corresponding path program 1 times [2022-12-13 09:30:54,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:54,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207421087] [2022-12-13 09:30:54,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:54,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:56,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:56,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:56,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207421087] [2022-12-13 09:30:56,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207421087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:56,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:56,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 09:30:56,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417628622] [2022-12-13 09:30:56,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:56,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 09:30:56,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:56,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 09:30:56,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 09:30:56,030 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 18 [2022-12-13 09:30:56,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 24 transitions, 148 flow. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:56,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:56,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 18 [2022-12-13 09:30:56,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:56,144 INFO L130 PetriNetUnfolder]: 45/132 cut-off events. [2022-12-13 09:30:56,144 INFO L131 PetriNetUnfolder]: For 190/200 co-relation queries the response was YES. [2022-12-13 09:30:56,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 132 events. 45/132 cut-off events. For 190/200 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 0 based on Foata normal form. 19/125 useless extension candidates. Maximal degree in co-relation 504. Up to 83 conditions per place. [2022-12-13 09:30:56,145 INFO L137 encePairwiseOnDemand]: 10/18 looper letters, 19 selfloop transitions, 10 changer transitions 15/49 dead transitions. [2022-12-13 09:30:56,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 49 transitions, 380 flow [2022-12-13 09:30:56,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 09:30:56,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 09:30:56,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2022-12-13 09:30:56,147 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4236111111111111 [2022-12-13 09:30:56,147 INFO L175 Difference]: Start difference. First operand has 39 places, 24 transitions, 148 flow. Second operand 8 states and 61 transitions. [2022-12-13 09:30:56,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 49 transitions, 380 flow [2022-12-13 09:30:56,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 310 flow, removed 12 selfloop flow, removed 9 redundant places. [2022-12-13 09:30:56,148 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 163 flow [2022-12-13 09:30:56,148 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=163, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2022-12-13 09:30:56,149 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -12 predicate places. [2022-12-13 09:30:56,149 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:56,149 INFO L89 Accepts]: Start accepts. Operand has 41 places, 30 transitions, 163 flow [2022-12-13 09:30:56,149 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:56,149 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:56,149 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 30 transitions, 163 flow [2022-12-13 09:30:56,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 30 transitions, 163 flow [2022-12-13 09:30:56,156 INFO L130 PetriNetUnfolder]: 12/53 cut-off events. [2022-12-13 09:30:56,156 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-12-13 09:30:56,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 53 events. 12/53 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 151 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 152. Up to 28 conditions per place. [2022-12-13 09:30:56,156 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 30 transitions, 163 flow [2022-12-13 09:30:56,156 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 09:30:56,171 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [352] L802-->L809: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd2~0_96 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_177 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_103 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff0_used~0_178 256) 0)) .cse5)) (.cse4 (and .cse5 .cse2)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_177 256) 0)) .cse3))) (and (= v_~y~0_159 (ite .cse0 v_~y$w_buff0~0_96 (ite .cse1 v_~y$w_buff1~0_87 v_~y~0_160))) (= (ite .cse0 0 v_~y$w_buff0_used~0_178) v_~y$w_buff0_used~0_177) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_102 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_176 256) 0)) .cse3)) 0 v_~y$r_buff1_thd2~0_96) v_~y$r_buff1_thd2~0_95) (= v_~y$r_buff0_thd2~0_102 (ite .cse4 0 v_~y$r_buff0_thd2~0_103)) (= v_~y$w_buff1_used~0_176 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_177))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_96, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_178, ~y$w_buff1~0=v_~y$w_buff1~0_87, ~y$w_buff0~0=v_~y$w_buff0~0_96, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_103, ~y~0=v_~y~0_160, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_177} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_95, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_177, ~y$w_buff1~0=v_~y$w_buff1~0_87, ~y$w_buff0~0=v_~y$w_buff0~0_96, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_102, ~y~0=v_~y~0_159, ~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] and [342] L742-->L749: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd1~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_26 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_153 256) 0)))) (let ((.cse0 (and .cse5 .cse1)) (.cse4 (and (not (= 0 (mod v_~y$w_buff0_used~0_154 256))) .cse5)) (.cse3 (and (not (= (mod v_~y$w_buff1_used~0_157 256) 0)) .cse2))) (and (= v_~y$r_buff0_thd1~0_25 (ite .cse0 0 v_~y$r_buff0_thd1~0_26)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd1~0_25 256) 0)) .cse1) (and (not (= (mod v_~y$w_buff1_used~0_156 256) 0)) .cse2)) 0 v_~y$r_buff1_thd1~0_24) v_~y$r_buff1_thd1~0_23) (= v_~y$w_buff1_used~0_156 (ite (or .cse3 .cse0) 0 v_~y$w_buff1_used~0_157)) (= v_~y$w_buff0_used~0_153 (ite .cse4 0 v_~y$w_buff0_used~0_154)) (= v_~y~0_141 (ite .cse4 v_~y$w_buff0~0_82 (ite .cse3 v_~y$w_buff1~0_77 v_~y~0_142)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_154, ~y$w_buff1~0=v_~y$w_buff1~0_77, ~y$w_buff0~0=v_~y$w_buff0~0_82, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_26, ~y~0=v_~y~0_142, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_157} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_153, ~y$w_buff1~0=v_~y$w_buff1~0_77, ~y$w_buff0~0=v_~y$w_buff0~0_82, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_25, ~y~0=v_~y~0_141, ~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-13 09:30:56,655 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [350] L770-->L786: Formula: (let ((.cse4 (= (mod v_~y$r_buff1_thd2~0_92 256) 0)) (.cse7 (= (mod v_~y$r_buff0_thd2~0_99 256) 0))) (let ((.cse9 (not .cse7)) (.cse10 (and .cse7 (= (mod v_~y$w_buff1_used~0_173 256) 0))) (.cse8 (and .cse4 .cse7)) (.cse12 (= 0 (mod v_~y$w_buff0_used~0_174 256)))) (let ((.cse5 (or .cse10 .cse8 .cse12)) (.cse6 (and (not .cse12) .cse9))) (let ((.cse1 (= (mod v_~y$w_buff1_used~0_172 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_173 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_86 256) 0))) (.cse11 (ite .cse5 v_~y~0_156 (ite .cse6 v_~y$w_buff0~0_93 v_~y$w_buff1~0_84)))) (and (= |v_P1Thread1of1ForFork1_#t~nondet4#1_1| v_~weak$$choice2~0_86) (= (ite .cse0 v_~y$r_buff1_thd2~0_92 (ite (let ((.cse2 (= (mod v_~y$r_buff0_thd2~0_98 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2))) v_~y$r_buff1_thd2~0_92 0)) v_~y$r_buff1_thd2~0_91) (= (ite .cse0 v_~y$w_buff0_used~0_174 (ite .cse5 v_~y$w_buff0_used~0_174 (ite .cse6 0 v_~y$w_buff0_used~0_174))) v_~y$w_buff0_used~0_173) (= v_~y$r_buff0_thd2~0_98 (ite .cse0 v_~y$r_buff0_thd2~0_99 (ite (or .cse3 (and .cse1 .cse7) .cse8) v_~y$r_buff0_thd2~0_99 (ite (and (not .cse3) .cse9) 0 v_~y$r_buff0_thd2~0_99)))) (= |v_P1Thread1of1ForFork1_#t~nondet3#1_1| v_~weak$$choice0~0_19) (= (ite .cse0 v_~y$w_buff1_used~0_173 (ite (or .cse10 .cse3 .cse8) v_~y$w_buff1_used~0_173 0)) v_~y$w_buff1_used~0_172) (= v_~y$w_buff0~0_93 v_~y$w_buff0~0_92) (= v_~y~0_156 v_~y$mem_tmp~0_60) (= v_~y$w_buff1~0_84 v_~y$w_buff1~0_83) (= .cse11 v_~__unbuffered_p1_EAX~0_24) (= v_~y~0_155 (ite .cse0 v_~y$mem_tmp~0_60 .cse11)) (= 0 v_~y$flush_delayed~0_73)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_92, P1Thread1of1ForFork1_#t~nondet4#1=|v_P1Thread1of1ForFork1_#t~nondet4#1_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_174, ~y$w_buff1~0=v_~y$w_buff1~0_84, ~y$w_buff0~0=v_~y$w_buff0~0_93, P1Thread1of1ForFork1_#t~nondet3#1=|v_P1Thread1of1ForFork1_#t~nondet3#1_1|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_99, ~y~0=v_~y~0_156, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_173} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_173, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_91, ~weak$$choice0~0=v_~weak$$choice0~0_19, ~y$mem_tmp~0=v_~y$mem_tmp~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~y$w_buff1~0=v_~y$w_buff1~0_83, ~y$w_buff0~0=v_~y$w_buff0~0_92, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_98, ~y$flush_delayed~0=v_~y$flush_delayed~0_73, ~y~0=v_~y~0_155, ~weak$$choice2~0=v_~weak$$choice2~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_172} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet3#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, P1Thread1of1ForFork1_#t~nondet4#1, ~y$mem_tmp~0, ~__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, ~y$w_buff1_used~0] and [342] L742-->L749: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd1~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_26 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_153 256) 0)))) (let ((.cse0 (and .cse5 .cse1)) (.cse4 (and (not (= 0 (mod v_~y$w_buff0_used~0_154 256))) .cse5)) (.cse3 (and (not (= (mod v_~y$w_buff1_used~0_157 256) 0)) .cse2))) (and (= v_~y$r_buff0_thd1~0_25 (ite .cse0 0 v_~y$r_buff0_thd1~0_26)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd1~0_25 256) 0)) .cse1) (and (not (= (mod v_~y$w_buff1_used~0_156 256) 0)) .cse2)) 0 v_~y$r_buff1_thd1~0_24) v_~y$r_buff1_thd1~0_23) (= v_~y$w_buff1_used~0_156 (ite (or .cse3 .cse0) 0 v_~y$w_buff1_used~0_157)) (= v_~y$w_buff0_used~0_153 (ite .cse4 0 v_~y$w_buff0_used~0_154)) (= v_~y~0_141 (ite .cse4 v_~y$w_buff0~0_82 (ite .cse3 v_~y$w_buff1~0_77 v_~y~0_142)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_154, ~y$w_buff1~0=v_~y$w_buff1~0_77, ~y$w_buff0~0=v_~y$w_buff0~0_82, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_26, ~y~0=v_~y~0_142, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_157} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_153, ~y$w_buff1~0=v_~y$w_buff1~0_77, ~y$w_buff0~0=v_~y$w_buff0~0_82, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_25, ~y~0=v_~y~0_141, ~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-13 09:30:56,941 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [494] L770-->L749: Formula: (let ((.cse9 (= (mod v_~y$r_buff1_thd2~0_433 256) 0)) (.cse14 (= (mod v_~y$r_buff0_thd2~0_485 256) 0))) (let ((.cse15 (not .cse14)) (.cse13 (and .cse9 .cse14)) (.cse20 (and (= (mod v_~y$w_buff1_used~0_842 256) 0) .cse14)) (.cse21 (= (mod v_~y$w_buff0_used~0_879 256) 0))) (let ((.cse7 (not (= (mod v_~weak$$choice2~0_325 256) 0))) (.cse17 (or .cse13 .cse20 .cse21)) (.cse18 (and .cse15 (not .cse21)))) (let ((.cse1 (ite .cse7 v_~y$w_buff0_used~0_879 (ite .cse17 v_~y$w_buff0_used~0_879 (ite .cse18 0 v_~y$w_buff0_used~0_879))))) (let ((.cse11 (= 0 (mod .cse1 256)))) (let ((.cse4 (ite .cse7 v_~y$w_buff1_used~0_842 (ite (or .cse13 .cse20 .cse11) v_~y$w_buff1_used~0_842 0)))) (let ((.cse10 (= (mod .cse4 256) 0)) (.cse6 (not (= (mod v_~y$r_buff1_thd1~0_169 256) 0))) (.cse16 (not .cse11)) (.cse5 (not (= (mod v_~y$w_buff0_used~0_877 256) 0))) (.cse19 (not (= (mod v_~y$r_buff0_thd1~0_166 256) 0)))) (let ((.cse3 (and .cse5 .cse19)) (.cse0 (and .cse19 .cse16)) (.cse2 (and (not .cse10) .cse6)) (.cse12 (ite .cse17 v_~y~0_823 (ite .cse18 v_~y$w_buff0~0_638 v_~y$w_buff1~0_583)))) (and (= (ite .cse0 0 .cse1) v_~y$w_buff0_used~0_877) (= v_~y$w_buff1_used~0_840 (ite (or .cse2 .cse3) 0 .cse4)) (= v_~y$r_buff0_thd1~0_165 (ite .cse3 0 v_~y$r_buff0_thd1~0_166)) (= v_~y$r_buff1_thd1~0_168 (ite (or (and .cse5 (not (= (mod v_~y$r_buff0_thd1~0_165 256) 0))) (and .cse6 (not (= (mod v_~y$w_buff1_used~0_840 256) 0)))) 0 v_~y$r_buff1_thd1~0_169)) (= v_~y$r_buff1_thd2~0_432 (ite .cse7 v_~y$r_buff1_thd2~0_433 (ite (let ((.cse8 (= (mod v_~y$r_buff0_thd2~0_484 256) 0))) (or (and .cse8 .cse9) (and .cse8 .cse10) .cse11)) v_~y$r_buff1_thd2~0_433 0))) (= v_~weak$$choice2~0_325 |v_P1Thread1of1ForFork1_#t~nondet4#1_106|) (= |v_P1Thread1of1ForFork1_#t~nondet3#1_104| v_~weak$$choice0~0_260) (= v_~y~0_823 v_~y$mem_tmp~0_293) (= v_~y~0_821 (ite .cse0 v_~y$w_buff0~0_637 (ite .cse2 v_~y$w_buff1~0_582 (ite .cse7 v_~y$mem_tmp~0_293 .cse12)))) (= v_~y$w_buff1~0_583 v_~y$w_buff1~0_582) (= v_~y$flush_delayed~0_308 0) (= v_~y$w_buff0~0_638 v_~y$w_buff0~0_637) (= v_~__unbuffered_p1_EAX~0_182 .cse12) (= (ite .cse7 v_~y$r_buff0_thd2~0_485 (ite (or .cse13 (and .cse10 .cse14) .cse11) v_~y$r_buff0_thd2~0_485 (ite (and .cse15 .cse16) 0 v_~y$r_buff0_thd2~0_485))) v_~y$r_buff0_thd2~0_484)))))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_433, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_169, P1Thread1of1ForFork1_#t~nondet4#1=|v_P1Thread1of1ForFork1_#t~nondet4#1_106|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_879, ~y$w_buff1~0=v_~y$w_buff1~0_583, ~y$w_buff0~0=v_~y$w_buff0~0_638, P1Thread1of1ForFork1_#t~nondet3#1=|v_P1Thread1of1ForFork1_#t~nondet3#1_104|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_166, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_485, ~y~0=v_~y~0_823, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_842} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_877, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_432, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_168, ~weak$$choice0~0=v_~weak$$choice0~0_260, ~y$mem_tmp~0=v_~y$mem_tmp~0_293, ~y$w_buff1~0=v_~y$w_buff1~0_582, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_182, ~y$w_buff0~0=v_~y$w_buff0~0_637, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_165, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_484, ~y$flush_delayed~0=v_~y$flush_delayed~0_308, ~y~0=v_~y~0_821, ~weak$$choice2~0=v_~weak$$choice2~0_325, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_840} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet3#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~weak$$choice0~0, P1Thread1of1ForFork1_#t~nondet4#1, ~y$mem_tmp~0, ~y$w_buff1~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] and [351] L786-->L802: Formula: (let ((.cse10 (= (mod v_~y$r_buff1_thd2~0_100 256) 0)) (.cse4 (= (mod v_~y$r_buff0_thd2~0_107 256) 0))) (let ((.cse5 (not .cse4)) (.cse11 (= (mod v_~y$w_buff0_used~0_182 256) 0)) (.cse2 (and .cse4 .cse10)) (.cse6 (and (= (mod v_~y$w_buff1_used~0_181 256) 0) .cse4))) (let ((.cse3 (= (mod v_~y$w_buff1_used~0_180 256) 0)) (.cse1 (= (mod v_~y$w_buff0_used~0_181 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_88 256) 0))) (.cse7 (or .cse11 .cse2 .cse6)) (.cse8 (and (not .cse11) .cse5))) (and (= (ite .cse0 v_~y$r_buff0_thd2~0_107 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~y$r_buff0_thd2~0_107 (ite (and (not .cse1) .cse5) 0 v_~y$r_buff0_thd2~0_107))) v_~y$r_buff0_thd2~0_106) (= v_~y$w_buff1_used~0_180 (ite .cse0 v_~y$w_buff1_used~0_181 (ite (or .cse1 .cse2 .cse6) v_~y$w_buff1_used~0_181 0))) (= v_~y$w_buff0_used~0_181 (ite .cse0 v_~y$w_buff0_used~0_182 (ite .cse7 v_~y$w_buff0_used~0_182 (ite .cse8 0 v_~y$w_buff0_used~0_182)))) (= (ite .cse0 v_~y$r_buff1_thd2~0_100 (ite (let ((.cse9 (= (mod v_~y$r_buff0_thd2~0_106 256) 0))) (or (and .cse9 .cse3) .cse1 (and .cse9 .cse10))) v_~y$r_buff1_thd2~0_100 0)) v_~y$r_buff1_thd2~0_99) (= v_~y$w_buff0~0_99 v_~y$w_buff0~0_98) (= v_~y$w_buff1~0_90 v_~y$w_buff1~0_89) (= |v_P1Thread1of1ForFork1_#t~nondet6#1_1| v_~weak$$choice2~0_88) (= v_~y~0_163 (ite .cse0 v_~y$mem_tmp~0_62 v_~__unbuffered_p1_EBX~0_18)) (= 0 v_~y$flush_delayed~0_75) (= v_~__unbuffered_p1_EBX~0_18 (ite .cse7 v_~y~0_165 (ite .cse8 v_~y$w_buff0~0_99 v_~y$w_buff1~0_90))) (= v_~y~0_165 v_~y$mem_tmp~0_62) (= |v_P1Thread1of1ForFork1_#t~nondet5#1_1| v_~weak$$choice0~0_21))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_100, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_182, ~y$w_buff1~0=v_~y$w_buff1~0_90, P1Thread1of1ForFork1_#t~nondet5#1=|v_P1Thread1of1ForFork1_#t~nondet5#1_1|, ~y$w_buff0~0=v_~y$w_buff0~0_99, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P1Thread1of1ForFork1_#t~nondet6#1=|v_P1Thread1of1ForFork1_#t~nondet6#1_1|, ~y~0=v_~y~0_165, ~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_181, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_99, ~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_89, ~y$w_buff0~0=v_~y$w_buff0~0_98, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_106, ~y$flush_delayed~0=v_~y$flush_delayed~0_75, ~y~0=v_~y~0_163, ~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~nondet5#1, P1Thread1of1ForFork1_#t~nondet6#1, ~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] Received shutdown request... [2022-12-13 09:38:17,103 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 09:38:18,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Cannot interrupt operation gracefully because timeout expired. Forcing shutdown