/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/weaver/parallel-barrier.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:16:27,377 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:16:27,378 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:16:27,450 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:16:27,450 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:16:27,451 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:16:27,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:16:27,453 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:16:27,454 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:16:27,455 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:16:27,455 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:16:27,456 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:16:27,456 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:16:27,457 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:16:27,458 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:16:27,459 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:16:27,459 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:16:27,460 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:16:27,461 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:16:27,462 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:16:27,463 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:16:27,465 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:16:27,466 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:16:27,467 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:16:27,471 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:16:27,472 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:16:27,472 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:16:27,473 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:16:27,474 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:16:27,474 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:16:27,475 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:16:27,476 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:16:27,476 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:16:27,477 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:16:27,478 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:16:27,478 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:16:27,479 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:16:27,479 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:16:27,480 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:16:27,480 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:16:27,481 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:16:27,484 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-06 05:16:27,507 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:16:27,507 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:16:27,508 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:16:27,509 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:16:27,509 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:16:27,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:16:27,509 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:16:27,509 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:16:27,509 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:16:27,509 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:16:27,509 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:16:27,509 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:16:27,510 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:16:27,510 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:16:27,510 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:16:27,510 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:16:27,510 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:16:27,510 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:16:27,510 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:16:27,510 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:16:27,510 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:16:27,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:16:27,511 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:16:27,511 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:16:27,511 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:16:27,511 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:16:27,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:16:27,511 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:16:27,511 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 05:16:27,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:16:27,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:16:27,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:16:27,771 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:16:27,772 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:16:27,773 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-barrier.wvr.c [2022-12-06 05:16:28,815 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:16:28,997 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:16:28,997 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-barrier.wvr.c [2022-12-06 05:16:29,008 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e6ef45ac/d0f90aab13b94c4e9c98e5adac7c1ae3/FLAG2f78bf0db [2022-12-06 05:16:29,022 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e6ef45ac/d0f90aab13b94c4e9c98e5adac7c1ae3 [2022-12-06 05:16:29,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:16:29,027 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:16:29,028 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:16:29,028 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:16:29,030 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:16:29,031 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:16:29" (1/1) ... [2022-12-06 05:16:29,032 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@af20eb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:29, skipping insertion in model container [2022-12-06 05:16:29,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:16:29" (1/1) ... [2022-12-06 05:16:29,038 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:16:29,064 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:16:29,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,232 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-barrier.wvr.c[4722,4735] [2022-12-06 05:16:29,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:16:29,250 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:16:29,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:16:29,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:16:29,317 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-barrier.wvr.c[4722,4735] [2022-12-06 05:16:29,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:16:29,333 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:16:29,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:29 WrapperNode [2022-12-06 05:16:29,334 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:16:29,336 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:16:29,336 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:16:29,336 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:16:29,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:29" (1/1) ... [2022-12-06 05:16:29,357 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:29" (1/1) ... [2022-12-06 05:16:29,387 INFO L138 Inliner]: procedures = 25, calls = 98, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 253 [2022-12-06 05:16:29,388 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:16:29,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:16:29,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:16:29,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:16:29,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:29" (1/1) ... [2022-12-06 05:16:29,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:29" (1/1) ... [2022-12-06 05:16:29,407 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:29" (1/1) ... [2022-12-06 05:16:29,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:29" (1/1) ... [2022-12-06 05:16:29,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:29" (1/1) ... [2022-12-06 05:16:29,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:29" (1/1) ... [2022-12-06 05:16:29,418 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:29" (1/1) ... [2022-12-06 05:16:29,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:29" (1/1) ... [2022-12-06 05:16:29,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:16:29,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:16:29,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:16:29,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:16:29,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:29" (1/1) ... [2022-12-06 05:16:29,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:16:29,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:16:29,465 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 05:16:29,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:16:29,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:16:29,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:16:29,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:16:29,506 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:16:29,506 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:16:29,506 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:16:29,506 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:16:29,506 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:16:29,506 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:16:29,506 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 05:16:29,507 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 05:16:29,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:16:29,507 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-12-06 05:16:29,507 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-12-06 05:16:29,507 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-12-06 05:16:29,507 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-12-06 05:16:29,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 05:16:29,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 05:16:29,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:16:29,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:16:29,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:16:29,509 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:16:29,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 05:16:29,642 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:16:29,643 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:16:29,929 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:16:29,977 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:16:29,978 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 05:16:29,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:16:29 BoogieIcfgContainer [2022-12-06 05:16:29,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:16:29,984 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:16:29,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:16:29,987 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:16:29,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:16:29" (1/3) ... [2022-12-06 05:16:29,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49da680b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:16:29, skipping insertion in model container [2022-12-06 05:16:29,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:29" (2/3) ... [2022-12-06 05:16:29,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49da680b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:16:29, skipping insertion in model container [2022-12-06 05:16:29,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:16:29" (3/3) ... [2022-12-06 05:16:29,989 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-barrier.wvr.c [2022-12-06 05:16:30,009 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:16:30,009 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:16:30,009 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:16:30,163 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2022-12-06 05:16:30,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 235 places, 224 transitions, 520 flow [2022-12-06 05:16:30,349 INFO L130 PetriNetUnfolder]: 8/196 cut-off events. [2022-12-06 05:16:30,350 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 05:16:30,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 196 events. 8/196 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 235 event pairs, 0 based on Foata normal form. 0/187 useless extension candidates. Maximal degree in co-relation 168. Up to 3 conditions per place. [2022-12-06 05:16:30,361 INFO L82 GeneralOperation]: Start removeDead. Operand has 235 places, 224 transitions, 520 flow [2022-12-06 05:16:30,366 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 199 places, 188 transitions, 424 flow [2022-12-06 05:16:30,368 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:30,402 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 199 places, 188 transitions, 424 flow [2022-12-06 05:16:30,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 188 transitions, 424 flow [2022-12-06 05:16:30,448 INFO L130 PetriNetUnfolder]: 8/188 cut-off events. [2022-12-06 05:16:30,448 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 05:16:30,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 188 events. 8/188 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 234 event pairs, 0 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 168. Up to 3 conditions per place. [2022-12-06 05:16:30,467 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 188 transitions, 424 flow [2022-12-06 05:16:30,467 INFO L188 LiptonReduction]: Number of co-enabled transitions 7268 [2022-12-06 05:16:35,218 INFO L203 LiptonReduction]: Total number of compositions: 131 [2022-12-06 05:16:35,241 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:16:35,249 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;@7c873285, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:16:35,249 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-12-06 05:16:35,278 INFO L130 PetriNetUnfolder]: 6/64 cut-off events. [2022-12-06 05:16:35,278 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 05:16:35,286 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:35,286 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:35,287 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 05:16:35,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:35,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1625495205, now seen corresponding path program 1 times [2022-12-06 05:16:35,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:35,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925648709] [2022-12-06 05:16:35,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:35,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:35,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:35,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:35,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925648709] [2022-12-06 05:16:35,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925648709] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:35,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:35,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:16:35,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951534296] [2022-12-06 05:16:35,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:35,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 05:16:35,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:35,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 05:16:35,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 05:16:35,487 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 65 [2022-12-06 05:16:35,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 65 transitions, 178 flow. Second operand has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:35,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:35,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 65 [2022-12-06 05:16:35,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:37,808 INFO L130 PetriNetUnfolder]: 19745/26241 cut-off events. [2022-12-06 05:16:37,809 INFO L131 PetriNetUnfolder]: For 3807/3807 co-relation queries the response was YES. [2022-12-06 05:16:37,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56610 conditions, 26241 events. 19745/26241 cut-off events. For 3807/3807 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 135170 event pairs, 18645 based on Foata normal form. 220/24996 useless extension candidates. Maximal degree in co-relation 55869. Up to 25797 conditions per place. [2022-12-06 05:16:37,939 INFO L137 encePairwiseOnDemand]: 63/65 looper letters, 47 selfloop transitions, 0 changer transitions 0/63 dead transitions. [2022-12-06 05:16:37,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 63 transitions, 268 flow [2022-12-06 05:16:37,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 05:16:37,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 05:16:37,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 81 transitions. [2022-12-06 05:16:37,947 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6230769230769231 [2022-12-06 05:16:37,948 INFO L175 Difference]: Start difference. First operand has 78 places, 65 transitions, 178 flow. Second operand 2 states and 81 transitions. [2022-12-06 05:16:37,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 63 transitions, 268 flow [2022-12-06 05:16:37,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 63 transitions, 236 flow, removed 0 selfloop flow, removed 12 redundant places. [2022-12-06 05:16:37,996 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 142 flow [2022-12-06 05:16:37,998 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=142, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2022-12-06 05:16:38,001 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, -11 predicate places. [2022-12-06 05:16:38,001 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:38,001 INFO L89 Accepts]: Start accepts. Operand has 67 places, 63 transitions, 142 flow [2022-12-06 05:16:38,005 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:38,006 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:38,006 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 63 transitions, 142 flow [2022-12-06 05:16:38,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 63 transitions, 142 flow [2022-12-06 05:16:38,014 INFO L130 PetriNetUnfolder]: 4/63 cut-off events. [2022-12-06 05:16:38,014 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:16:38,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 63 events. 4/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2022-12-06 05:16:38,015 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 63 transitions, 142 flow [2022-12-06 05:16:38,015 INFO L188 LiptonReduction]: Number of co-enabled transitions 1976 [2022-12-06 05:16:38,084 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:16:38,085 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 05:16:38,086 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 142 flow [2022-12-06 05:16:38,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:38,086 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:38,086 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:38,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:16:38,086 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 05:16:38,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:38,087 INFO L85 PathProgramCache]: Analyzing trace with hash 728934078, now seen corresponding path program 1 times [2022-12-06 05:16:38,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:38,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986968923] [2022-12-06 05:16:38,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:38,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:39,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:39,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:39,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986968923] [2022-12-06 05:16:39,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986968923] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:39,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:39,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-06 05:16:39,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605752557] [2022-12-06 05:16:39,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:39,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 05:16:39,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:39,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 05:16:39,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2022-12-06 05:16:39,139 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 63 [2022-12-06 05:16:39,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 142 flow. Second operand has 16 states, 16 states have (on average 14.9375) internal successors, (239), 16 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:39,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:39,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 63 [2022-12-06 05:16:39,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:46,153 INFO L130 PetriNetUnfolder]: 58208/75071 cut-off events. [2022-12-06 05:16:46,153 INFO L131 PetriNetUnfolder]: For 2018/2018 co-relation queries the response was YES. [2022-12-06 05:16:46,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152458 conditions, 75071 events. 58208/75071 cut-off events. For 2018/2018 co-relation queries the response was YES. Maximal size of possible extension queue 1447. Compared 382331 event pairs, 9220 based on Foata normal form. 1/71933 useless extension candidates. Maximal degree in co-relation 65989. Up to 54330 conditions per place. [2022-12-06 05:16:46,536 INFO L137 encePairwiseOnDemand]: 45/63 looper letters, 460 selfloop transitions, 150 changer transitions 20/642 dead transitions. [2022-12-06 05:16:46,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 642 transitions, 2706 flow [2022-12-06 05:16:46,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-06 05:16:46,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2022-12-06 05:16:46,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 1087 transitions. [2022-12-06 05:16:46,544 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4540517961570593 [2022-12-06 05:16:46,544 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 142 flow. Second operand 38 states and 1087 transitions. [2022-12-06 05:16:46,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 642 transitions, 2706 flow [2022-12-06 05:16:46,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 642 transitions, 2706 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 05:16:46,554 INFO L231 Difference]: Finished difference. Result has 117 places, 224 transitions, 931 flow [2022-12-06 05:16:46,555 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=931, PETRI_PLACES=117, PETRI_TRANSITIONS=224} [2022-12-06 05:16:46,560 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 39 predicate places. [2022-12-06 05:16:46,560 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:46,560 INFO L89 Accepts]: Start accepts. Operand has 117 places, 224 transitions, 931 flow [2022-12-06 05:16:46,564 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:46,564 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:46,566 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 224 transitions, 931 flow [2022-12-06 05:16:46,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 224 transitions, 931 flow [2022-12-06 05:16:46,708 INFO L130 PetriNetUnfolder]: 954/1865 cut-off events. [2022-12-06 05:16:46,709 INFO L131 PetriNetUnfolder]: For 448/450 co-relation queries the response was YES. [2022-12-06 05:16:46,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3595 conditions, 1865 events. 954/1865 cut-off events. For 448/450 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 11916 event pairs, 185 based on Foata normal form. 0/1717 useless extension candidates. Maximal degree in co-relation 3555. Up to 1114 conditions per place. [2022-12-06 05:16:46,741 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 224 transitions, 931 flow [2022-12-06 05:16:46,742 INFO L188 LiptonReduction]: Number of co-enabled transitions 5316 [2022-12-06 05:16:46,754 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [725] L81-->L88: Formula: (and (= v_~temp_5~0_53 v_~x_0~0_99) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| (ite (and (not (= (mod v_~f2_3~0_86 256) 0)) (not (= (mod v_~f1_2~0_90 256) 0))) 1 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~f1_2~0=v_~f1_2~0_90, ~f2_3~0=v_~f2_3~0_86, ~x_0~0=v_~x_0~0_99} OutVars{~f1_2~0=v_~f1_2~0_90, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~f2_3~0=v_~f2_3~0_86, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, ~x_0~0=v_~x_0~0_99, ~temp_5~0=v_~temp_5~0_53} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~temp_5~0] and [703] L137-->L144: Formula: (and (= v_~f2_9~0_72 1) (= (+ v_~temp_11~0_41 1) v_~y_7~0_71)) InVars {~temp_11~0=v_~temp_11~0_41} OutVars{~f2_9~0=v_~f2_9~0_72, ~temp_11~0=v_~temp_11~0_41, ~y_7~0=v_~y_7~0_71} AuxVars[] AssignedVars[~f2_9~0, ~y_7~0] [2022-12-06 05:16:46,794 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [725] L81-->L88: Formula: (and (= v_~temp_5~0_53 v_~x_0~0_99) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| (ite (and (not (= (mod v_~f2_3~0_86 256) 0)) (not (= (mod v_~f1_2~0_90 256) 0))) 1 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~f1_2~0=v_~f1_2~0_90, ~f2_3~0=v_~f2_3~0_86, ~x_0~0=v_~x_0~0_99} OutVars{~f1_2~0=v_~f1_2~0_90, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~f2_3~0=v_~f2_3~0_86, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, ~x_0~0=v_~x_0~0_99, ~temp_5~0=v_~temp_5~0_53} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~temp_5~0] and [612] L119-->L126: Formula: (and (not (= 0 |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (and (not (= (mod v_~f1_8~0_21 256) 0)) (not (= (mod v_~f2_9~0_22 256) 0))) 1 0)) (= v_~temp_10~0_11 v_~y_7~0_11) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) InVars {~f2_9~0=v_~f2_9~0_22, ~y_7~0=v_~y_7~0_11, ~f1_8~0=v_~f1_8~0_21} OutVars{thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~f2_9~0=v_~f2_9~0_22, ~temp_10~0=v_~temp_10~0_11, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, ~y_7~0=v_~y_7~0_11, ~f1_8~0=v_~f1_8~0_21} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~temp_10~0, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-06 05:16:46,855 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [725] L81-->L88: Formula: (and (= v_~temp_5~0_53 v_~x_0~0_99) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| (ite (and (not (= (mod v_~f2_3~0_86 256) 0)) (not (= (mod v_~f1_2~0_90 256) 0))) 1 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~f1_2~0=v_~f1_2~0_90, ~f2_3~0=v_~f2_3~0_86, ~x_0~0=v_~x_0~0_99} OutVars{~f1_2~0=v_~f1_2~0_90, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~f2_3~0=v_~f2_3~0_86, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, ~x_0~0=v_~x_0~0_99, ~temp_5~0=v_~temp_5~0_53} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~temp_5~0] and [716] L63-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork5_#res#1.base_15| 0) (= v_~y_1~0_109 (+ v_~temp_4~0_43 1)) (= |v_thread2Thread1of1ForFork5_#res#1.offset_15| 0)) InVars {~temp_4~0=v_~temp_4~0_43} OutVars{~temp_4~0=v_~temp_4~0_43, thread2Thread1of1ForFork5_#res#1.offset=|v_thread2Thread1of1ForFork5_#res#1.offset_15|, ~y_1~0=v_~y_1~0_109, thread2Thread1of1ForFork5_#res#1.base=|v_thread2Thread1of1ForFork5_#res#1.base_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork5_#res#1.offset, ~y_1~0, thread2Thread1of1ForFork5_#res#1.base] [2022-12-06 05:16:46,934 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [725] L81-->L88: Formula: (and (= v_~temp_5~0_53 v_~x_0~0_99) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| (ite (and (not (= (mod v_~f2_3~0_86 256) 0)) (not (= (mod v_~f1_2~0_90 256) 0))) 1 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~f1_2~0=v_~f1_2~0_90, ~f2_3~0=v_~f2_3~0_86, ~x_0~0=v_~x_0~0_99} OutVars{~f1_2~0=v_~f1_2~0_90, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~f2_3~0=v_~f2_3~0_86, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, ~x_0~0=v_~x_0~0_99, ~temp_5~0=v_~temp_5~0_53} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~temp_5~0] and [736] L56-->L63: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_13|)) (= v_~y_1~0_129 v_~temp_4~0_63) (= |v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_13| (ite (and (not (= (mod v_~f1_2~0_103 256) 0)) (not (= (mod v_~f2_3~0_98 256) 0))) 1 0)) (= |v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_13| |v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_13|)) InVars {~f1_2~0=v_~f1_2~0_103, ~f2_3~0=v_~f2_3~0_98, ~y_1~0=v_~y_1~0_129} OutVars{~temp_4~0=v_~temp_4~0_63, ~f1_2~0=v_~f1_2~0_103, ~f2_3~0=v_~f2_3~0_98, thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_13|, ~y_1~0=v_~y_1~0_129, thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_13|} AuxVars[] AssignedVars[~temp_4~0, thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1] [2022-12-06 05:16:47,010 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [725] L81-->L88: Formula: (and (= v_~temp_5~0_53 v_~x_0~0_99) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| (ite (and (not (= (mod v_~f2_3~0_86 256) 0)) (not (= (mod v_~f1_2~0_90 256) 0))) 1 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~f1_2~0=v_~f1_2~0_90, ~f2_3~0=v_~f2_3~0_86, ~x_0~0=v_~x_0~0_99} OutVars{~f1_2~0=v_~f1_2~0_90, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~f2_3~0=v_~f2_3~0_86, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, ~x_0~0=v_~x_0~0_99, ~temp_5~0=v_~temp_5~0_53} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~temp_5~0] and [546] $Ultimate##0-->L112: Formula: (= v_~temp_10~0_1 v_~x_6~0_2) InVars {~x_6~0=v_~x_6~0_2} OutVars{~temp_10~0=v_~temp_10~0_1, ~x_6~0=v_~x_6~0_2} AuxVars[] AssignedVars[~temp_10~0] [2022-12-06 05:16:47,036 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [725] L81-->L88: Formula: (and (= v_~temp_5~0_53 v_~x_0~0_99) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| (ite (and (not (= (mod v_~f2_3~0_86 256) 0)) (not (= (mod v_~f1_2~0_90 256) 0))) 1 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~f1_2~0=v_~f1_2~0_90, ~f2_3~0=v_~f2_3~0_86, ~x_0~0=v_~x_0~0_99} OutVars{~f1_2~0=v_~f1_2~0_90, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~f2_3~0=v_~f2_3~0_86, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, ~x_0~0=v_~x_0~0_99, ~temp_5~0=v_~temp_5~0_53} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~temp_5~0] and [703] L137-->L144: Formula: (and (= v_~f2_9~0_72 1) (= (+ v_~temp_11~0_41 1) v_~y_7~0_71)) InVars {~temp_11~0=v_~temp_11~0_41} OutVars{~f2_9~0=v_~f2_9~0_72, ~temp_11~0=v_~temp_11~0_41, ~y_7~0=v_~y_7~0_71} AuxVars[] AssignedVars[~f2_9~0, ~y_7~0] [2022-12-06 05:16:47,068 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [725] L81-->L88: Formula: (and (= v_~temp_5~0_53 v_~x_0~0_99) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| (ite (and (not (= (mod v_~f2_3~0_86 256) 0)) (not (= (mod v_~f1_2~0_90 256) 0))) 1 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~f1_2~0=v_~f1_2~0_90, ~f2_3~0=v_~f2_3~0_86, ~x_0~0=v_~x_0~0_99} OutVars{~f1_2~0=v_~f1_2~0_90, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~f2_3~0=v_~f2_3~0_86, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, ~x_0~0=v_~x_0~0_99, ~temp_5~0=v_~temp_5~0_53} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~temp_5~0] and [617] L112-->L119: Formula: (and (= (+ v_~temp_10~0_15 1) v_~x_6~0_24) (= v_~f1_8~0_26 1)) InVars {~temp_10~0=v_~temp_10~0_15} OutVars{~temp_10~0=v_~temp_10~0_15, ~x_6~0=v_~x_6~0_24, ~f1_8~0=v_~f1_8~0_26} AuxVars[] AssignedVars[~x_6~0, ~f1_8~0] [2022-12-06 05:16:47,101 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [725] L81-->L88: Formula: (and (= v_~temp_5~0_53 v_~x_0~0_99) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| (ite (and (not (= (mod v_~f2_3~0_86 256) 0)) (not (= (mod v_~f1_2~0_90 256) 0))) 1 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~f1_2~0=v_~f1_2~0_90, ~f2_3~0=v_~f2_3~0_86, ~x_0~0=v_~x_0~0_99} OutVars{~f1_2~0=v_~f1_2~0_90, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~f2_3~0=v_~f2_3~0_86, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, ~x_0~0=v_~x_0~0_99, ~temp_5~0=v_~temp_5~0_53} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~temp_5~0] and [716] L63-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork5_#res#1.base_15| 0) (= v_~y_1~0_109 (+ v_~temp_4~0_43 1)) (= |v_thread2Thread1of1ForFork5_#res#1.offset_15| 0)) InVars {~temp_4~0=v_~temp_4~0_43} OutVars{~temp_4~0=v_~temp_4~0_43, thread2Thread1of1ForFork5_#res#1.offset=|v_thread2Thread1of1ForFork5_#res#1.offset_15|, ~y_1~0=v_~y_1~0_109, thread2Thread1of1ForFork5_#res#1.base=|v_thread2Thread1of1ForFork5_#res#1.base_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork5_#res#1.offset, ~y_1~0, thread2Thread1of1ForFork5_#res#1.base] [2022-12-06 05:16:47,220 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [612] L119-->L126: Formula: (and (not (= 0 |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (and (not (= (mod v_~f1_8~0_21 256) 0)) (not (= (mod v_~f2_9~0_22 256) 0))) 1 0)) (= v_~temp_10~0_11 v_~y_7~0_11) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) InVars {~f2_9~0=v_~f2_9~0_22, ~y_7~0=v_~y_7~0_11, ~f1_8~0=v_~f1_8~0_21} OutVars{thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~f2_9~0=v_~f2_9~0_22, ~temp_10~0=v_~temp_10~0_11, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, ~y_7~0=v_~y_7~0_11, ~f1_8~0=v_~f1_8~0_21} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~temp_10~0, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [737] L88-->thread3EXIT: Formula: (and (= v_~x_0~0_117 (+ v_~temp_5~0_71 1)) (= |v_thread3Thread1of1ForFork0_#res#1.offset_9| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_9| 0)) InVars {~temp_5~0=v_~temp_5~0_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_9|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_9|, ~x_0~0=v_~x_0~0_117, ~temp_5~0=v_~temp_5~0_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base, ~x_0~0] [2022-12-06 05:16:47,257 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [612] L119-->L126: Formula: (and (not (= 0 |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (and (not (= (mod v_~f1_8~0_21 256) 0)) (not (= (mod v_~f2_9~0_22 256) 0))) 1 0)) (= v_~temp_10~0_11 v_~y_7~0_11) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) InVars {~f2_9~0=v_~f2_9~0_22, ~y_7~0=v_~y_7~0_11, ~f1_8~0=v_~f1_8~0_21} OutVars{thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~f2_9~0=v_~f2_9~0_22, ~temp_10~0=v_~temp_10~0_11, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, ~y_7~0=v_~y_7~0_11, ~f1_8~0=v_~f1_8~0_21} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~temp_10~0, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [646] L144-->L151: Formula: (and (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_13| |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_13|) (= v_~temp_11~0_25 v_~x_6~0_42) (not (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_13| 0)) (= (ite (and (not (= (mod v_~f2_9~0_44 256) 0)) (not (= (mod v_~f1_8~0_48 256) 0))) 1 0) |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_13|)) InVars {~f2_9~0=v_~f2_9~0_44, ~x_6~0=v_~x_6~0_42, ~f1_8~0=v_~f1_8~0_48} OutVars{thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_13|, ~f2_9~0=v_~f2_9~0_44, ~x_6~0=v_~x_6~0_42, ~temp_11~0=v_~temp_11~0_25, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_13|, ~f1_8~0=v_~f1_8~0_48} AuxVars[] AssignedVars[thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~temp_11~0, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1] [2022-12-06 05:16:47,324 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [667] L49-->L56: Formula: (and (= v_~f1_2~0_54 1) (= (+ v_~temp_4~0_23 1) v_~x_0~0_45)) InVars {~temp_4~0=v_~temp_4~0_23} OutVars{~temp_4~0=v_~temp_4~0_23, ~f1_2~0=v_~f1_2~0_54, ~x_0~0=v_~x_0~0_45} AuxVars[] AssignedVars[~f1_2~0, ~x_0~0] and [703] L137-->L144: Formula: (and (= v_~f2_9~0_72 1) (= (+ v_~temp_11~0_41 1) v_~y_7~0_71)) InVars {~temp_11~0=v_~temp_11~0_41} OutVars{~f2_9~0=v_~f2_9~0_72, ~temp_11~0=v_~temp_11~0_41, ~y_7~0=v_~y_7~0_71} AuxVars[] AssignedVars[~f2_9~0, ~y_7~0] [2022-12-06 05:16:47,341 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [667] L49-->L56: Formula: (and (= v_~f1_2~0_54 1) (= (+ v_~temp_4~0_23 1) v_~x_0~0_45)) InVars {~temp_4~0=v_~temp_4~0_23} OutVars{~temp_4~0=v_~temp_4~0_23, ~f1_2~0=v_~f1_2~0_54, ~x_0~0=v_~x_0~0_45} AuxVars[] AssignedVars[~f1_2~0, ~x_0~0] and [617] L112-->L119: Formula: (and (= (+ v_~temp_10~0_15 1) v_~x_6~0_24) (= v_~f1_8~0_26 1)) InVars {~temp_10~0=v_~temp_10~0_15} OutVars{~temp_10~0=v_~temp_10~0_15, ~x_6~0=v_~x_6~0_24, ~f1_8~0=v_~f1_8~0_26} AuxVars[] AssignedVars[~x_6~0, ~f1_8~0] [2022-12-06 05:16:47,357 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [667] L49-->L56: Formula: (and (= v_~f1_2~0_54 1) (= (+ v_~temp_4~0_23 1) v_~x_0~0_45)) InVars {~temp_4~0=v_~temp_4~0_23} OutVars{~temp_4~0=v_~temp_4~0_23, ~f1_2~0=v_~f1_2~0_54, ~x_0~0=v_~x_0~0_45} AuxVars[] AssignedVars[~f1_2~0, ~x_0~0] and [640] L74-->L81: Formula: (and (= (+ v_~temp_5~0_17 1) v_~y_1~0_23) (= v_~f2_3~0_24 1)) InVars {~temp_5~0=v_~temp_5~0_17} OutVars{~f2_3~0=v_~f2_3~0_24, ~y_1~0=v_~y_1~0_23, ~temp_5~0=v_~temp_5~0_17} AuxVars[] AssignedVars[~f2_3~0, ~y_1~0] [2022-12-06 05:16:47,405 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [667] L49-->L56: Formula: (and (= v_~f1_2~0_54 1) (= (+ v_~temp_4~0_23 1) v_~x_0~0_45)) InVars {~temp_4~0=v_~temp_4~0_23} OutVars{~temp_4~0=v_~temp_4~0_23, ~f1_2~0=v_~f1_2~0_54, ~x_0~0=v_~x_0~0_45} AuxVars[] AssignedVars[~f1_2~0, ~x_0~0] and [506] $Ultimate##0-->L74: Formula: (= v_~temp_5~0_3 v_~y_1~0_4) InVars {~y_1~0=v_~y_1~0_4} OutVars{~y_1~0=v_~y_1~0_4, ~temp_5~0=v_~temp_5~0_3} AuxVars[] AssignedVars[~temp_5~0] [2022-12-06 05:16:47,434 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [736] L56-->L63: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_13|)) (= v_~y_1~0_129 v_~temp_4~0_63) (= |v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_13| (ite (and (not (= (mod v_~f1_2~0_103 256) 0)) (not (= (mod v_~f2_3~0_98 256) 0))) 1 0)) (= |v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_13| |v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_13|)) InVars {~f1_2~0=v_~f1_2~0_103, ~f2_3~0=v_~f2_3~0_98, ~y_1~0=v_~y_1~0_129} OutVars{~temp_4~0=v_~temp_4~0_63, ~f1_2~0=v_~f1_2~0_103, ~f2_3~0=v_~f2_3~0_98, thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_13|, ~y_1~0=v_~y_1~0_129, thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_13|} AuxVars[] AssignedVars[~temp_4~0, thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1] and [703] L137-->L144: Formula: (and (= v_~f2_9~0_72 1) (= (+ v_~temp_11~0_41 1) v_~y_7~0_71)) InVars {~temp_11~0=v_~temp_11~0_41} OutVars{~f2_9~0=v_~f2_9~0_72, ~temp_11~0=v_~temp_11~0_41, ~y_7~0=v_~y_7~0_71} AuxVars[] AssignedVars[~f2_9~0, ~y_7~0] [2022-12-06 05:16:47,504 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [736] L56-->L63: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_13|)) (= v_~y_1~0_129 v_~temp_4~0_63) (= |v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_13| (ite (and (not (= (mod v_~f1_2~0_103 256) 0)) (not (= (mod v_~f2_3~0_98 256) 0))) 1 0)) (= |v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_13| |v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_13|)) InVars {~f1_2~0=v_~f1_2~0_103, ~f2_3~0=v_~f2_3~0_98, ~y_1~0=v_~y_1~0_129} OutVars{~temp_4~0=v_~temp_4~0_63, ~f1_2~0=v_~f1_2~0_103, ~f2_3~0=v_~f2_3~0_98, thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_13|, ~y_1~0=v_~y_1~0_129, thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_13|} AuxVars[] AssignedVars[~temp_4~0, thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1] and [612] L119-->L126: Formula: (and (not (= 0 |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (and (not (= (mod v_~f1_8~0_21 256) 0)) (not (= (mod v_~f2_9~0_22 256) 0))) 1 0)) (= v_~temp_10~0_11 v_~y_7~0_11) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) InVars {~f2_9~0=v_~f2_9~0_22, ~y_7~0=v_~y_7~0_11, ~f1_8~0=v_~f1_8~0_21} OutVars{thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~f2_9~0=v_~f2_9~0_22, ~temp_10~0=v_~temp_10~0_11, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, ~y_7~0=v_~y_7~0_11, ~f1_8~0=v_~f1_8~0_21} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~temp_10~0, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-06 05:16:47,563 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [736] L56-->L63: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_13|)) (= v_~y_1~0_129 v_~temp_4~0_63) (= |v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_13| (ite (and (not (= (mod v_~f1_2~0_103 256) 0)) (not (= (mod v_~f2_3~0_98 256) 0))) 1 0)) (= |v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_13| |v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_13|)) InVars {~f1_2~0=v_~f1_2~0_103, ~f2_3~0=v_~f2_3~0_98, ~y_1~0=v_~y_1~0_129} OutVars{~temp_4~0=v_~temp_4~0_63, ~f1_2~0=v_~f1_2~0_103, ~f2_3~0=v_~f2_3~0_98, thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_13|, ~y_1~0=v_~y_1~0_129, thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_13|} AuxVars[] AssignedVars[~temp_4~0, thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1] and [737] L88-->thread3EXIT: Formula: (and (= v_~x_0~0_117 (+ v_~temp_5~0_71 1)) (= |v_thread3Thread1of1ForFork0_#res#1.offset_9| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_9| 0)) InVars {~temp_5~0=v_~temp_5~0_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_9|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_9|, ~x_0~0=v_~x_0~0_117, ~temp_5~0=v_~temp_5~0_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base, ~x_0~0] [2022-12-06 05:16:47,605 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [736] L56-->L63: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_13|)) (= v_~y_1~0_129 v_~temp_4~0_63) (= |v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_13| (ite (and (not (= (mod v_~f1_2~0_103 256) 0)) (not (= (mod v_~f2_3~0_98 256) 0))) 1 0)) (= |v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_13| |v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_13|)) InVars {~f1_2~0=v_~f1_2~0_103, ~f2_3~0=v_~f2_3~0_98, ~y_1~0=v_~y_1~0_129} OutVars{~temp_4~0=v_~temp_4~0_63, ~f1_2~0=v_~f1_2~0_103, ~f2_3~0=v_~f2_3~0_98, thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_13|, ~y_1~0=v_~y_1~0_129, thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_13|} AuxVars[] AssignedVars[~temp_4~0, thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1] and [725] L81-->L88: Formula: (and (= v_~temp_5~0_53 v_~x_0~0_99) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| (ite (and (not (= (mod v_~f2_3~0_86 256) 0)) (not (= (mod v_~f1_2~0_90 256) 0))) 1 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~f1_2~0=v_~f1_2~0_90, ~f2_3~0=v_~f2_3~0_86, ~x_0~0=v_~x_0~0_99} OutVars{~f1_2~0=v_~f1_2~0_90, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~f2_3~0=v_~f2_3~0_86, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, ~x_0~0=v_~x_0~0_99, ~temp_5~0=v_~temp_5~0_53} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~temp_5~0] [2022-12-06 05:16:47,693 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [546] $Ultimate##0-->L112: Formula: (= v_~temp_10~0_1 v_~x_6~0_2) InVars {~x_6~0=v_~x_6~0_2} OutVars{~temp_10~0=v_~temp_10~0_1, ~x_6~0=v_~x_6~0_2} AuxVars[] AssignedVars[~temp_10~0] and [703] L137-->L144: Formula: (and (= v_~f2_9~0_72 1) (= (+ v_~temp_11~0_41 1) v_~y_7~0_71)) InVars {~temp_11~0=v_~temp_11~0_41} OutVars{~f2_9~0=v_~f2_9~0_72, ~temp_11~0=v_~temp_11~0_41, ~y_7~0=v_~y_7~0_71} AuxVars[] AssignedVars[~f2_9~0, ~y_7~0] [2022-12-06 05:16:47,719 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [546] $Ultimate##0-->L112: Formula: (= v_~temp_10~0_1 v_~x_6~0_2) InVars {~x_6~0=v_~x_6~0_2} OutVars{~temp_10~0=v_~temp_10~0_1, ~x_6~0=v_~x_6~0_2} AuxVars[] AssignedVars[~temp_10~0] and [716] L63-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork5_#res#1.base_15| 0) (= v_~y_1~0_109 (+ v_~temp_4~0_43 1)) (= |v_thread2Thread1of1ForFork5_#res#1.offset_15| 0)) InVars {~temp_4~0=v_~temp_4~0_43} OutVars{~temp_4~0=v_~temp_4~0_43, thread2Thread1of1ForFork5_#res#1.offset=|v_thread2Thread1of1ForFork5_#res#1.offset_15|, ~y_1~0=v_~y_1~0_109, thread2Thread1of1ForFork5_#res#1.base=|v_thread2Thread1of1ForFork5_#res#1.base_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork5_#res#1.offset, ~y_1~0, thread2Thread1of1ForFork5_#res#1.base] [2022-12-06 05:16:47,737 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [546] $Ultimate##0-->L112: Formula: (= v_~temp_10~0_1 v_~x_6~0_2) InVars {~x_6~0=v_~x_6~0_2} OutVars{~temp_10~0=v_~temp_10~0_1, ~x_6~0=v_~x_6~0_2} AuxVars[] AssignedVars[~temp_10~0] and [725] L81-->L88: Formula: (and (= v_~temp_5~0_53 v_~x_0~0_99) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| (ite (and (not (= (mod v_~f2_3~0_86 256) 0)) (not (= (mod v_~f1_2~0_90 256) 0))) 1 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~f1_2~0=v_~f1_2~0_90, ~f2_3~0=v_~f2_3~0_86, ~x_0~0=v_~x_0~0_99} OutVars{~f1_2~0=v_~f1_2~0_90, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~f2_3~0=v_~f2_3~0_86, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, ~x_0~0=v_~x_0~0_99, ~temp_5~0=v_~temp_5~0_53} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~temp_5~0] [2022-12-06 05:16:47,774 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [757] L119-->thread5EXIT: Formula: (and (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_29| |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_29|) (= v_~temp_10~0_105 v_~y_7~0_138) (= (ite (and (not (= (mod v_~f2_9~0_142 256) 0)) (not (= (mod v_~f1_8~0_144 256) 0))) 1 0) |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_29|) (= v_~y_7~0_137 (+ v_~temp_10~0_105 1)) (= |v_thread5Thread1of1ForFork2_#res#1.offset_17| 0) (= |v_thread5Thread1of1ForFork2_#res#1.base_17| 0) (not (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_29| 0))) InVars {~f2_9~0=v_~f2_9~0_142, ~y_7~0=v_~y_7~0_138, ~f1_8~0=v_~f1_8~0_144} OutVars{thread5Thread1of1ForFork2_#res#1.offset=|v_thread5Thread1of1ForFork2_#res#1.offset_17|, thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_29|, ~f2_9~0=v_~f2_9~0_142, ~temp_10~0=v_~temp_10~0_105, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_29|, ~y_7~0=v_~y_7~0_137, ~f1_8~0=v_~f1_8~0_144, thread5Thread1of1ForFork2_#res#1.base=|v_thread5Thread1of1ForFork2_#res#1.base_17|} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_#res#1.offset, thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~temp_10~0, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~y_7~0, thread5Thread1of1ForFork2_#res#1.base] and [646] L144-->L151: Formula: (and (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_13| |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_13|) (= v_~temp_11~0_25 v_~x_6~0_42) (not (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_13| 0)) (= (ite (and (not (= (mod v_~f2_9~0_44 256) 0)) (not (= (mod v_~f1_8~0_48 256) 0))) 1 0) |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_13|)) InVars {~f2_9~0=v_~f2_9~0_44, ~x_6~0=v_~x_6~0_42, ~f1_8~0=v_~f1_8~0_48} OutVars{thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_13|, ~f2_9~0=v_~f2_9~0_44, ~x_6~0=v_~x_6~0_42, ~temp_11~0=v_~temp_11~0_25, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_13|, ~f1_8~0=v_~f1_8~0_48} AuxVars[] AssignedVars[thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~temp_11~0, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1] [2022-12-06 05:16:47,914 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L49-->L63: Formula: (and (= |v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_25| (ite (and (not (= (mod v_~f1_2~0_178 256) 0)) (not (= 0 (mod v_~f2_3~0_174 256)))) 1 0)) (= |v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_25| |v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_25|) (= v_~x_0~0_196 (+ v_~temp_4~0_114 1)) (= v_~f1_2~0_178 1) (not (= 0 |v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_25|)) (= v_~y_1~0_195 v_~temp_4~0_113)) InVars {~temp_4~0=v_~temp_4~0_114, ~f2_3~0=v_~f2_3~0_174, ~y_1~0=v_~y_1~0_195} OutVars{~temp_4~0=v_~temp_4~0_113, ~f1_2~0=v_~f1_2~0_178, ~f2_3~0=v_~f2_3~0_174, thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_25|, ~y_1~0=v_~y_1~0_195, thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_25|, ~x_0~0=v_~x_0~0_196} AuxVars[] AssignedVars[~temp_4~0, ~f1_2~0, thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1, ~x_0~0] and [640] L74-->L81: Formula: (and (= (+ v_~temp_5~0_17 1) v_~y_1~0_23) (= v_~f2_3~0_24 1)) InVars {~temp_5~0=v_~temp_5~0_17} OutVars{~f2_3~0=v_~f2_3~0_24, ~y_1~0=v_~y_1~0_23, ~temp_5~0=v_~temp_5~0_17} AuxVars[] AssignedVars[~f2_3~0, ~y_1~0] [2022-12-06 05:16:47,958 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L49-->L63: Formula: (and (= |v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_25| (ite (and (not (= (mod v_~f1_2~0_178 256) 0)) (not (= 0 (mod v_~f2_3~0_174 256)))) 1 0)) (= |v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_25| |v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_25|) (= v_~x_0~0_196 (+ v_~temp_4~0_114 1)) (= v_~f1_2~0_178 1) (not (= 0 |v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_25|)) (= v_~y_1~0_195 v_~temp_4~0_113)) InVars {~temp_4~0=v_~temp_4~0_114, ~f2_3~0=v_~f2_3~0_174, ~y_1~0=v_~y_1~0_195} OutVars{~temp_4~0=v_~temp_4~0_113, ~f1_2~0=v_~f1_2~0_178, ~f2_3~0=v_~f2_3~0_174, thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_25|, ~y_1~0=v_~y_1~0_195, thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_25|, ~x_0~0=v_~x_0~0_196} AuxVars[] AssignedVars[~temp_4~0, ~f1_2~0, thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1, ~x_0~0] and [703] L137-->L144: Formula: (and (= v_~f2_9~0_72 1) (= (+ v_~temp_11~0_41 1) v_~y_7~0_71)) InVars {~temp_11~0=v_~temp_11~0_41} OutVars{~f2_9~0=v_~f2_9~0_72, ~temp_11~0=v_~temp_11~0_41, ~y_7~0=v_~y_7~0_71} AuxVars[] AssignedVars[~f2_9~0, ~y_7~0] [2022-12-06 05:16:48,004 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L49-->L63: Formula: (and (= |v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_25| (ite (and (not (= (mod v_~f1_2~0_178 256) 0)) (not (= 0 (mod v_~f2_3~0_174 256)))) 1 0)) (= |v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_25| |v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_25|) (= v_~x_0~0_196 (+ v_~temp_4~0_114 1)) (= v_~f1_2~0_178 1) (not (= 0 |v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_25|)) (= v_~y_1~0_195 v_~temp_4~0_113)) InVars {~temp_4~0=v_~temp_4~0_114, ~f2_3~0=v_~f2_3~0_174, ~y_1~0=v_~y_1~0_195} OutVars{~temp_4~0=v_~temp_4~0_113, ~f1_2~0=v_~f1_2~0_178, ~f2_3~0=v_~f2_3~0_174, thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_25|, ~y_1~0=v_~y_1~0_195, thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_25|, ~x_0~0=v_~x_0~0_196} AuxVars[] AssignedVars[~temp_4~0, ~f1_2~0, thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1, ~x_0~0] and [506] $Ultimate##0-->L74: Formula: (= v_~temp_5~0_3 v_~y_1~0_4) InVars {~y_1~0=v_~y_1~0_4} OutVars{~y_1~0=v_~y_1~0_4, ~temp_5~0=v_~temp_5~0_3} AuxVars[] AssignedVars[~temp_5~0] [2022-12-06 05:16:48,045 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L49-->L63: Formula: (and (= |v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_25| (ite (and (not (= (mod v_~f1_2~0_178 256) 0)) (not (= 0 (mod v_~f2_3~0_174 256)))) 1 0)) (= |v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_25| |v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_25|) (= v_~x_0~0_196 (+ v_~temp_4~0_114 1)) (= v_~f1_2~0_178 1) (not (= 0 |v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_25|)) (= v_~y_1~0_195 v_~temp_4~0_113)) InVars {~temp_4~0=v_~temp_4~0_114, ~f2_3~0=v_~f2_3~0_174, ~y_1~0=v_~y_1~0_195} OutVars{~temp_4~0=v_~temp_4~0_113, ~f1_2~0=v_~f1_2~0_178, ~f2_3~0=v_~f2_3~0_174, thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_25|, ~y_1~0=v_~y_1~0_195, thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_25|, ~x_0~0=v_~x_0~0_196} AuxVars[] AssignedVars[~temp_4~0, ~f1_2~0, thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1, ~x_0~0] and [617] L112-->L119: Formula: (and (= (+ v_~temp_10~0_15 1) v_~x_6~0_24) (= v_~f1_8~0_26 1)) InVars {~temp_10~0=v_~temp_10~0_15} OutVars{~temp_10~0=v_~temp_10~0_15, ~x_6~0=v_~x_6~0_24, ~f1_8~0=v_~f1_8~0_26} AuxVars[] AssignedVars[~x_6~0, ~f1_8~0] [2022-12-06 05:16:48,110 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [764] L49-->L74: Formula: (and (= v_~x_0~0_198 (+ v_~temp_4~0_117 1)) (= v_~y_1~0_197 v_~temp_5~0_131) (= v_~f1_2~0_180 1)) InVars {~temp_4~0=v_~temp_4~0_117, ~y_1~0=v_~y_1~0_197} OutVars{~temp_4~0=v_~temp_4~0_117, ~f1_2~0=v_~f1_2~0_180, ~y_1~0=v_~y_1~0_197, ~x_0~0=v_~x_0~0_198, ~temp_5~0=v_~temp_5~0_131} AuxVars[] AssignedVars[~f1_2~0, ~x_0~0, ~temp_5~0] and [617] L112-->L119: Formula: (and (= (+ v_~temp_10~0_15 1) v_~x_6~0_24) (= v_~f1_8~0_26 1)) InVars {~temp_10~0=v_~temp_10~0_15} OutVars{~temp_10~0=v_~temp_10~0_15, ~x_6~0=v_~x_6~0_24, ~f1_8~0=v_~f1_8~0_26} AuxVars[] AssignedVars[~x_6~0, ~f1_8~0] [2022-12-06 05:16:48,154 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [764] L49-->L74: Formula: (and (= v_~x_0~0_198 (+ v_~temp_4~0_117 1)) (= v_~y_1~0_197 v_~temp_5~0_131) (= v_~f1_2~0_180 1)) InVars {~temp_4~0=v_~temp_4~0_117, ~y_1~0=v_~y_1~0_197} OutVars{~temp_4~0=v_~temp_4~0_117, ~f1_2~0=v_~f1_2~0_180, ~y_1~0=v_~y_1~0_197, ~x_0~0=v_~x_0~0_198, ~temp_5~0=v_~temp_5~0_131} AuxVars[] AssignedVars[~f1_2~0, ~x_0~0, ~temp_5~0] and [703] L137-->L144: Formula: (and (= v_~f2_9~0_72 1) (= (+ v_~temp_11~0_41 1) v_~y_7~0_71)) InVars {~temp_11~0=v_~temp_11~0_41} OutVars{~f2_9~0=v_~f2_9~0_72, ~temp_11~0=v_~temp_11~0_41, ~y_7~0=v_~y_7~0_71} AuxVars[] AssignedVars[~f2_9~0, ~y_7~0] [2022-12-06 05:16:48,175 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [764] L49-->L74: Formula: (and (= v_~x_0~0_198 (+ v_~temp_4~0_117 1)) (= v_~y_1~0_197 v_~temp_5~0_131) (= v_~f1_2~0_180 1)) InVars {~temp_4~0=v_~temp_4~0_117, ~y_1~0=v_~y_1~0_197} OutVars{~temp_4~0=v_~temp_4~0_117, ~f1_2~0=v_~f1_2~0_180, ~y_1~0=v_~y_1~0_197, ~x_0~0=v_~x_0~0_198, ~temp_5~0=v_~temp_5~0_131} AuxVars[] AssignedVars[~f1_2~0, ~x_0~0, ~temp_5~0] and [736] L56-->L63: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_13|)) (= v_~y_1~0_129 v_~temp_4~0_63) (= |v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_13| (ite (and (not (= (mod v_~f1_2~0_103 256) 0)) (not (= (mod v_~f2_3~0_98 256) 0))) 1 0)) (= |v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_13| |v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_13|)) InVars {~f1_2~0=v_~f1_2~0_103, ~f2_3~0=v_~f2_3~0_98, ~y_1~0=v_~y_1~0_129} OutVars{~temp_4~0=v_~temp_4~0_63, ~f1_2~0=v_~f1_2~0_103, ~f2_3~0=v_~f2_3~0_98, thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_13|, ~y_1~0=v_~y_1~0_129, thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_13|} AuxVars[] AssignedVars[~temp_4~0, thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1] [2022-12-06 05:16:48,233 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [725] L81-->L88: Formula: (and (= v_~temp_5~0_53 v_~x_0~0_99) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| (ite (and (not (= (mod v_~f2_3~0_86 256) 0)) (not (= (mod v_~f1_2~0_90 256) 0))) 1 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~f1_2~0=v_~f1_2~0_90, ~f2_3~0=v_~f2_3~0_86, ~x_0~0=v_~x_0~0_99} OutVars{~f1_2~0=v_~f1_2~0_90, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~f2_3~0=v_~f2_3~0_86, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, ~x_0~0=v_~x_0~0_99, ~temp_5~0=v_~temp_5~0_53} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~temp_5~0] and [758] L119-->thread3EXIT: Formula: (and (= v_~temp_10~0_107 v_~y_7~0_141) (= v_~x_0~0_188 (+ v_~temp_5~0_127 1)) (not (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_31| 0)) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_31| |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31|) (= |v_thread3Thread1of1ForFork0_#res#1.base_19| 0) (= (ite (and (not (= (mod v_~f1_8~0_146 256) 0)) (not (= (mod v_~f2_9~0_144 256) 0))) 1 0) |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31|) (= |v_thread3Thread1of1ForFork0_#res#1.offset_19| 0)) InVars {~f2_9~0=v_~f2_9~0_144, ~y_7~0=v_~y_7~0_141, ~temp_5~0=v_~temp_5~0_127, ~f1_8~0=v_~f1_8~0_146} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_19|, thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31|, ~f2_9~0=v_~f2_9~0_144, ~temp_10~0=v_~temp_10~0_107, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_19|, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_31|, ~x_0~0=v_~x_0~0_188, ~y_7~0=v_~y_7~0_141, ~temp_5~0=v_~temp_5~0_127, ~f1_8~0=v_~f1_8~0_146} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~temp_10~0, thread3Thread1of1ForFork0_#res#1.base, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~x_0~0] [2022-12-06 05:16:48,304 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [725] L81-->L88: Formula: (and (= v_~temp_5~0_53 v_~x_0~0_99) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| (ite (and (not (= (mod v_~f2_3~0_86 256) 0)) (not (= (mod v_~f1_2~0_90 256) 0))) 1 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~f1_2~0=v_~f1_2~0_90, ~f2_3~0=v_~f2_3~0_86, ~x_0~0=v_~x_0~0_99} OutVars{~f1_2~0=v_~f1_2~0_90, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~f2_3~0=v_~f2_3~0_86, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, ~x_0~0=v_~x_0~0_99, ~temp_5~0=v_~temp_5~0_53} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~temp_5~0] and [774] L119-->L151: Formula: (let ((.cse0 (ite (and (not (= (mod v_~f1_8~0_156 256) 0)) (not (= (mod v_~f2_9~0_156 256) 0))) 1 0))) (and (= |v_thread5Thread1of1ForFork2_#res#1.offset_19| 0) (= .cse0 |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_37|) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_37| |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_37|) (= v_~y_7~0_153 (+ v_~temp_10~0_123 1)) (= |v_thread5Thread1of1ForFork2_#res#1.base_19| 0) (= v_~temp_11~0_113 v_~x_6~0_179) (= v_~temp_10~0_123 v_~y_7~0_154) (= .cse0 |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_25|) (not (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_37| 0)) (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_25| |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_25|))) InVars {~f2_9~0=v_~f2_9~0_156, ~x_6~0=v_~x_6~0_179, ~y_7~0=v_~y_7~0_154, ~f1_8~0=v_~f1_8~0_156} OutVars{thread5Thread1of1ForFork2_#res#1.offset=|v_thread5Thread1of1ForFork2_#res#1.offset_19|, thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_37|, thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_25|, ~f2_9~0=v_~f2_9~0_156, ~temp_10~0=v_~temp_10~0_123, ~x_6~0=v_~x_6~0_179, ~temp_11~0=v_~temp_11~0_113, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_25|, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_37|, ~y_7~0=v_~y_7~0_153, ~f1_8~0=v_~f1_8~0_156, thread5Thread1of1ForFork2_#res#1.base=|v_thread5Thread1of1ForFork2_#res#1.base_19|} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_#res#1.offset, thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~temp_10~0, ~temp_11~0, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~y_7~0, thread5Thread1of1ForFork2_#res#1.base] [2022-12-06 05:16:48,436 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [725] L81-->L88: Formula: (and (= v_~temp_5~0_53 v_~x_0~0_99) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| (ite (and (not (= (mod v_~f2_3~0_86 256) 0)) (not (= (mod v_~f1_2~0_90 256) 0))) 1 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~f1_2~0=v_~f1_2~0_90, ~f2_3~0=v_~f2_3~0_86, ~x_0~0=v_~x_0~0_99} OutVars{~f1_2~0=v_~f1_2~0_90, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~f2_3~0=v_~f2_3~0_86, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, ~x_0~0=v_~x_0~0_99, ~temp_5~0=v_~temp_5~0_53} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~temp_5~0] and [698] L126-->thread5EXIT: Formula: (and (= |v_thread5Thread1of1ForFork2_#res#1.base_9| 0) (= |v_thread5Thread1of1ForFork2_#res#1.offset_9| 0) (= v_~y_7~0_61 (+ v_~temp_10~0_35 1))) InVars {~temp_10~0=v_~temp_10~0_35} OutVars{thread5Thread1of1ForFork2_#res#1.offset=|v_thread5Thread1of1ForFork2_#res#1.offset_9|, ~temp_10~0=v_~temp_10~0_35, ~y_7~0=v_~y_7~0_61, thread5Thread1of1ForFork2_#res#1.base=|v_thread5Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_#res#1.offset, ~y_7~0, thread5Thread1of1ForFork2_#res#1.base] [2022-12-06 05:16:48,473 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [725] L81-->L88: Formula: (and (= v_~temp_5~0_53 v_~x_0~0_99) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| (ite (and (not (= (mod v_~f2_3~0_86 256) 0)) (not (= (mod v_~f1_2~0_90 256) 0))) 1 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~f1_2~0=v_~f1_2~0_90, ~f2_3~0=v_~f2_3~0_86, ~x_0~0=v_~x_0~0_99} OutVars{~f1_2~0=v_~f1_2~0_90, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~f2_3~0=v_~f2_3~0_86, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, ~x_0~0=v_~x_0~0_99, ~temp_5~0=v_~temp_5~0_53} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~temp_5~0] and [759] L119-->L151: Formula: (let ((.cse0 (ite (and (not (= (mod v_~f2_9~0_146 256) 0)) (not (= (mod v_~f1_8~0_148 256) 0))) 1 0))) (and (= v_~temp_11~0_105 v_~x_6~0_165) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_33| |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|) (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_23| |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_23| 0)) (= .cse0 |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|) (= .cse0 |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_23|) (= v_~temp_10~0_109 v_~y_7~0_143))) InVars {~f2_9~0=v_~f2_9~0_146, ~x_6~0=v_~x_6~0_165, ~y_7~0=v_~y_7~0_143, ~f1_8~0=v_~f1_8~0_148} OutVars{thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|, thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_23|, ~f2_9~0=v_~f2_9~0_146, ~temp_10~0=v_~temp_10~0_109, ~x_6~0=v_~x_6~0_165, ~temp_11~0=v_~temp_11~0_105, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_23|, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|, ~y_7~0=v_~y_7~0_143, ~f1_8~0=v_~f1_8~0_148} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~temp_10~0, ~temp_11~0, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-06 05:16:48,546 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [725] L81-->L88: Formula: (and (= v_~temp_5~0_53 v_~x_0~0_99) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| (ite (and (not (= (mod v_~f2_3~0_86 256) 0)) (not (= (mod v_~f1_2~0_90 256) 0))) 1 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~f1_2~0=v_~f1_2~0_90, ~f2_3~0=v_~f2_3~0_86, ~x_0~0=v_~x_0~0_99} OutVars{~f1_2~0=v_~f1_2~0_90, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~f2_3~0=v_~f2_3~0_86, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, ~x_0~0=v_~x_0~0_99, ~temp_5~0=v_~temp_5~0_53} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~temp_5~0] and [646] L144-->L151: Formula: (and (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_13| |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_13|) (= v_~temp_11~0_25 v_~x_6~0_42) (not (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_13| 0)) (= (ite (and (not (= (mod v_~f2_9~0_44 256) 0)) (not (= (mod v_~f1_8~0_48 256) 0))) 1 0) |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_13|)) InVars {~f2_9~0=v_~f2_9~0_44, ~x_6~0=v_~x_6~0_42, ~f1_8~0=v_~f1_8~0_48} OutVars{thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_13|, ~f2_9~0=v_~f2_9~0_44, ~x_6~0=v_~x_6~0_42, ~temp_11~0=v_~temp_11~0_25, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_13|, ~f1_8~0=v_~f1_8~0_48} AuxVars[] AssignedVars[thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~temp_11~0, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1] [2022-12-06 05:16:48,777 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [498] $Ultimate##0-->L49: Formula: (= v_~x_0~0_2 v_~temp_4~0_1) InVars {~x_0~0=v_~x_0~0_2} OutVars{~temp_4~0=v_~temp_4~0_1, ~x_0~0=v_~x_0~0_2} AuxVars[] AssignedVars[~temp_4~0] and [640] L74-->L81: Formula: (and (= (+ v_~temp_5~0_17 1) v_~y_1~0_23) (= v_~f2_3~0_24 1)) InVars {~temp_5~0=v_~temp_5~0_17} OutVars{~f2_3~0=v_~f2_3~0_24, ~y_1~0=v_~y_1~0_23, ~temp_5~0=v_~temp_5~0_17} AuxVars[] AssignedVars[~f2_3~0, ~y_1~0] [2022-12-06 05:16:48,789 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [498] $Ultimate##0-->L49: Formula: (= v_~x_0~0_2 v_~temp_4~0_1) InVars {~x_0~0=v_~x_0~0_2} OutVars{~temp_4~0=v_~temp_4~0_1, ~x_0~0=v_~x_0~0_2} AuxVars[] AssignedVars[~temp_4~0] and [703] L137-->L144: Formula: (and (= v_~f2_9~0_72 1) (= (+ v_~temp_11~0_41 1) v_~y_7~0_71)) InVars {~temp_11~0=v_~temp_11~0_41} OutVars{~f2_9~0=v_~f2_9~0_72, ~temp_11~0=v_~temp_11~0_41, ~y_7~0=v_~y_7~0_71} AuxVars[] AssignedVars[~f2_9~0, ~y_7~0] [2022-12-06 05:16:48,823 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [498] $Ultimate##0-->L49: Formula: (= v_~x_0~0_2 v_~temp_4~0_1) InVars {~x_0~0=v_~x_0~0_2} OutVars{~temp_4~0=v_~temp_4~0_1, ~x_0~0=v_~x_0~0_2} AuxVars[] AssignedVars[~temp_4~0] and [617] L112-->L119: Formula: (and (= (+ v_~temp_10~0_15 1) v_~x_6~0_24) (= v_~f1_8~0_26 1)) InVars {~temp_10~0=v_~temp_10~0_15} OutVars{~temp_10~0=v_~temp_10~0_15, ~x_6~0=v_~x_6~0_24, ~f1_8~0=v_~f1_8~0_26} AuxVars[] AssignedVars[~x_6~0, ~f1_8~0] [2022-12-06 05:16:49,064 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L144-->L151: Formula: (and (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_13| |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_13|) (= v_~temp_11~0_25 v_~x_6~0_42) (not (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_13| 0)) (= (ite (and (not (= (mod v_~f2_9~0_44 256) 0)) (not (= (mod v_~f1_8~0_48 256) 0))) 1 0) |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_13|)) InVars {~f2_9~0=v_~f2_9~0_44, ~x_6~0=v_~x_6~0_42, ~f1_8~0=v_~f1_8~0_48} OutVars{thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_13|, ~f2_9~0=v_~f2_9~0_44, ~x_6~0=v_~x_6~0_42, ~temp_11~0=v_~temp_11~0_25, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_13|, ~f1_8~0=v_~f1_8~0_48} AuxVars[] AssignedVars[thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~temp_11~0, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1] and [716] L63-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork5_#res#1.base_15| 0) (= v_~y_1~0_109 (+ v_~temp_4~0_43 1)) (= |v_thread2Thread1of1ForFork5_#res#1.offset_15| 0)) InVars {~temp_4~0=v_~temp_4~0_43} OutVars{~temp_4~0=v_~temp_4~0_43, thread2Thread1of1ForFork5_#res#1.offset=|v_thread2Thread1of1ForFork5_#res#1.offset_15|, ~y_1~0=v_~y_1~0_109, thread2Thread1of1ForFork5_#res#1.base=|v_thread2Thread1of1ForFork5_#res#1.base_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork5_#res#1.offset, ~y_1~0, thread2Thread1of1ForFork5_#res#1.base] [2022-12-06 05:16:49,141 INFO L203 LiptonReduction]: Total number of compositions: 12 [2022-12-06 05:16:49,142 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2582 [2022-12-06 05:16:49,142 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 212 transitions, 1048 flow [2022-12-06 05:16:49,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 14.9375) internal successors, (239), 16 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:49,143 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:49,143 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:49,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:16:49,143 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 05:16:49,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:49,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1218799188, now seen corresponding path program 1 times [2022-12-06 05:16:49,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:49,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56822727] [2022-12-06 05:16:49,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:49,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:49,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:49,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:49,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56822727] [2022-12-06 05:16:49,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56822727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:49,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:49,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:49,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727420589] [2022-12-06 05:16:49,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:49,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:49,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:49,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:49,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:49,442 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 105 [2022-12-06 05:16:49,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 212 transitions, 1048 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:49,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:49,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 105 [2022-12-06 05:16:49,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:52,252 INFO L130 PetriNetUnfolder]: 29128/38908 cut-off events. [2022-12-06 05:16:52,252 INFO L131 PetriNetUnfolder]: For 58916/59078 co-relation queries the response was YES. [2022-12-06 05:16:52,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108692 conditions, 38908 events. 29128/38908 cut-off events. For 58916/59078 co-relation queries the response was YES. Maximal size of possible extension queue 1115. Compared 208735 event pairs, 13108 based on Foata normal form. 800/37442 useless extension candidates. Maximal degree in co-relation 107172. Up to 32277 conditions per place. [2022-12-06 05:16:52,470 INFO L137 encePairwiseOnDemand]: 92/105 looper letters, 227 selfloop transitions, 7 changer transitions 0/251 dead transitions. [2022-12-06 05:16:52,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 251 transitions, 1570 flow [2022-12-06 05:16:52,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:52,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:52,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 200 transitions. [2022-12-06 05:16:52,471 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2022-12-06 05:16:52,471 INFO L175 Difference]: Start difference. First operand has 105 places, 212 transitions, 1048 flow. Second operand 4 states and 200 transitions. [2022-12-06 05:16:52,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 251 transitions, 1570 flow [2022-12-06 05:16:52,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 251 transitions, 1514 flow, removed 28 selfloop flow, removed 5 redundant places. [2022-12-06 05:16:52,636 INFO L231 Difference]: Finished difference. Result has 103 places, 201 transitions, 918 flow [2022-12-06 05:16:52,636 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=918, PETRI_PLACES=103, PETRI_TRANSITIONS=201} [2022-12-06 05:16:52,637 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 25 predicate places. [2022-12-06 05:16:52,637 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:52,637 INFO L89 Accepts]: Start accepts. Operand has 103 places, 201 transitions, 918 flow [2022-12-06 05:16:52,641 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:52,642 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:52,642 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 201 transitions, 918 flow [2022-12-06 05:16:52,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 201 transitions, 918 flow [2022-12-06 05:16:52,723 INFO L130 PetriNetUnfolder]: 765/1534 cut-off events. [2022-12-06 05:16:52,723 INFO L131 PetriNetUnfolder]: For 253/267 co-relation queries the response was YES. [2022-12-06 05:16:52,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2948 conditions, 1534 events. 765/1534 cut-off events. For 253/267 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 9898 event pairs, 230 based on Foata normal form. 0/1387 useless extension candidates. Maximal degree in co-relation 2911. Up to 871 conditions per place. [2022-12-06 05:16:52,738 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 201 transitions, 918 flow [2022-12-06 05:16:52,738 INFO L188 LiptonReduction]: Number of co-enabled transitions 4296 [2022-12-06 05:16:52,850 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:52,851 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 214 [2022-12-06 05:16:52,851 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 201 transitions, 927 flow [2022-12-06 05:16:52,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:52,851 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:52,851 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:52,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:16:52,852 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 05:16:52,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:52,852 INFO L85 PathProgramCache]: Analyzing trace with hash 2119649255, now seen corresponding path program 1 times [2022-12-06 05:16:52,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:52,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813525307] [2022-12-06 05:16:52,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:52,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:53,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:53,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:53,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813525307] [2022-12-06 05:16:53,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813525307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:53,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:53,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:16:53,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037834651] [2022-12-06 05:16:53,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:53,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:16:53,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:53,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:16:53,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:16:53,448 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 99 [2022-12-06 05:16:53,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 201 transitions, 927 flow. Second operand has 9 states, 9 states have (on average 16.333333333333332) internal successors, (147), 9 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:53,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:53,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 99 [2022-12-06 05:16:53,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:57,941 INFO L130 PetriNetUnfolder]: 44646/57720 cut-off events. [2022-12-06 05:16:57,942 INFO L131 PetriNetUnfolder]: For 42037/42037 co-relation queries the response was YES. [2022-12-06 05:16:58,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161351 conditions, 57720 events. 44646/57720 cut-off events. For 42037/42037 co-relation queries the response was YES. Maximal size of possible extension queue 1313. Compared 290484 event pairs, 6624 based on Foata normal form. 1/54942 useless extension candidates. Maximal degree in co-relation 159859. Up to 50072 conditions per place. [2022-12-06 05:16:58,381 INFO L137 encePairwiseOnDemand]: 61/99 looper letters, 282 selfloop transitions, 92 changer transitions 22/408 dead transitions. [2022-12-06 05:16:58,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 408 transitions, 2372 flow [2022-12-06 05:16:58,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:16:58,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:16:58,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 443 transitions. [2022-12-06 05:16:58,384 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3442113442113442 [2022-12-06 05:16:58,384 INFO L175 Difference]: Start difference. First operand has 103 places, 201 transitions, 927 flow. Second operand 13 states and 443 transitions. [2022-12-06 05:16:58,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 408 transitions, 2372 flow [2022-12-06 05:16:58,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 408 transitions, 2348 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 05:16:58,765 INFO L231 Difference]: Finished difference. Result has 122 places, 242 transitions, 1467 flow [2022-12-06 05:16:58,765 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=909, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1467, PETRI_PLACES=122, PETRI_TRANSITIONS=242} [2022-12-06 05:16:58,766 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 44 predicate places. [2022-12-06 05:16:58,766 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:58,766 INFO L89 Accepts]: Start accepts. Operand has 122 places, 242 transitions, 1467 flow [2022-12-06 05:16:58,768 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:58,768 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:58,769 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 242 transitions, 1467 flow [2022-12-06 05:16:58,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 242 transitions, 1467 flow [2022-12-06 05:16:58,899 INFO L130 PetriNetUnfolder]: 840/1668 cut-off events. [2022-12-06 05:16:58,899 INFO L131 PetriNetUnfolder]: For 528/541 co-relation queries the response was YES. [2022-12-06 05:16:58,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3696 conditions, 1668 events. 840/1668 cut-off events. For 528/541 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 10839 event pairs, 237 based on Foata normal form. 0/1509 useless extension candidates. Maximal degree in co-relation 3667. Up to 923 conditions per place. [2022-12-06 05:16:58,923 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 242 transitions, 1467 flow [2022-12-06 05:16:58,923 INFO L188 LiptonReduction]: Number of co-enabled transitions 4960 [2022-12-06 05:16:58,927 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [737] L88-->thread3EXIT: Formula: (and (= v_~x_0~0_117 (+ v_~temp_5~0_71 1)) (= |v_thread3Thread1of1ForFork0_#res#1.offset_9| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_9| 0)) InVars {~temp_5~0=v_~temp_5~0_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_9|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_9|, ~x_0~0=v_~x_0~0_117, ~temp_5~0=v_~temp_5~0_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base, ~x_0~0] and [697] L151-->thread6EXIT: Formula: (and (= 0 |v_thread6Thread1of1ForFork4_#res#1.base_9|) (= |v_thread6Thread1of1ForFork4_#res#1.offset_9| 0) (= v_~x_6~0_75 (+ v_~temp_11~0_33 1))) InVars {~temp_11~0=v_~temp_11~0_33} OutVars{thread6Thread1of1ForFork4_#res#1.base=|v_thread6Thread1of1ForFork4_#res#1.base_9|, ~x_6~0=v_~x_6~0_75, thread6Thread1of1ForFork4_#res#1.offset=|v_thread6Thread1of1ForFork4_#res#1.offset_9|, ~temp_11~0=v_~temp_11~0_33} AuxVars[] AssignedVars[thread6Thread1of1ForFork4_#res#1.base, ~x_6~0, thread6Thread1of1ForFork4_#res#1.offset] [2022-12-06 05:16:58,963 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [785] L81-->L151: Formula: (let ((.cse0 (ite (and (not (= (mod v_~f1_8~0_164 256) 0)) (not (= (mod v_~f2_9~0_164 256) 0))) 1 0))) (and (= .cse0 |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_27|) (= v_~temp_10~0_131 v_~y_7~0_164) (= v_~temp_11~0_119 v_~x_6~0_185) (= |v_thread5Thread1of1ForFork2_#res#1.base_21| 0) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_27| |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_27|) (= .cse0 |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49| (ite (and (not (= (mod v_~f1_2~0_214 256) 0)) (not (= 0 (mod v_~f2_3~0_206 256)))) 1 0)) (not (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| 0)) (= |v_thread5Thread1of1ForFork2_#res#1.offset_21| 0) (= v_~x_0~0_228 v_~temp_5~0_153) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|) (= (+ v_~temp_10~0_131 1) v_~y_7~0_163))) InVars {~f2_9~0=v_~f2_9~0_164, ~f1_2~0=v_~f1_2~0_214, ~f2_3~0=v_~f2_3~0_206, ~x_6~0=v_~x_6~0_185, ~y_7~0=v_~y_7~0_164, ~x_0~0=v_~x_0~0_228, ~f1_8~0=v_~f1_8~0_164} OutVars{thread5Thread1of1ForFork2_#res#1.offset=|v_thread5Thread1of1ForFork2_#res#1.offset_21|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, ~f2_3~0=v_~f2_3~0_206, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_41|, ~x_0~0=v_~x_0~0_228, ~f1_8~0=v_~f1_8~0_164, thread5Thread1of1ForFork2_#res#1.base=|v_thread5Thread1of1ForFork2_#res#1.base_21|, thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_27|, ~f2_9~0=v_~f2_9~0_164, ~f1_2~0=v_~f1_2~0_214, ~temp_10~0=v_~temp_10~0_131, ~x_6~0=v_~x_6~0_185, ~temp_11~0=v_~temp_11~0_119, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_27|, ~y_7~0=v_~y_7~0_163, ~temp_5~0=v_~temp_5~0_153} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_#res#1.offset, thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~temp_10~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~temp_11~0, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~y_7~0, ~temp_5~0, thread5Thread1of1ForFork2_#res#1.base] and [808] L88-->thread6EXIT: Formula: (and (= (+ v_~temp_11~0_137 1) v_~x_6~0_205) (= |v_thread3Thread1of1ForFork0_#res#1.offset_31| 0) (= |v_thread6Thread1of1ForFork4_#res#1.base_21| 0) (= |v_thread6Thread1of1ForFork4_#res#1.offset_21| 0) (= (+ v_~temp_5~0_185 1) v_~x_0~0_304) (= |v_thread3Thread1of1ForFork0_#res#1.base_31| 0)) InVars {~temp_11~0=v_~temp_11~0_137, ~temp_5~0=v_~temp_5~0_185} OutVars{thread6Thread1of1ForFork4_#res#1.base=|v_thread6Thread1of1ForFork4_#res#1.base_21|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_31|, ~x_6~0=v_~x_6~0_205, thread6Thread1of1ForFork4_#res#1.offset=|v_thread6Thread1of1ForFork4_#res#1.offset_21|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_31|, ~temp_11~0=v_~temp_11~0_137, ~x_0~0=v_~x_0~0_304, ~temp_5~0=v_~temp_5~0_185} AuxVars[] AssignedVars[thread6Thread1of1ForFork4_#res#1.base, thread3Thread1of1ForFork0_#res#1.offset, ~x_6~0, thread6Thread1of1ForFork4_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base, ~x_0~0] [2022-12-06 05:16:59,156 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:16:59,157 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 391 [2022-12-06 05:16:59,158 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 240 transitions, 1455 flow [2022-12-06 05:16:59,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.333333333333332) internal successors, (147), 9 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:59,158 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:59,158 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:59,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:16:59,158 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 05:16:59,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:59,159 INFO L85 PathProgramCache]: Analyzing trace with hash -844038683, now seen corresponding path program 1 times [2022-12-06 05:16:59,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:59,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820561190] [2022-12-06 05:16:59,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:59,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:00,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:00,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:00,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820561190] [2022-12-06 05:17:00,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820561190] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:00,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:00,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 05:17:00,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260708434] [2022-12-06 05:17:00,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:00,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:17:00,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:00,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:17:00,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:17:00,029 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 99 [2022-12-06 05:17:00,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 240 transitions, 1455 flow. Second operand has 11 states, 11 states have (on average 15.363636363636363) internal successors, (169), 11 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:00,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:00,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 99 [2022-12-06 05:17:00,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:05,165 INFO L130 PetriNetUnfolder]: 45367/58607 cut-off events. [2022-12-06 05:17:05,165 INFO L131 PetriNetUnfolder]: For 43698/43698 co-relation queries the response was YES. [2022-12-06 05:17:05,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172516 conditions, 58607 events. 45367/58607 cut-off events. For 43698/43698 co-relation queries the response was YES. Maximal size of possible extension queue 1349. Compared 293579 event pairs, 5795 based on Foata normal form. 1/56015 useless extension candidates. Maximal degree in co-relation 172488. Up to 48372 conditions per place. [2022-12-06 05:17:05,766 INFO L137 encePairwiseOnDemand]: 59/99 looper letters, 264 selfloop transitions, 97 changer transitions 18/391 dead transitions. [2022-12-06 05:17:05,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 391 transitions, 2651 flow [2022-12-06 05:17:05,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:17:05,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:17:05,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 402 transitions. [2022-12-06 05:17:05,770 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3691460055096419 [2022-12-06 05:17:05,770 INFO L175 Difference]: Start difference. First operand has 119 places, 240 transitions, 1455 flow. Second operand 11 states and 402 transitions. [2022-12-06 05:17:05,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 391 transitions, 2651 flow [2022-12-06 05:17:06,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 391 transitions, 2548 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-12-06 05:17:06,498 INFO L231 Difference]: Finished difference. Result has 126 places, 247 transitions, 1605 flow [2022-12-06 05:17:06,498 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=1352, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1605, PETRI_PLACES=126, PETRI_TRANSITIONS=247} [2022-12-06 05:17:06,499 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 48 predicate places. [2022-12-06 05:17:06,499 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:06,499 INFO L89 Accepts]: Start accepts. Operand has 126 places, 247 transitions, 1605 flow [2022-12-06 05:17:06,501 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:06,501 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:06,501 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 247 transitions, 1605 flow [2022-12-06 05:17:06,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 247 transitions, 1605 flow [2022-12-06 05:17:06,611 INFO L130 PetriNetUnfolder]: 835/1665 cut-off events. [2022-12-06 05:17:06,611 INFO L131 PetriNetUnfolder]: For 746/943 co-relation queries the response was YES. [2022-12-06 05:17:06,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3910 conditions, 1665 events. 835/1665 cut-off events. For 746/943 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 10543 event pairs, 207 based on Foata normal form. 0/1507 useless extension candidates. Maximal degree in co-relation 3863. Up to 936 conditions per place. [2022-12-06 05:17:06,633 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 247 transitions, 1605 flow [2022-12-06 05:17:06,634 INFO L188 LiptonReduction]: Number of co-enabled transitions 5112 [2022-12-06 05:17:06,640 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:17:06,641 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-06 05:17:06,641 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 247 transitions, 1605 flow [2022-12-06 05:17:06,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.363636363636363) internal successors, (169), 11 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:06,642 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:06,642 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:06,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:17:06,642 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 05:17:06,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:06,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1934089540, now seen corresponding path program 1 times [2022-12-06 05:17:06,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:06,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001885358] [2022-12-06 05:17:06,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:06,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:06,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:06,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:06,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001885358] [2022-12-06 05:17:06,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001885358] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:06,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:06,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 05:17:06,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898684105] [2022-12-06 05:17:06,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:06,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:17:06,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:06,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:17:06,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:17:06,991 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 98 [2022-12-06 05:17:06,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 247 transitions, 1605 flow. Second operand has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:06,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:06,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 98 [2022-12-06 05:17:06,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:13,230 INFO L130 PetriNetUnfolder]: 49913/64605 cut-off events. [2022-12-06 05:17:13,230 INFO L131 PetriNetUnfolder]: For 58871/58871 co-relation queries the response was YES. [2022-12-06 05:17:13,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196265 conditions, 64605 events. 49913/64605 cut-off events. For 58871/58871 co-relation queries the response was YES. Maximal size of possible extension queue 1439. Compared 328520 event pairs, 6008 based on Foata normal form. 1/61543 useless extension candidates. Maximal degree in co-relation 194786. Up to 51784 conditions per place. [2022-12-06 05:17:13,800 INFO L137 encePairwiseOnDemand]: 58/98 looper letters, 356 selfloop transitions, 144 changer transitions 21/533 dead transitions. [2022-12-06 05:17:13,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 533 transitions, 3628 flow [2022-12-06 05:17:13,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 05:17:13,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 05:17:13,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 630 transitions. [2022-12-06 05:17:13,804 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32142857142857145 [2022-12-06 05:17:13,804 INFO L175 Difference]: Start difference. First operand has 125 places, 247 transitions, 1605 flow. Second operand 20 states and 630 transitions. [2022-12-06 05:17:13,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 533 transitions, 3628 flow [2022-12-06 05:17:14,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 533 transitions, 3479 flow, removed 3 selfloop flow, removed 8 redundant places. [2022-12-06 05:17:14,477 INFO L231 Difference]: Finished difference. Result has 143 places, 291 transitions, 2154 flow [2022-12-06 05:17:14,477 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=1485, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2154, PETRI_PLACES=143, PETRI_TRANSITIONS=291} [2022-12-06 05:17:14,478 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 65 predicate places. [2022-12-06 05:17:14,478 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:14,478 INFO L89 Accepts]: Start accepts. Operand has 143 places, 291 transitions, 2154 flow [2022-12-06 05:17:14,479 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:14,480 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:14,480 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 291 transitions, 2154 flow [2022-12-06 05:17:14,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 291 transitions, 2154 flow [2022-12-06 05:17:14,640 INFO L130 PetriNetUnfolder]: 967/1990 cut-off events. [2022-12-06 05:17:14,640 INFO L131 PetriNetUnfolder]: For 1583/1757 co-relation queries the response was YES. [2022-12-06 05:17:14,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5347 conditions, 1990 events. 967/1990 cut-off events. For 1583/1757 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 13413 event pairs, 235 based on Foata normal form. 0/1777 useless extension candidates. Maximal degree in co-relation 5309. Up to 1046 conditions per place. [2022-12-06 05:17:14,671 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 291 transitions, 2154 flow [2022-12-06 05:17:14,672 INFO L188 LiptonReduction]: Number of co-enabled transitions 5800 [2022-12-06 05:17:14,675 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [697] L151-->thread6EXIT: Formula: (and (= 0 |v_thread6Thread1of1ForFork4_#res#1.base_9|) (= |v_thread6Thread1of1ForFork4_#res#1.offset_9| 0) (= v_~x_6~0_75 (+ v_~temp_11~0_33 1))) InVars {~temp_11~0=v_~temp_11~0_33} OutVars{thread6Thread1of1ForFork4_#res#1.base=|v_thread6Thread1of1ForFork4_#res#1.base_9|, ~x_6~0=v_~x_6~0_75, thread6Thread1of1ForFork4_#res#1.offset=|v_thread6Thread1of1ForFork4_#res#1.offset_9|, ~temp_11~0=v_~temp_11~0_33} AuxVars[] AssignedVars[thread6Thread1of1ForFork4_#res#1.base, ~x_6~0, thread6Thread1of1ForFork4_#res#1.offset] and [737] L88-->thread3EXIT: Formula: (and (= v_~x_0~0_117 (+ v_~temp_5~0_71 1)) (= |v_thread3Thread1of1ForFork0_#res#1.offset_9| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_9| 0)) InVars {~temp_5~0=v_~temp_5~0_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_9|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_9|, ~x_0~0=v_~x_0~0_117, ~temp_5~0=v_~temp_5~0_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base, ~x_0~0] [2022-12-06 05:17:14,710 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [697] L151-->thread6EXIT: Formula: (and (= 0 |v_thread6Thread1of1ForFork4_#res#1.base_9|) (= |v_thread6Thread1of1ForFork4_#res#1.offset_9| 0) (= v_~x_6~0_75 (+ v_~temp_11~0_33 1))) InVars {~temp_11~0=v_~temp_11~0_33} OutVars{thread6Thread1of1ForFork4_#res#1.base=|v_thread6Thread1of1ForFork4_#res#1.base_9|, ~x_6~0=v_~x_6~0_75, thread6Thread1of1ForFork4_#res#1.offset=|v_thread6Thread1of1ForFork4_#res#1.offset_9|, ~temp_11~0=v_~temp_11~0_33} AuxVars[] AssignedVars[thread6Thread1of1ForFork4_#res#1.base, ~x_6~0, thread6Thread1of1ForFork4_#res#1.offset] and [737] L88-->thread3EXIT: Formula: (and (= v_~x_0~0_117 (+ v_~temp_5~0_71 1)) (= |v_thread3Thread1of1ForFork0_#res#1.offset_9| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_9| 0)) InVars {~temp_5~0=v_~temp_5~0_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_9|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_9|, ~x_0~0=v_~x_0~0_117, ~temp_5~0=v_~temp_5~0_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base, ~x_0~0] [2022-12-06 05:17:14,744 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [697] L151-->thread6EXIT: Formula: (and (= 0 |v_thread6Thread1of1ForFork4_#res#1.base_9|) (= |v_thread6Thread1of1ForFork4_#res#1.offset_9| 0) (= v_~x_6~0_75 (+ v_~temp_11~0_33 1))) InVars {~temp_11~0=v_~temp_11~0_33} OutVars{thread6Thread1of1ForFork4_#res#1.base=|v_thread6Thread1of1ForFork4_#res#1.base_9|, ~x_6~0=v_~x_6~0_75, thread6Thread1of1ForFork4_#res#1.offset=|v_thread6Thread1of1ForFork4_#res#1.offset_9|, ~temp_11~0=v_~temp_11~0_33} AuxVars[] AssignedVars[thread6Thread1of1ForFork4_#res#1.base, ~x_6~0, thread6Thread1of1ForFork4_#res#1.offset] and [737] L88-->thread3EXIT: Formula: (and (= v_~x_0~0_117 (+ v_~temp_5~0_71 1)) (= |v_thread3Thread1of1ForFork0_#res#1.offset_9| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_9| 0)) InVars {~temp_5~0=v_~temp_5~0_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_9|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_9|, ~x_0~0=v_~x_0~0_117, ~temp_5~0=v_~temp_5~0_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base, ~x_0~0] [2022-12-06 05:17:14,827 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [612] L119-->L126: Formula: (and (not (= 0 |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (and (not (= (mod v_~f1_8~0_21 256) 0)) (not (= (mod v_~f2_9~0_22 256) 0))) 1 0)) (= v_~temp_10~0_11 v_~y_7~0_11) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) InVars {~f2_9~0=v_~f2_9~0_22, ~y_7~0=v_~y_7~0_11, ~f1_8~0=v_~f1_8~0_21} OutVars{thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~f2_9~0=v_~f2_9~0_22, ~temp_10~0=v_~temp_10~0_11, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, ~y_7~0=v_~y_7~0_11, ~f1_8~0=v_~f1_8~0_21} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~temp_10~0, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [786] L81-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_51|) (= (ite (and (not (= (mod v_~f1_2~0_216 256) 0)) (not (= (mod v_~f2_3~0_208 256) 0))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (= |v_thread3Thread1of1ForFork0_#res#1.offset_25| 0) (= v_~x_0~0_230 (+ v_~temp_5~0_155 1)) (= v_~x_0~0_231 v_~temp_5~0_155) (= |v_thread3Thread1of1ForFork0_#res#1.base_25| 0) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0))) InVars {~f1_2~0=v_~f1_2~0_216, ~f2_3~0=v_~f2_3~0_208, ~x_0~0=v_~x_0~0_231} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_25|, ~f1_2~0=v_~f1_2~0_216, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, ~f2_3~0=v_~f2_3~0_208, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_51|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_25|, ~x_0~0=v_~x_0~0_230, ~temp_5~0=v_~temp_5~0_155} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, ~x_0~0, ~temp_5~0] [2022-12-06 05:17:14,896 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [612] L119-->L126: Formula: (and (not (= 0 |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (and (not (= (mod v_~f1_8~0_21 256) 0)) (not (= (mod v_~f2_9~0_22 256) 0))) 1 0)) (= v_~temp_10~0_11 v_~y_7~0_11) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) InVars {~f2_9~0=v_~f2_9~0_22, ~y_7~0=v_~y_7~0_11, ~f1_8~0=v_~f1_8~0_21} OutVars{thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~f2_9~0=v_~f2_9~0_22, ~temp_10~0=v_~temp_10~0_11, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, ~y_7~0=v_~y_7~0_11, ~f1_8~0=v_~f1_8~0_21} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~temp_10~0, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [646] L144-->L151: Formula: (and (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_13| |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_13|) (= v_~temp_11~0_25 v_~x_6~0_42) (not (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_13| 0)) (= (ite (and (not (= (mod v_~f2_9~0_44 256) 0)) (not (= (mod v_~f1_8~0_48 256) 0))) 1 0) |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_13|)) InVars {~f2_9~0=v_~f2_9~0_44, ~x_6~0=v_~x_6~0_42, ~f1_8~0=v_~f1_8~0_48} OutVars{thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_13|, ~f2_9~0=v_~f2_9~0_44, ~x_6~0=v_~x_6~0_42, ~temp_11~0=v_~temp_11~0_25, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_13|, ~f1_8~0=v_~f1_8~0_48} AuxVars[] AssignedVars[thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~temp_11~0, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1] [2022-12-06 05:17:14,959 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [612] L119-->L126: Formula: (and (not (= 0 |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (and (not (= (mod v_~f1_8~0_21 256) 0)) (not (= (mod v_~f2_9~0_22 256) 0))) 1 0)) (= v_~temp_10~0_11 v_~y_7~0_11) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) InVars {~f2_9~0=v_~f2_9~0_22, ~y_7~0=v_~y_7~0_11, ~f1_8~0=v_~f1_8~0_21} OutVars{thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~f2_9~0=v_~f2_9~0_22, ~temp_10~0=v_~temp_10~0_11, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, ~y_7~0=v_~y_7~0_11, ~f1_8~0=v_~f1_8~0_21} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~temp_10~0, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [737] L88-->thread3EXIT: Formula: (and (= v_~x_0~0_117 (+ v_~temp_5~0_71 1)) (= |v_thread3Thread1of1ForFork0_#res#1.offset_9| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_9| 0)) InVars {~temp_5~0=v_~temp_5~0_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_9|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_9|, ~x_0~0=v_~x_0~0_117, ~temp_5~0=v_~temp_5~0_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base, ~x_0~0] [2022-12-06 05:17:14,997 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [612] L119-->L126: Formula: (and (not (= 0 |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (and (not (= (mod v_~f1_8~0_21 256) 0)) (not (= (mod v_~f2_9~0_22 256) 0))) 1 0)) (= v_~temp_10~0_11 v_~y_7~0_11) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) InVars {~f2_9~0=v_~f2_9~0_22, ~y_7~0=v_~y_7~0_11, ~f1_8~0=v_~f1_8~0_21} OutVars{thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~f2_9~0=v_~f2_9~0_22, ~temp_10~0=v_~temp_10~0_11, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, ~y_7~0=v_~y_7~0_11, ~f1_8~0=v_~f1_8~0_21} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~temp_10~0, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [789] L81-->L151: Formula: (and (not (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57| (ite (and (not (= 0 (mod v_~f2_3~0_214 256))) (not (= (mod v_~f1_2~0_222 256) 0))) 1 0)) (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|) (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31| (ite (and (not (= (mod v_~f1_8~0_168 256) 0)) (not (= (mod v_~f2_9~0_168 256) 0))) 1 0)) (= v_~x_0~0_238 v_~temp_5~0_161) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_57| 0)) (= v_~temp_11~0_123 v_~x_6~0_189) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_57|)) InVars {~f2_9~0=v_~f2_9~0_168, ~f1_2~0=v_~f1_2~0_222, ~f2_3~0=v_~f2_3~0_214, ~x_6~0=v_~x_6~0_189, ~x_0~0=v_~x_0~0_238, ~f1_8~0=v_~f1_8~0_168} OutVars{thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_31|, ~f2_9~0=v_~f2_9~0_168, ~f1_2~0=v_~f1_2~0_222, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|, ~f2_3~0=v_~f2_3~0_214, ~x_6~0=v_~x_6~0_189, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_57|, ~temp_11~0=v_~temp_11~0_123, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|, ~x_0~0=v_~x_0~0_238, ~f1_8~0=v_~f1_8~0_168, ~temp_5~0=v_~temp_5~0_161} AuxVars[] AssignedVars[thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~temp_11~0, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~temp_5~0] [2022-12-06 05:17:15,111 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [612] L119-->L126: Formula: (and (not (= 0 |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (and (not (= (mod v_~f1_8~0_21 256) 0)) (not (= (mod v_~f2_9~0_22 256) 0))) 1 0)) (= v_~temp_10~0_11 v_~y_7~0_11) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) InVars {~f2_9~0=v_~f2_9~0_22, ~y_7~0=v_~y_7~0_11, ~f1_8~0=v_~f1_8~0_21} OutVars{thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~f2_9~0=v_~f2_9~0_22, ~temp_10~0=v_~temp_10~0_11, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, ~y_7~0=v_~y_7~0_11, ~f1_8~0=v_~f1_8~0_21} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~temp_10~0, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [787] L81-->thread5EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_53| 0)) (= v_~x_0~0_234 v_~temp_5~0_157) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_53|) (= |v_thread5Thread1of1ForFork2_#res#1.base_23| 0) (= |v_thread5Thread1of1ForFork2_#res#1.offset_23| 0) (= (ite (and (not (= (mod v_~f1_2~0_218 256) 0)) (not (= (mod v_~f2_3~0_210 256) 0))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (= v_~y_7~0_167 (+ v_~temp_10~0_133 1))) InVars {~f1_2~0=v_~f1_2~0_218, ~temp_10~0=v_~temp_10~0_133, ~f2_3~0=v_~f2_3~0_210, ~x_0~0=v_~x_0~0_234} OutVars{thread5Thread1of1ForFork2_#res#1.offset=|v_thread5Thread1of1ForFork2_#res#1.offset_23|, ~f1_2~0=v_~f1_2~0_218, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|, ~temp_10~0=v_~temp_10~0_133, ~f2_3~0=v_~f2_3~0_210, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_53|, ~y_7~0=v_~y_7~0_167, ~x_0~0=v_~x_0~0_234, ~temp_5~0=v_~temp_5~0_157, thread5Thread1of1ForFork2_#res#1.base=|v_thread5Thread1of1ForFork2_#res#1.base_23|} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~y_7~0, ~temp_5~0, thread5Thread1of1ForFork2_#res#1.base] [2022-12-06 05:17:15,185 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:17:15,186 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 708 [2022-12-06 05:17:15,186 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 290 transitions, 2170 flow [2022-12-06 05:17:15,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:15,186 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:15,186 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:15,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:17:15,187 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 05:17:15,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:15,187 INFO L85 PathProgramCache]: Analyzing trace with hash 274624445, now seen corresponding path program 1 times [2022-12-06 05:17:15,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:15,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916399215] [2022-12-06 05:17:15,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:15,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:15,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:15,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:15,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916399215] [2022-12-06 05:17:15,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916399215] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:15,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:15,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 05:17:15,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029199511] [2022-12-06 05:17:15,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:15,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:17:15,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:15,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:17:15,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:17:15,546 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 107 [2022-12-06 05:17:15,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 290 transitions, 2170 flow. Second operand has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:15,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:15,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 107 [2022-12-06 05:17:15,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:22,153 INFO L130 PetriNetUnfolder]: 52160/67742 cut-off events. [2022-12-06 05:17:22,153 INFO L131 PetriNetUnfolder]: For 77427/77427 co-relation queries the response was YES. [2022-12-06 05:17:22,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221572 conditions, 67742 events. 52160/67742 cut-off events. For 77427/77427 co-relation queries the response was YES. Maximal size of possible extension queue 1535. Compared 349611 event pairs, 6084 based on Foata normal form. 1/64356 useless extension candidates. Maximal degree in co-relation 221526. Up to 53366 conditions per place. [2022-12-06 05:17:22,761 INFO L137 encePairwiseOnDemand]: 56/107 looper letters, 377 selfloop transitions, 159 changer transitions 26/574 dead transitions. [2022-12-06 05:17:22,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 574 transitions, 4205 flow [2022-12-06 05:17:22,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 05:17:22,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 05:17:22,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 663 transitions. [2022-12-06 05:17:22,775 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30981308411214953 [2022-12-06 05:17:22,775 INFO L175 Difference]: Start difference. First operand has 141 places, 290 transitions, 2170 flow. Second operand 20 states and 663 transitions. [2022-12-06 05:17:22,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 574 transitions, 4205 flow [2022-12-06 05:17:24,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 574 transitions, 4079 flow, removed 4 selfloop flow, removed 7 redundant places. [2022-12-06 05:17:24,187 INFO L231 Difference]: Finished difference. Result has 160 places, 310 transitions, 2564 flow [2022-12-06 05:17:24,187 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=2051, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2564, PETRI_PLACES=160, PETRI_TRANSITIONS=310} [2022-12-06 05:17:24,188 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 82 predicate places. [2022-12-06 05:17:24,188 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:24,188 INFO L89 Accepts]: Start accepts. Operand has 160 places, 310 transitions, 2564 flow [2022-12-06 05:17:24,190 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:24,190 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:24,190 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 310 transitions, 2564 flow [2022-12-06 05:17:24,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 310 transitions, 2564 flow [2022-12-06 05:17:24,388 INFO L130 PetriNetUnfolder]: 993/2087 cut-off events. [2022-12-06 05:17:24,388 INFO L131 PetriNetUnfolder]: For 2590/2764 co-relation queries the response was YES. [2022-12-06 05:17:24,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6305 conditions, 2087 events. 993/2087 cut-off events. For 2590/2764 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 14554 event pairs, 234 based on Foata normal form. 0/1857 useless extension candidates. Maximal degree in co-relation 6224. Up to 1071 conditions per place. [2022-12-06 05:17:24,419 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 310 transitions, 2564 flow [2022-12-06 05:17:24,419 INFO L188 LiptonReduction]: Number of co-enabled transitions 6208 [2022-12-06 05:17:24,422 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:17:24,423 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 235 [2022-12-06 05:17:24,423 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 310 transitions, 2564 flow [2022-12-06 05:17:24,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:24,423 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:24,423 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:24,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:17:24,424 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 05:17:24,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:24,424 INFO L85 PathProgramCache]: Analyzing trace with hash 2136642854, now seen corresponding path program 1 times [2022-12-06 05:17:24,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:24,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262299976] [2022-12-06 05:17:24,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:24,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:24,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:24,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:24,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262299976] [2022-12-06 05:17:24,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262299976] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:24,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:24,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:17:24,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000852047] [2022-12-06 05:17:24,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:24,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:17:24,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:24,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:17:24,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:17:24,908 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 106 [2022-12-06 05:17:24,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 310 transitions, 2564 flow. Second operand has 9 states, 9 states have (on average 16.333333333333332) internal successors, (147), 9 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:24,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:24,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 106 [2022-12-06 05:17:24,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:31,787 INFO L130 PetriNetUnfolder]: 52238/67852 cut-off events. [2022-12-06 05:17:31,788 INFO L131 PetriNetUnfolder]: For 100700/100700 co-relation queries the response was YES. [2022-12-06 05:17:32,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237075 conditions, 67852 events. 52238/67852 cut-off events. For 100700/100700 co-relation queries the response was YES. Maximal size of possible extension queue 1537. Compared 350722 event pairs, 7672 based on Foata normal form. 1/64442 useless extension candidates. Maximal degree in co-relation 236290. Up to 57897 conditions per place. [2022-12-06 05:17:32,513 INFO L137 encePairwiseOnDemand]: 63/106 looper letters, 342 selfloop transitions, 118 changer transitions 14/486 dead transitions. [2022-12-06 05:17:32,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 486 transitions, 4023 flow [2022-12-06 05:17:32,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 05:17:32,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 05:17:32,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 481 transitions. [2022-12-06 05:17:32,515 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32412398921832886 [2022-12-06 05:17:32,515 INFO L175 Difference]: Start difference. First operand has 159 places, 310 transitions, 2564 flow. Second operand 14 states and 481 transitions. [2022-12-06 05:17:32,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 486 transitions, 4023 flow [2022-12-06 05:17:34,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 486 transitions, 3792 flow, removed 13 selfloop flow, removed 14 redundant places. [2022-12-06 05:17:34,715 INFO L231 Difference]: Finished difference. Result has 161 places, 313 transitions, 2634 flow [2022-12-06 05:17:34,715 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=2339, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2634, PETRI_PLACES=161, PETRI_TRANSITIONS=313} [2022-12-06 05:17:34,716 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 83 predicate places. [2022-12-06 05:17:34,716 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:34,716 INFO L89 Accepts]: Start accepts. Operand has 161 places, 313 transitions, 2634 flow [2022-12-06 05:17:34,717 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:34,717 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:34,718 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 313 transitions, 2634 flow [2022-12-06 05:17:34,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 313 transitions, 2634 flow [2022-12-06 05:17:34,858 INFO L130 PetriNetUnfolder]: 1003/2100 cut-off events. [2022-12-06 05:17:34,858 INFO L131 PetriNetUnfolder]: For 2526/2700 co-relation queries the response was YES. [2022-12-06 05:17:34,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6484 conditions, 2100 events. 1003/2100 cut-off events. For 2526/2700 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 14696 event pairs, 239 based on Foata normal form. 0/1870 useless extension candidates. Maximal degree in co-relation 6402. Up to 1080 conditions per place. [2022-12-06 05:17:34,884 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 313 transitions, 2634 flow [2022-12-06 05:17:34,884 INFO L188 LiptonReduction]: Number of co-enabled transitions 6280 [2022-12-06 05:17:34,888 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:17:34,889 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:17:34,889 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 313 transitions, 2634 flow [2022-12-06 05:17:34,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.333333333333332) internal successors, (147), 9 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:34,889 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:34,889 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:34,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:17:34,889 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 05:17:34,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:34,890 INFO L85 PathProgramCache]: Analyzing trace with hash 105452624, now seen corresponding path program 1 times [2022-12-06 05:17:34,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:34,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755603207] [2022-12-06 05:17:34,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:34,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:35,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:35,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:35,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755603207] [2022-12-06 05:17:35,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755603207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:35,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:35,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 05:17:35,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789141225] [2022-12-06 05:17:35,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:35,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:17:35,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:35,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:17:35,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:17:35,286 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 104 [2022-12-06 05:17:35,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 313 transitions, 2634 flow. Second operand has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:35,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:35,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 104 [2022-12-06 05:17:35,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:43,421 INFO L130 PetriNetUnfolder]: 53341/69413 cut-off events. [2022-12-06 05:17:43,421 INFO L131 PetriNetUnfolder]: For 99906/99906 co-relation queries the response was YES. [2022-12-06 05:17:43,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245737 conditions, 69413 events. 53341/69413 cut-off events. For 99906/99906 co-relation queries the response was YES. Maximal size of possible extension queue 1549. Compared 361187 event pairs, 7996 based on Foata normal form. 1/65769 useless extension candidates. Maximal degree in co-relation 243398. Up to 60055 conditions per place. [2022-12-06 05:17:44,279 INFO L137 encePairwiseOnDemand]: 60/104 looper letters, 375 selfloop transitions, 123 changer transitions 22/532 dead transitions. [2022-12-06 05:17:44,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 532 transitions, 4326 flow [2022-12-06 05:17:44,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 05:17:44,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 05:17:44,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 555 transitions. [2022-12-06 05:17:44,282 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31391402714932126 [2022-12-06 05:17:44,282 INFO L175 Difference]: Start difference. First operand has 161 places, 313 transitions, 2634 flow. Second operand 17 states and 555 transitions. [2022-12-06 05:17:44,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 532 transitions, 4326 flow [2022-12-06 05:17:47,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 532 transitions, 4097 flow, removed 5 selfloop flow, removed 11 redundant places. [2022-12-06 05:17:47,036 INFO L231 Difference]: Finished difference. Result has 171 places, 323 transitions, 2779 flow [2022-12-06 05:17:47,037 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=2414, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2779, PETRI_PLACES=171, PETRI_TRANSITIONS=323} [2022-12-06 05:17:47,037 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 93 predicate places. [2022-12-06 05:17:47,037 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:47,037 INFO L89 Accepts]: Start accepts. Operand has 171 places, 323 transitions, 2779 flow [2022-12-06 05:17:47,039 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:47,039 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:47,039 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 323 transitions, 2779 flow [2022-12-06 05:17:47,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 323 transitions, 2779 flow [2022-12-06 05:17:47,187 INFO L130 PetriNetUnfolder]: 1007/2130 cut-off events. [2022-12-06 05:17:47,187 INFO L131 PetriNetUnfolder]: For 3174/3348 co-relation queries the response was YES. [2022-12-06 05:17:47,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6940 conditions, 2130 events. 1007/2130 cut-off events. For 3174/3348 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 15013 event pairs, 240 based on Foata normal form. 0/1896 useless extension candidates. Maximal degree in co-relation 6883. Up to 1088 conditions per place. [2022-12-06 05:17:47,215 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 323 transitions, 2779 flow [2022-12-06 05:17:47,215 INFO L188 LiptonReduction]: Number of co-enabled transitions 6496 [2022-12-06 05:17:47,219 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [725] L81-->L88: Formula: (and (= v_~temp_5~0_53 v_~x_0~0_99) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| (ite (and (not (= (mod v_~f2_3~0_86 256) 0)) (not (= (mod v_~f1_2~0_90 256) 0))) 1 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~f1_2~0=v_~f1_2~0_90, ~f2_3~0=v_~f2_3~0_86, ~x_0~0=v_~x_0~0_99} OutVars{~f1_2~0=v_~f1_2~0_90, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~f2_3~0=v_~f2_3~0_86, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, ~x_0~0=v_~x_0~0_99, ~temp_5~0=v_~temp_5~0_53} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~temp_5~0] and [697] L151-->thread6EXIT: Formula: (and (= 0 |v_thread6Thread1of1ForFork4_#res#1.base_9|) (= |v_thread6Thread1of1ForFork4_#res#1.offset_9| 0) (= v_~x_6~0_75 (+ v_~temp_11~0_33 1))) InVars {~temp_11~0=v_~temp_11~0_33} OutVars{thread6Thread1of1ForFork4_#res#1.base=|v_thread6Thread1of1ForFork4_#res#1.base_9|, ~x_6~0=v_~x_6~0_75, thread6Thread1of1ForFork4_#res#1.offset=|v_thread6Thread1of1ForFork4_#res#1.offset_9|, ~temp_11~0=v_~temp_11~0_33} AuxVars[] AssignedVars[thread6Thread1of1ForFork4_#res#1.base, ~x_6~0, thread6Thread1of1ForFork4_#res#1.offset] [2022-12-06 05:17:47,330 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [813] L119-->thread5EXIT: Formula: (and (= |v_thread5Thread1of1ForFork2_#res#1.base_27| 0) (= v_~y_7~0_187 (+ v_~temp_10~0_147 1)) (= |v_thread5Thread1of1ForFork2_#res#1.offset_27| 0) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_47| |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_47|) (= v_~temp_10~0_147 v_~y_7~0_188) (= (ite (and (not (= (mod v_~f1_8~0_188 256) 0)) (not (= (mod v_~f2_9~0_188 256) 0))) 1 0) |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_47|) (not (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_47| 0))) InVars {~f2_9~0=v_~f2_9~0_188, ~y_7~0=v_~y_7~0_188, ~f1_8~0=v_~f1_8~0_188} OutVars{thread5Thread1of1ForFork2_#res#1.offset=|v_thread5Thread1of1ForFork2_#res#1.offset_27|, thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_47|, ~f2_9~0=v_~f2_9~0_188, ~temp_10~0=v_~temp_10~0_147, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_47|, ~y_7~0=v_~y_7~0_187, ~f1_8~0=v_~f1_8~0_188, thread5Thread1of1ForFork2_#res#1.base=|v_thread5Thread1of1ForFork2_#res#1.base_27|} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_#res#1.offset, thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~temp_10~0, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~y_7~0, thread5Thread1of1ForFork2_#res#1.base] and [737] L88-->thread3EXIT: Formula: (and (= v_~x_0~0_117 (+ v_~temp_5~0_71 1)) (= |v_thread3Thread1of1ForFork0_#res#1.offset_9| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_9| 0)) InVars {~temp_5~0=v_~temp_5~0_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_9|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_9|, ~x_0~0=v_~x_0~0_117, ~temp_5~0=v_~temp_5~0_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base, ~x_0~0] [2022-12-06 05:17:47,400 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [813] L119-->thread5EXIT: Formula: (and (= |v_thread5Thread1of1ForFork2_#res#1.base_27| 0) (= v_~y_7~0_187 (+ v_~temp_10~0_147 1)) (= |v_thread5Thread1of1ForFork2_#res#1.offset_27| 0) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_47| |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_47|) (= v_~temp_10~0_147 v_~y_7~0_188) (= (ite (and (not (= (mod v_~f1_8~0_188 256) 0)) (not (= (mod v_~f2_9~0_188 256) 0))) 1 0) |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_47|) (not (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_47| 0))) InVars {~f2_9~0=v_~f2_9~0_188, ~y_7~0=v_~y_7~0_188, ~f1_8~0=v_~f1_8~0_188} OutVars{thread5Thread1of1ForFork2_#res#1.offset=|v_thread5Thread1of1ForFork2_#res#1.offset_27|, thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_47|, ~f2_9~0=v_~f2_9~0_188, ~temp_10~0=v_~temp_10~0_147, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_47|, ~y_7~0=v_~y_7~0_187, ~f1_8~0=v_~f1_8~0_188, thread5Thread1of1ForFork2_#res#1.base=|v_thread5Thread1of1ForFork2_#res#1.base_27|} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_#res#1.offset, thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~temp_10~0, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~y_7~0, thread5Thread1of1ForFork2_#res#1.base] and [646] L144-->L151: Formula: (and (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_13| |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_13|) (= v_~temp_11~0_25 v_~x_6~0_42) (not (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_13| 0)) (= (ite (and (not (= (mod v_~f2_9~0_44 256) 0)) (not (= (mod v_~f1_8~0_48 256) 0))) 1 0) |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_13|)) InVars {~f2_9~0=v_~f2_9~0_44, ~x_6~0=v_~x_6~0_42, ~f1_8~0=v_~f1_8~0_48} OutVars{thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_13|, ~f2_9~0=v_~f2_9~0_44, ~x_6~0=v_~x_6~0_42, ~temp_11~0=v_~temp_11~0_25, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_13|, ~f1_8~0=v_~f1_8~0_48} AuxVars[] AssignedVars[thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~temp_11~0, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1] [2022-12-06 05:17:47,533 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [813] L119-->thread5EXIT: Formula: (and (= |v_thread5Thread1of1ForFork2_#res#1.base_27| 0) (= v_~y_7~0_187 (+ v_~temp_10~0_147 1)) (= |v_thread5Thread1of1ForFork2_#res#1.offset_27| 0) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_47| |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_47|) (= v_~temp_10~0_147 v_~y_7~0_188) (= (ite (and (not (= (mod v_~f1_8~0_188 256) 0)) (not (= (mod v_~f2_9~0_188 256) 0))) 1 0) |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_47|) (not (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_47| 0))) InVars {~f2_9~0=v_~f2_9~0_188, ~y_7~0=v_~y_7~0_188, ~f1_8~0=v_~f1_8~0_188} OutVars{thread5Thread1of1ForFork2_#res#1.offset=|v_thread5Thread1of1ForFork2_#res#1.offset_27|, thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_47|, ~f2_9~0=v_~f2_9~0_188, ~temp_10~0=v_~temp_10~0_147, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_47|, ~y_7~0=v_~y_7~0_187, ~f1_8~0=v_~f1_8~0_188, thread5Thread1of1ForFork2_#res#1.base=|v_thread5Thread1of1ForFork2_#res#1.base_27|} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_#res#1.offset, thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~temp_10~0, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~y_7~0, thread5Thread1of1ForFork2_#res#1.base] and [725] L81-->L88: Formula: (and (= v_~temp_5~0_53 v_~x_0~0_99) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| (ite (and (not (= (mod v_~f2_3~0_86 256) 0)) (not (= (mod v_~f1_2~0_90 256) 0))) 1 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~f1_2~0=v_~f1_2~0_90, ~f2_3~0=v_~f2_3~0_86, ~x_0~0=v_~x_0~0_99} OutVars{~f1_2~0=v_~f1_2~0_90, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~f2_3~0=v_~f2_3~0_86, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, ~x_0~0=v_~x_0~0_99, ~temp_5~0=v_~temp_5~0_53} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~temp_5~0] [2022-12-06 05:17:47,650 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L144-->L151: Formula: (and (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_13| |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_13|) (= v_~temp_11~0_25 v_~x_6~0_42) (not (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_13| 0)) (= (ite (and (not (= (mod v_~f2_9~0_44 256) 0)) (not (= (mod v_~f1_8~0_48 256) 0))) 1 0) |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_13|)) InVars {~f2_9~0=v_~f2_9~0_44, ~x_6~0=v_~x_6~0_42, ~f1_8~0=v_~f1_8~0_48} OutVars{thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_13|, ~f2_9~0=v_~f2_9~0_44, ~x_6~0=v_~x_6~0_42, ~temp_11~0=v_~temp_11~0_25, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_13|, ~f1_8~0=v_~f1_8~0_48} AuxVars[] AssignedVars[thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~temp_11~0, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1] and [737] L88-->thread3EXIT: Formula: (and (= v_~x_0~0_117 (+ v_~temp_5~0_71 1)) (= |v_thread3Thread1of1ForFork0_#res#1.offset_9| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_9| 0)) InVars {~temp_5~0=v_~temp_5~0_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_9|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_9|, ~x_0~0=v_~x_0~0_117, ~temp_5~0=v_~temp_5~0_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base, ~x_0~0] [2022-12-06 05:17:47,705 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [824] L144-->thread3EXIT: Formula: (and (not (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_45| 0)) (= v_~temp_11~0_155 v_~x_6~0_229) (= v_~x_0~0_336 (+ v_~temp_5~0_211 1)) (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_45| |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_45|) (= |v_thread3Thread1of1ForFork0_#res#1.base_49| 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_49| 0) (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_45| (ite (and (not (= (mod v_~f1_8~0_206 256) 0)) (not (= (mod v_~f2_9~0_206 256) 0))) 1 0))) InVars {~f2_9~0=v_~f2_9~0_206, ~x_6~0=v_~x_6~0_229, ~temp_5~0=v_~temp_5~0_211, ~f1_8~0=v_~f1_8~0_206} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_49|, thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_45|, ~f2_9~0=v_~f2_9~0_206, ~x_6~0=v_~x_6~0_229, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_49|, ~temp_11~0=v_~temp_11~0_155, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_45|, ~x_0~0=v_~x_0~0_336, ~temp_5~0=v_~temp_5~0_211, ~f1_8~0=v_~f1_8~0_206} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, ~temp_11~0, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~x_0~0] and [697] L151-->thread6EXIT: Formula: (and (= 0 |v_thread6Thread1of1ForFork4_#res#1.base_9|) (= |v_thread6Thread1of1ForFork4_#res#1.offset_9| 0) (= v_~x_6~0_75 (+ v_~temp_11~0_33 1))) InVars {~temp_11~0=v_~temp_11~0_33} OutVars{thread6Thread1of1ForFork4_#res#1.base=|v_thread6Thread1of1ForFork4_#res#1.base_9|, ~x_6~0=v_~x_6~0_75, thread6Thread1of1ForFork4_#res#1.offset=|v_thread6Thread1of1ForFork4_#res#1.offset_9|, ~temp_11~0=v_~temp_11~0_33} AuxVars[] AssignedVars[thread6Thread1of1ForFork4_#res#1.base, ~x_6~0, thread6Thread1of1ForFork4_#res#1.offset] [2022-12-06 05:17:47,843 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:17:47,844 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 807 [2022-12-06 05:17:47,844 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 319 transitions, 2773 flow [2022-12-06 05:17:47,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:47,844 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:47,845 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:47,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 05:17:47,845 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 05:17:47,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:47,845 INFO L85 PathProgramCache]: Analyzing trace with hash 56873276, now seen corresponding path program 1 times [2022-12-06 05:17:47,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:47,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901806777] [2022-12-06 05:17:47,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:47,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:48,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:48,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:48,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901806777] [2022-12-06 05:17:48,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901806777] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:48,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:48,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 05:17:48,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367322786] [2022-12-06 05:17:48,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:48,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:17:48,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:48,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:17:48,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:17:48,275 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 110 [2022-12-06 05:17:48,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 319 transitions, 2773 flow. Second operand has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:48,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:48,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 110 [2022-12-06 05:17:48,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:55,872 INFO L130 PetriNetUnfolder]: 52809/68697 cut-off events. [2022-12-06 05:17:55,872 INFO L131 PetriNetUnfolder]: For 115945/115945 co-relation queries the response was YES. [2022-12-06 05:17:56,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252210 conditions, 68697 events. 52809/68697 cut-off events. For 115945/115945 co-relation queries the response was YES. Maximal size of possible extension queue 1559. Compared 356772 event pairs, 6876 based on Foata normal form. 1/65147 useless extension candidates. Maximal degree in co-relation 252147. Up to 58252 conditions per place. [2022-12-06 05:17:56,613 INFO L137 encePairwiseOnDemand]: 59/110 looper letters, 353 selfloop transitions, 131 changer transitions 28/524 dead transitions. [2022-12-06 05:17:56,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 524 transitions, 4388 flow [2022-12-06 05:17:56,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 05:17:56,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 05:17:56,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 549 transitions. [2022-12-06 05:17:56,615 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3119318181818182 [2022-12-06 05:17:56,615 INFO L175 Difference]: Start difference. First operand has 166 places, 319 transitions, 2773 flow. Second operand 16 states and 549 transitions. [2022-12-06 05:17:56,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 524 transitions, 4388 flow [2022-12-06 05:17:59,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 524 transitions, 4210 flow, removed 19 selfloop flow, removed 11 redundant places. [2022-12-06 05:17:59,761 INFO L231 Difference]: Finished difference. Result has 173 places, 319 transitions, 2873 flow [2022-12-06 05:17:59,761 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=2597, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2873, PETRI_PLACES=173, PETRI_TRANSITIONS=319} [2022-12-06 05:17:59,762 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 95 predicate places. [2022-12-06 05:17:59,762 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:59,762 INFO L89 Accepts]: Start accepts. Operand has 173 places, 319 transitions, 2873 flow [2022-12-06 05:17:59,763 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:59,763 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:59,763 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 319 transitions, 2873 flow [2022-12-06 05:17:59,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 319 transitions, 2873 flow [2022-12-06 05:17:59,934 INFO L130 PetriNetUnfolder]: 993/2110 cut-off events. [2022-12-06 05:17:59,934 INFO L131 PetriNetUnfolder]: For 3048/3222 co-relation queries the response was YES. [2022-12-06 05:17:59,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7006 conditions, 2110 events. 993/2110 cut-off events. For 3048/3222 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 14863 event pairs, 235 based on Foata normal form. 0/1877 useless extension candidates. Maximal degree in co-relation 6914. Up to 1072 conditions per place. [2022-12-06 05:17:59,959 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 319 transitions, 2873 flow [2022-12-06 05:17:59,960 INFO L188 LiptonReduction]: Number of co-enabled transitions 6368 [2022-12-06 05:17:59,964 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [820] L81-->thread3EXIT: Formula: (and (= v_~x_0~0_329 v_~temp_5~0_205) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_71|) (= |v_thread3Thread1of1ForFork0_#res#1.offset_45| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_45| 0) (= v_~x_0~0_328 (+ v_~temp_5~0_205 1)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_71| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71| (ite (and (not (= (mod v_~f2_3~0_260 256) 0)) (not (= (mod v_~f1_2~0_262 256) 0))) 1 0))) InVars {~f1_2~0=v_~f1_2~0_262, ~f2_3~0=v_~f2_3~0_260, ~x_0~0=v_~x_0~0_329} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_45|, ~f1_2~0=v_~f1_2~0_262, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71|, ~f2_3~0=v_~f2_3~0_260, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_71|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_45|, ~x_0~0=v_~x_0~0_328, ~temp_5~0=v_~temp_5~0_205} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, ~x_0~0, ~temp_5~0] and [697] L151-->thread6EXIT: Formula: (and (= 0 |v_thread6Thread1of1ForFork4_#res#1.base_9|) (= |v_thread6Thread1of1ForFork4_#res#1.offset_9| 0) (= v_~x_6~0_75 (+ v_~temp_11~0_33 1))) InVars {~temp_11~0=v_~temp_11~0_33} OutVars{thread6Thread1of1ForFork4_#res#1.base=|v_thread6Thread1of1ForFork4_#res#1.base_9|, ~x_6~0=v_~x_6~0_75, thread6Thread1of1ForFork4_#res#1.offset=|v_thread6Thread1of1ForFork4_#res#1.offset_9|, ~temp_11~0=v_~temp_11~0_33} AuxVars[] AssignedVars[thread6Thread1of1ForFork4_#res#1.base, ~x_6~0, thread6Thread1of1ForFork4_#res#1.offset] [2022-12-06 05:18:00,038 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [737] L88-->thread3EXIT: Formula: (and (= v_~x_0~0_117 (+ v_~temp_5~0_71 1)) (= |v_thread3Thread1of1ForFork0_#res#1.offset_9| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_9| 0)) InVars {~temp_5~0=v_~temp_5~0_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_9|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_9|, ~x_0~0=v_~x_0~0_117, ~temp_5~0=v_~temp_5~0_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base, ~x_0~0] and [826] L144-->thread6EXIT: Formula: (and (= |v_thread6Thread1of1ForFork4_#res#1.base_35| 0) (= (+ v_~temp_11~0_159 1) v_~x_6~0_235) (not (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_49| 0)) (= v_~temp_11~0_159 v_~x_6~0_236) (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_49| |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_49|) (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_49| (ite (and (not (= (mod v_~f1_8~0_210 256) 0)) (not (= (mod v_~f2_9~0_210 256) 0))) 1 0)) (= |v_thread6Thread1of1ForFork4_#res#1.offset_35| 0)) InVars {~f2_9~0=v_~f2_9~0_210, ~x_6~0=v_~x_6~0_236, ~f1_8~0=v_~f1_8~0_210} OutVars{thread6Thread1of1ForFork4_#res#1.base=|v_thread6Thread1of1ForFork4_#res#1.base_35|, thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_49|, ~f2_9~0=v_~f2_9~0_210, ~x_6~0=v_~x_6~0_235, thread6Thread1of1ForFork4_#res#1.offset=|v_thread6Thread1of1ForFork4_#res#1.offset_35|, ~temp_11~0=v_~temp_11~0_159, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_49|, ~f1_8~0=v_~f1_8~0_210} AuxVars[] AssignedVars[thread6Thread1of1ForFork4_#res#1.base, thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~x_6~0, thread6Thread1of1ForFork4_#res#1.offset, ~temp_11~0, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1] [2022-12-06 05:18:00,127 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:18:00,128 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 366 [2022-12-06 05:18:00,128 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 317 transitions, 2867 flow [2022-12-06 05:18:00,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:00,128 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:00,128 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:00,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 05:18:00,130 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 05:18:00,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:00,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1853922615, now seen corresponding path program 1 times [2022-12-06 05:18:00,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:00,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140332275] [2022-12-06 05:18:00,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:00,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:00,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:00,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:00,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140332275] [2022-12-06 05:18:00,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140332275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:00,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:00,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 05:18:00,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800488169] [2022-12-06 05:18:00,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:00,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:18:00,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:00,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:18:00,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:18:00,485 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 110 [2022-12-06 05:18:00,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 317 transitions, 2867 flow. Second operand has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:00,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:00,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 110 [2022-12-06 05:18:00,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:08,030 INFO L130 PetriNetUnfolder]: 51930/67448 cut-off events. [2022-12-06 05:18:08,030 INFO L131 PetriNetUnfolder]: For 110535/110535 co-relation queries the response was YES. [2022-12-06 05:18:08,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251451 conditions, 67448 events. 51930/67448 cut-off events. For 110535/110535 co-relation queries the response was YES. Maximal size of possible extension queue 1543. Compared 348083 event pairs, 7292 based on Foata normal form. 1/64054 useless extension candidates. Maximal degree in co-relation 249451. Up to 61021 conditions per place. [2022-12-06 05:18:08,682 INFO L137 encePairwiseOnDemand]: 61/110 looper letters, 290 selfloop transitions, 112 changer transitions 24/438 dead transitions. [2022-12-06 05:18:08,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 438 transitions, 4121 flow [2022-12-06 05:18:08,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:18:08,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:18:08,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 396 transitions. [2022-12-06 05:18:08,683 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-06 05:18:08,683 INFO L175 Difference]: Start difference. First operand has 170 places, 317 transitions, 2867 flow. Second operand 12 states and 396 transitions. [2022-12-06 05:18:08,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 438 transitions, 4121 flow [2022-12-06 05:18:13,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 438 transitions, 3856 flow, removed 5 selfloop flow, removed 12 redundant places. [2022-12-06 05:18:13,654 INFO L231 Difference]: Finished difference. Result has 171 places, 319 transitions, 2891 flow [2022-12-06 05:18:13,654 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=2615, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2891, PETRI_PLACES=171, PETRI_TRANSITIONS=319} [2022-12-06 05:18:13,655 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 93 predicate places. [2022-12-06 05:18:13,655 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:13,655 INFO L89 Accepts]: Start accepts. Operand has 171 places, 319 transitions, 2891 flow [2022-12-06 05:18:13,657 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:13,657 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:13,657 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 319 transitions, 2891 flow [2022-12-06 05:18:13,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 319 transitions, 2891 flow [2022-12-06 05:18:13,904 INFO L130 PetriNetUnfolder]: 989/2087 cut-off events. [2022-12-06 05:18:13,904 INFO L131 PetriNetUnfolder]: For 2860/3034 co-relation queries the response was YES. [2022-12-06 05:18:13,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6777 conditions, 2087 events. 989/2087 cut-off events. For 2860/3034 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 14646 event pairs, 235 based on Foata normal form. 0/1855 useless extension candidates. Maximal degree in co-relation 6685. Up to 1070 conditions per place. [2022-12-06 05:18:13,938 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 168 places, 319 transitions, 2891 flow [2022-12-06 05:18:13,939 INFO L188 LiptonReduction]: Number of co-enabled transitions 6284 [2022-12-06 05:18:13,953 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [822] L119-->L151: Formula: (let ((.cse0 (ite (and (not (= (mod v_~f1_8~0_202 256) 0)) (not (= 0 (mod v_~f2_9~0_202 256)))) 1 0))) (and (= v_~temp_10~0_161 v_~y_7~0_208) (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_43| .cse0) (= (+ v_~temp_10~0_161 1) v_~y_7~0_207) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_61| |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_61|) (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_43| |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_43|) (= |v_thread5Thread1of1ForFork2_#res#1.base_33| 0) (= .cse0 |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_61|) (= |v_thread5Thread1of1ForFork2_#res#1.offset_33| 0) (not (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_43| 0)) (= v_~temp_11~0_153 v_~x_6~0_227))) InVars {~f2_9~0=v_~f2_9~0_202, ~x_6~0=v_~x_6~0_227, ~y_7~0=v_~y_7~0_208, ~f1_8~0=v_~f1_8~0_202} OutVars{thread5Thread1of1ForFork2_#res#1.offset=|v_thread5Thread1of1ForFork2_#res#1.offset_33|, thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_61|, thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_43|, ~f2_9~0=v_~f2_9~0_202, ~temp_10~0=v_~temp_10~0_161, ~x_6~0=v_~x_6~0_227, ~temp_11~0=v_~temp_11~0_153, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_43|, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_61|, ~y_7~0=v_~y_7~0_207, ~f1_8~0=v_~f1_8~0_202, thread5Thread1of1ForFork2_#res#1.base=|v_thread5Thread1of1ForFork2_#res#1.base_33|} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_#res#1.offset, thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~temp_10~0, ~temp_11~0, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~y_7~0, thread5Thread1of1ForFork2_#res#1.base] and [737] L88-->thread3EXIT: Formula: (and (= v_~x_0~0_117 (+ v_~temp_5~0_71 1)) (= |v_thread3Thread1of1ForFork0_#res#1.offset_9| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_9| 0)) InVars {~temp_5~0=v_~temp_5~0_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_9|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_9|, ~x_0~0=v_~x_0~0_117, ~temp_5~0=v_~temp_5~0_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base, ~x_0~0] [2022-12-06 05:18:14,074 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [822] L119-->L151: Formula: (let ((.cse0 (ite (and (not (= (mod v_~f1_8~0_202 256) 0)) (not (= 0 (mod v_~f2_9~0_202 256)))) 1 0))) (and (= v_~temp_10~0_161 v_~y_7~0_208) (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_43| .cse0) (= (+ v_~temp_10~0_161 1) v_~y_7~0_207) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_61| |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_61|) (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_43| |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_43|) (= |v_thread5Thread1of1ForFork2_#res#1.base_33| 0) (= .cse0 |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_61|) (= |v_thread5Thread1of1ForFork2_#res#1.offset_33| 0) (not (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_43| 0)) (= v_~temp_11~0_153 v_~x_6~0_227))) InVars {~f2_9~0=v_~f2_9~0_202, ~x_6~0=v_~x_6~0_227, ~y_7~0=v_~y_7~0_208, ~f1_8~0=v_~f1_8~0_202} OutVars{thread5Thread1of1ForFork2_#res#1.offset=|v_thread5Thread1of1ForFork2_#res#1.offset_33|, thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_61|, thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_43|, ~f2_9~0=v_~f2_9~0_202, ~temp_10~0=v_~temp_10~0_161, ~x_6~0=v_~x_6~0_227, ~temp_11~0=v_~temp_11~0_153, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_43|, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_61|, ~y_7~0=v_~y_7~0_207, ~f1_8~0=v_~f1_8~0_202, thread5Thread1of1ForFork2_#res#1.base=|v_thread5Thread1of1ForFork2_#res#1.base_33|} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_#res#1.offset, thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~temp_10~0, ~temp_11~0, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~y_7~0, thread5Thread1of1ForFork2_#res#1.base] and [827] L81-->thread6EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_75| (ite (and (not (= (mod v_~f1_2~0_266 256) 0)) (not (= 0 (mod v_~f2_3~0_264 256)))) 1 0)) (= |v_thread3Thread1of1ForFork0_#res#1.offset_53| 0) (= v_~x_0~0_340 (+ v_~temp_5~0_215 1)) (= v_~x_0~0_341 v_~temp_5~0_215) (= (+ v_~temp_11~0_161 1) v_~x_6~0_239) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_75| 0)) (= |v_thread6Thread1of1ForFork4_#res#1.offset_37| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_75| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_75|) (= |v_thread6Thread1of1ForFork4_#res#1.base_37| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_53| 0)) InVars {~f1_2~0=v_~f1_2~0_266, ~f2_3~0=v_~f2_3~0_264, ~temp_11~0=v_~temp_11~0_161, ~x_0~0=v_~x_0~0_341} OutVars{thread6Thread1of1ForFork4_#res#1.base=|v_thread6Thread1of1ForFork4_#res#1.base_37|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_53|, ~f1_2~0=v_~f1_2~0_266, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_75|, ~f2_3~0=v_~f2_3~0_264, ~x_6~0=v_~x_6~0_239, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_75|, thread6Thread1of1ForFork4_#res#1.offset=|v_thread6Thread1of1ForFork4_#res#1.offset_37|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_53|, ~temp_11~0=v_~temp_11~0_161, ~x_0~0=v_~x_0~0_340, ~temp_5~0=v_~temp_5~0_215} AuxVars[] AssignedVars[thread6Thread1of1ForFork4_#res#1.base, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~x_6~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork4_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base, ~x_0~0, ~temp_5~0] [2022-12-06 05:18:14,287 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [822] L119-->L151: Formula: (let ((.cse0 (ite (and (not (= (mod v_~f1_8~0_202 256) 0)) (not (= 0 (mod v_~f2_9~0_202 256)))) 1 0))) (and (= v_~temp_10~0_161 v_~y_7~0_208) (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_43| .cse0) (= (+ v_~temp_10~0_161 1) v_~y_7~0_207) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_61| |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_61|) (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_43| |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_43|) (= |v_thread5Thread1of1ForFork2_#res#1.base_33| 0) (= .cse0 |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_61|) (= |v_thread5Thread1of1ForFork2_#res#1.offset_33| 0) (not (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_43| 0)) (= v_~temp_11~0_153 v_~x_6~0_227))) InVars {~f2_9~0=v_~f2_9~0_202, ~x_6~0=v_~x_6~0_227, ~y_7~0=v_~y_7~0_208, ~f1_8~0=v_~f1_8~0_202} OutVars{thread5Thread1of1ForFork2_#res#1.offset=|v_thread5Thread1of1ForFork2_#res#1.offset_33|, thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_61|, thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_43|, ~f2_9~0=v_~f2_9~0_202, ~temp_10~0=v_~temp_10~0_161, ~x_6~0=v_~x_6~0_227, ~temp_11~0=v_~temp_11~0_153, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_43|, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_61|, ~y_7~0=v_~y_7~0_207, ~f1_8~0=v_~f1_8~0_202, thread5Thread1of1ForFork2_#res#1.base=|v_thread5Thread1of1ForFork2_#res#1.base_33|} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_#res#1.offset, thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~temp_10~0, ~temp_11~0, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~y_7~0, thread5Thread1of1ForFork2_#res#1.base] and [819] L81-->thread6EXIT: Formula: (and (= |v_thread6Thread1of1ForFork4_#res#1.offset_31| 0) (= v_~x_0~0_326 v_~temp_5~0_203) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_69| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_69| (ite (and (not (= (mod v_~f1_2~0_260 256) 0)) (not (= (mod v_~f2_3~0_258 256) 0))) 1 0)) (= |v_thread6Thread1of1ForFork4_#res#1.base_31| 0) (= v_~x_6~0_225 (+ v_~temp_11~0_151 1)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_69| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_69|)) InVars {~f1_2~0=v_~f1_2~0_260, ~f2_3~0=v_~f2_3~0_258, ~temp_11~0=v_~temp_11~0_151, ~x_0~0=v_~x_0~0_326} OutVars{thread6Thread1of1ForFork4_#res#1.base=|v_thread6Thread1of1ForFork4_#res#1.base_31|, ~f1_2~0=v_~f1_2~0_260, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_69|, ~f2_3~0=v_~f2_3~0_258, ~x_6~0=v_~x_6~0_225, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_69|, thread6Thread1of1ForFork4_#res#1.offset=|v_thread6Thread1of1ForFork4_#res#1.offset_31|, ~temp_11~0=v_~temp_11~0_151, ~x_0~0=v_~x_0~0_326, ~temp_5~0=v_~temp_5~0_203} AuxVars[] AssignedVars[thread6Thread1of1ForFork4_#res#1.base, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~x_6~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork4_#res#1.offset, ~temp_5~0] [2022-12-06 05:18:14,538 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [771] $Ultimate##0-->L119: Formula: (and (= v_~temp_10~0_117 v_~x_6~0_172) (= v_~f1_8~0_154 1) (= v_~x_6~0_171 (+ v_~temp_10~0_117 1))) InVars {~x_6~0=v_~x_6~0_172} OutVars{~temp_10~0=v_~temp_10~0_117, ~x_6~0=v_~x_6~0_171, ~f1_8~0=v_~f1_8~0_154} AuxVars[] AssignedVars[~temp_10~0, ~x_6~0, ~f1_8~0] and [750] L81-->thread3EXIT: Formula: (and (= (+ v_~temp_5~0_113 1) v_~x_0~0_170) (= v_~x_0~0_171 v_~temp_5~0_113) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29| (ite (and (not (= (mod v_~f1_2~0_158 256) 0)) (not (= (mod v_~f2_3~0_158 256) 0))) 1 0)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_29| 0)) (= |v_thread3Thread1of1ForFork0_#res#1.base_15| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_29|) (= |v_thread3Thread1of1ForFork0_#res#1.offset_15| 0)) InVars {~f1_2~0=v_~f1_2~0_158, ~f2_3~0=v_~f2_3~0_158, ~x_0~0=v_~x_0~0_171} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_15|, ~f1_2~0=v_~f1_2~0_158, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|, ~f2_3~0=v_~f2_3~0_158, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_29|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_15|, ~x_0~0=v_~x_0~0_170, ~temp_5~0=v_~temp_5~0_113} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, ~x_0~0, ~temp_5~0] [2022-12-06 05:18:14,587 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [771] $Ultimate##0-->L119: Formula: (and (= v_~temp_10~0_117 v_~x_6~0_172) (= v_~f1_8~0_154 1) (= v_~x_6~0_171 (+ v_~temp_10~0_117 1))) InVars {~x_6~0=v_~x_6~0_172} OutVars{~temp_10~0=v_~temp_10~0_117, ~x_6~0=v_~x_6~0_171, ~f1_8~0=v_~f1_8~0_154} AuxVars[] AssignedVars[~temp_10~0, ~x_6~0, ~f1_8~0] and [766] L56-->thread2EXIT: Formula: (and (= (ite (and (not (= (mod v_~f1_2~0_184 256) 0)) (not (= (mod v_~f2_3~0_178 256) 0))) 1 0) |v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_29|) (not (= 0 |v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_29|)) (= |v_thread2Thread1of1ForFork5_#res#1.offset_29| 0) (= |v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_29| |v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_29|) (= v_~y_1~0_201 (+ v_~temp_4~0_121 1)) (= |v_thread2Thread1of1ForFork5_#res#1.base_29| 0) (= v_~y_1~0_202 v_~temp_4~0_121)) InVars {~f1_2~0=v_~f1_2~0_184, ~f2_3~0=v_~f2_3~0_178, ~y_1~0=v_~y_1~0_202} OutVars{~temp_4~0=v_~temp_4~0_121, thread2Thread1of1ForFork5_#res#1.offset=|v_thread2Thread1of1ForFork5_#res#1.offset_29|, ~f1_2~0=v_~f1_2~0_184, ~f2_3~0=v_~f2_3~0_178, thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_29|, ~y_1~0=v_~y_1~0_201, thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_29|, thread2Thread1of1ForFork5_#res#1.base=|v_thread2Thread1of1ForFork5_#res#1.base_29|} AuxVars[] AssignedVars[~temp_4~0, thread2Thread1of1ForFork5_#res#1.offset, thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, ~y_1~0, thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork5_#res#1.base] [2022-12-06 05:18:14,645 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [771] $Ultimate##0-->L119: Formula: (and (= v_~temp_10~0_117 v_~x_6~0_172) (= v_~f1_8~0_154 1) (= v_~x_6~0_171 (+ v_~temp_10~0_117 1))) InVars {~x_6~0=v_~x_6~0_172} OutVars{~temp_10~0=v_~temp_10~0_117, ~x_6~0=v_~x_6~0_171, ~f1_8~0=v_~f1_8~0_154} AuxVars[] AssignedVars[~temp_10~0, ~x_6~0, ~f1_8~0] and [716] L63-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork5_#res#1.base_15| 0) (= v_~y_1~0_109 (+ v_~temp_4~0_43 1)) (= |v_thread2Thread1of1ForFork5_#res#1.offset_15| 0)) InVars {~temp_4~0=v_~temp_4~0_43} OutVars{~temp_4~0=v_~temp_4~0_43, thread2Thread1of1ForFork5_#res#1.offset=|v_thread2Thread1of1ForFork5_#res#1.offset_15|, ~y_1~0=v_~y_1~0_109, thread2Thread1of1ForFork5_#res#1.base=|v_thread2Thread1of1ForFork5_#res#1.base_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork5_#res#1.offset, ~y_1~0, thread2Thread1of1ForFork5_#res#1.base] [2022-12-06 05:18:14,667 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [771] $Ultimate##0-->L119: Formula: (and (= v_~temp_10~0_117 v_~x_6~0_172) (= v_~f1_8~0_154 1) (= v_~x_6~0_171 (+ v_~temp_10~0_117 1))) InVars {~x_6~0=v_~x_6~0_172} OutVars{~temp_10~0=v_~temp_10~0_117, ~x_6~0=v_~x_6~0_171, ~f1_8~0=v_~f1_8~0_154} AuxVars[] AssignedVars[~temp_10~0, ~x_6~0, ~f1_8~0] and [749] L81-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork5_#res#1.offset_25| 0) (= v_~x_0~0_168 v_~temp_5~0_111) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_27| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_27| (ite (and (not (= (mod v_~f2_3~0_156 256) 0)) (not (= (mod v_~f1_2~0_156 256) 0))) 1 0)) (= v_~y_1~0_187 (+ v_~temp_4~0_101 1)) (= |v_thread2Thread1of1ForFork5_#res#1.base_25| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_27| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_27|)) InVars {~temp_4~0=v_~temp_4~0_101, ~f1_2~0=v_~f1_2~0_156, ~f2_3~0=v_~f2_3~0_156, ~x_0~0=v_~x_0~0_168} OutVars{~temp_4~0=v_~temp_4~0_101, thread2Thread1of1ForFork5_#res#1.offset=|v_thread2Thread1of1ForFork5_#res#1.offset_25|, ~f1_2~0=v_~f1_2~0_156, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_27|, ~f2_3~0=v_~f2_3~0_156, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_27|, ~y_1~0=v_~y_1~0_187, ~x_0~0=v_~x_0~0_168, thread2Thread1of1ForFork5_#res#1.base=|v_thread2Thread1of1ForFork5_#res#1.base_25|, ~temp_5~0=v_~temp_5~0_111} AuxVars[] AssignedVars[thread2Thread1of1ForFork5_#res#1.offset, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~y_1~0, thread2Thread1of1ForFork5_#res#1.base, ~temp_5~0] [2022-12-06 05:18:14,736 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [771] $Ultimate##0-->L119: Formula: (and (= v_~temp_10~0_117 v_~x_6~0_172) (= v_~f1_8~0_154 1) (= v_~x_6~0_171 (+ v_~temp_10~0_117 1))) InVars {~x_6~0=v_~x_6~0_172} OutVars{~temp_10~0=v_~temp_10~0_117, ~x_6~0=v_~x_6~0_171, ~f1_8~0=v_~f1_8~0_154} AuxVars[] AssignedVars[~temp_10~0, ~x_6~0, ~f1_8~0] and [747] L81-->L144: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_23| 0)) (= (ite (and (not (= (mod v_~f2_3~0_152 256) 0)) (not (= (mod v_~f1_2~0_152 256) 0))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23|) (= v_~f2_9~0_136 1) (= v_~x_0~0_164 v_~temp_5~0_107) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_23|) (= (+ v_~temp_11~0_101 1) v_~y_7~0_131)) InVars {~f1_2~0=v_~f1_2~0_152, ~f2_3~0=v_~f2_3~0_152, ~temp_11~0=v_~temp_11~0_101, ~x_0~0=v_~x_0~0_164} OutVars{~f2_9~0=v_~f2_9~0_136, ~f1_2~0=v_~f1_2~0_152, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23|, ~f2_3~0=v_~f2_3~0_152, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_23|, ~temp_11~0=v_~temp_11~0_101, ~y_7~0=v_~y_7~0_131, ~x_0~0=v_~x_0~0_164, ~temp_5~0=v_~temp_5~0_107} AuxVars[] AssignedVars[~f2_9~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~y_7~0, ~temp_5~0] [2022-12-06 05:18:14,778 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [771] $Ultimate##0-->L119: Formula: (and (= v_~temp_10~0_117 v_~x_6~0_172) (= v_~f1_8~0_154 1) (= v_~x_6~0_171 (+ v_~temp_10~0_117 1))) InVars {~x_6~0=v_~x_6~0_172} OutVars{~temp_10~0=v_~temp_10~0_117, ~x_6~0=v_~x_6~0_171, ~f1_8~0=v_~f1_8~0_154} AuxVars[] AssignedVars[~temp_10~0, ~x_6~0, ~f1_8~0] and [765] L56-->L144: Formula: (and (= v_~y_7~0_147 (+ v_~temp_11~0_109 1)) (= v_~f2_9~0_150 1) (not (= 0 |v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_27|)) (= (ite (and (not (= (mod v_~f1_2~0_182 256) 0)) (not (= (mod v_~f2_3~0_176 256) 0))) 1 0) |v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_27|) (= v_~y_1~0_199 v_~temp_4~0_119) (= |v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_27| |v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_27|)) InVars {~f1_2~0=v_~f1_2~0_182, ~f2_3~0=v_~f2_3~0_176, ~temp_11~0=v_~temp_11~0_109, ~y_1~0=v_~y_1~0_199} OutVars{~temp_4~0=v_~temp_4~0_119, ~f2_9~0=v_~f2_9~0_150, ~f1_2~0=v_~f1_2~0_182, ~f2_3~0=v_~f2_3~0_176, thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_27|, ~temp_11~0=v_~temp_11~0_109, ~y_1~0=v_~y_1~0_199, thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_27|, ~y_7~0=v_~y_7~0_147} AuxVars[] AssignedVars[~temp_4~0, ~f2_9~0, thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1, ~y_7~0] [2022-12-06 05:18:14,840 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [771] $Ultimate##0-->L119: Formula: (and (= v_~temp_10~0_117 v_~x_6~0_172) (= v_~f1_8~0_154 1) (= v_~x_6~0_171 (+ v_~temp_10~0_117 1))) InVars {~x_6~0=v_~x_6~0_172} OutVars{~temp_10~0=v_~temp_10~0_117, ~x_6~0=v_~x_6~0_171, ~f1_8~0=v_~f1_8~0_154} AuxVars[] AssignedVars[~temp_10~0, ~x_6~0, ~f1_8~0] and [703] L137-->L144: Formula: (and (= v_~f2_9~0_72 1) (= (+ v_~temp_11~0_41 1) v_~y_7~0_71)) InVars {~temp_11~0=v_~temp_11~0_41} OutVars{~f2_9~0=v_~f2_9~0_72, ~temp_11~0=v_~temp_11~0_41, ~y_7~0=v_~y_7~0_71} AuxVars[] AssignedVars[~f2_9~0, ~y_7~0] [2022-12-06 05:18:14,872 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:18:14,873 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1218 [2022-12-06 05:18:14,873 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 318 transitions, 2964 flow [2022-12-06 05:18:14,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:14,874 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:14,874 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:14,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 05:18:14,874 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 05:18:14,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:14,874 INFO L85 PathProgramCache]: Analyzing trace with hash -735284647, now seen corresponding path program 1 times [2022-12-06 05:18:14,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:14,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190386189] [2022-12-06 05:18:14,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:14,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:15,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:15,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:15,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190386189] [2022-12-06 05:18:15,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190386189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:15,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:15,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 05:18:15,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626061278] [2022-12-06 05:18:15,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:15,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:18:15,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:15,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:18:15,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:18:15,503 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 111 [2022-12-06 05:18:15,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 318 transitions, 2964 flow. Second operand has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:15,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:15,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 111 [2022-12-06 05:18:15,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand