/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-barrier.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 00:02:29,850 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:02:29,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:02:29,976 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:02:29,976 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:02:29,979 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:02:29,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:02:29,986 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:02:29,991 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:02:29,995 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:02:29,996 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:02:29,998 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:02:29,998 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:02:30,000 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:02:30,001 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:02:30,004 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:02:30,005 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:02:30,005 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:02:30,008 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:02:30,009 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:02:30,010 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:02:30,016 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:02:30,017 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:02:30,018 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:02:30,025 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:02:30,025 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:02:30,026 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:02:30,026 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:02:30,031 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:02:30,032 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:02:30,032 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:02:30,033 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:02:30,034 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:02:30,034 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:02:30,039 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:02:30,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:02:30,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:02:30,040 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:02:30,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:02:30,041 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:02:30,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:02:30,048 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 00:02:30,087 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:02:30,087 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:02:30,088 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:02:30,089 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:02:30,089 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:02:30,089 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:02:30,089 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:02:30,089 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:02:30,090 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:02:30,090 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:02:30,090 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:02:30,090 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:02:30,090 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:02:30,090 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:02:30,091 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:02:30,091 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:02:30,095 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:02:30,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:02:30,096 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:02:30,096 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:02:30,096 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:02:30,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:02:30,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:02:30,096 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:02:30,097 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:02:30,097 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:02:30,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:02:30,097 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:02:30,097 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 00:02:30,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:02:30,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:02:30,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:02:30,623 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:02:30,632 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:02:30,634 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 00:02:32,321 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:02:32,701 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:02:32,701 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-barrier.wvr.c [2022-12-06 00:02:32,709 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d162291ba/fc25aae250ef41499d06060d4e074d88/FLAG156dddc27 [2022-12-06 00:02:32,740 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d162291ba/fc25aae250ef41499d06060d4e074d88 [2022-12-06 00:02:32,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:02:32,744 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:02:32,748 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:02:32,748 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:02:32,750 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:02:32,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:02:32" (1/1) ... [2022-12-06 00:02:32,755 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c159a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:02:32, skipping insertion in model container [2022-12-06 00:02:32,755 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:02:32" (1/1) ... [2022-12-06 00:02:32,770 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:02:32,819 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:02:33,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,160 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 00:02:33,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:02:33,175 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:02:33,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:02:33,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:02:33,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 00:02:33,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:02:33,251 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:02:33,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:02:33 WrapperNode [2022-12-06 00:02:33,252 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:02:33,253 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:02:33,253 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:02:33,253 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:02:33,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:02:33" (1/1) ... [2022-12-06 00:02:33,279 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:02:33" (1/1) ... [2022-12-06 00:02:33,317 INFO L138 Inliner]: procedures = 25, calls = 98, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 253 [2022-12-06 00:02:33,318 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:02:33,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:02:33,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:02:33,320 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:02:33,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:02:33" (1/1) ... [2022-12-06 00:02:33,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:02:33" (1/1) ... [2022-12-06 00:02:33,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:02:33" (1/1) ... [2022-12-06 00:02:33,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:02:33" (1/1) ... [2022-12-06 00:02:33,369 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:02:33" (1/1) ... [2022-12-06 00:02:33,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:02:33" (1/1) ... [2022-12-06 00:02:33,374 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:02:33" (1/1) ... [2022-12-06 00:02:33,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:02:33" (1/1) ... [2022-12-06 00:02:33,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:02:33,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:02:33,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:02:33,401 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:02:33,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:02:33" (1/1) ... [2022-12-06 00:02:33,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:02:33,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:02:33,431 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 00:02:33,491 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 00:02:33,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:02:33,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:02:33,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:02:33,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:02:33,532 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 00:02:33,532 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 00:02:33,532 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 00:02:33,532 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 00:02:33,532 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 00:02:33,532 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 00:02:33,532 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 00:02:33,533 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 00:02:33,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:02:33,533 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-12-06 00:02:33,533 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-12-06 00:02:33,533 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-12-06 00:02:33,533 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-12-06 00:02:33,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 00:02:33,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 00:02:33,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:02:33,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:02:33,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:02:33,535 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 00:02:33,751 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:02:33,753 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:02:34,391 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:02:34,483 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:02:34,483 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 00:02:34,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:02:34 BoogieIcfgContainer [2022-12-06 00:02:34,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:02:34,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:02:34,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:02:34,491 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:02:34,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:02:32" (1/3) ... [2022-12-06 00:02:34,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2707ba81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:02:34, skipping insertion in model container [2022-12-06 00:02:34,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:02:33" (2/3) ... [2022-12-06 00:02:34,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2707ba81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:02:34, skipping insertion in model container [2022-12-06 00:02:34,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:02:34" (3/3) ... [2022-12-06 00:02:34,493 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-barrier.wvr.c [2022-12-06 00:02:34,516 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:02:34,516 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 00:02:34,516 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:02:34,756 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2022-12-06 00:02:34,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 235 places, 224 transitions, 520 flow [2022-12-06 00:02:35,111 INFO L130 PetriNetUnfolder]: 8/196 cut-off events. [2022-12-06 00:02:35,120 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 00:02:35,127 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 00:02:35,128 INFO L82 GeneralOperation]: Start removeDead. Operand has 235 places, 224 transitions, 520 flow [2022-12-06 00:02:35,168 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 199 places, 188 transitions, 424 flow [2022-12-06 00:02:35,170 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:35,194 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 199 places, 188 transitions, 424 flow [2022-12-06 00:02:35,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 188 transitions, 424 flow [2022-12-06 00:02:35,273 INFO L130 PetriNetUnfolder]: 8/188 cut-off events. [2022-12-06 00:02:35,274 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 00:02:35,279 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 00:02:35,285 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 188 transitions, 424 flow [2022-12-06 00:02:35,285 INFO L188 LiptonReduction]: Number of co-enabled transitions 7268 [2022-12-06 00:02:43,342 INFO L203 LiptonReduction]: Total number of compositions: 131 [2022-12-06 00:02:43,354 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:02:43,366 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;@42d70a41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:02:43,367 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-12-06 00:02:43,384 INFO L130 PetriNetUnfolder]: 6/64 cut-off events. [2022-12-06 00:02:43,385 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 00:02:43,385 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:43,386 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 00:02:43,386 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 00:02:43,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:43,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1625495205, now seen corresponding path program 1 times [2022-12-06 00:02:43,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:43,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338031216] [2022-12-06 00:02:43,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:43,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:43,762 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 00:02:43,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:43,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338031216] [2022-12-06 00:02:43,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338031216] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:43,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:43,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:02:43,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518206589] [2022-12-06 00:02:43,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:43,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 00:02:43,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:43,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 00:02:43,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 00:02:43,794 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 65 [2022-12-06 00:02:43,795 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 00:02:43,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:43,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 65 [2022-12-06 00:02:43,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:47,865 INFO L130 PetriNetUnfolder]: 19745/26241 cut-off events. [2022-12-06 00:02:47,865 INFO L131 PetriNetUnfolder]: For 3807/3807 co-relation queries the response was YES. [2022-12-06 00:02:48,053 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 00:02:48,320 INFO L137 encePairwiseOnDemand]: 63/65 looper letters, 47 selfloop transitions, 0 changer transitions 0/63 dead transitions. [2022-12-06 00:02:48,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 63 transitions, 268 flow [2022-12-06 00:02:48,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 00:02:48,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 00:02:48,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 81 transitions. [2022-12-06 00:02:48,334 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6230769230769231 [2022-12-06 00:02:48,336 INFO L175 Difference]: Start difference. First operand has 78 places, 65 transitions, 178 flow. Second operand 2 states and 81 transitions. [2022-12-06 00:02:48,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 63 transitions, 268 flow [2022-12-06 00:02:48,461 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 00:02:48,463 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 142 flow [2022-12-06 00:02:48,465 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 00:02:48,468 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, -11 predicate places. [2022-12-06 00:02:48,469 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:48,469 INFO L89 Accepts]: Start accepts. Operand has 67 places, 63 transitions, 142 flow [2022-12-06 00:02:48,496 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:48,496 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:48,496 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 63 transitions, 142 flow [2022-12-06 00:02:48,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 63 transitions, 142 flow [2022-12-06 00:02:48,511 INFO L130 PetriNetUnfolder]: 4/63 cut-off events. [2022-12-06 00:02:48,511 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:02:48,512 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 00:02:48,524 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 63 transitions, 142 flow [2022-12-06 00:02:48,524 INFO L188 LiptonReduction]: Number of co-enabled transitions 1976 [2022-12-06 00:02:48,654 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:02:48,657 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 00:02:48,657 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 142 flow [2022-12-06 00:02:48,658 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 00:02:48,658 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:48,658 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 00:02:48,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:02:48,662 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 00:02:48,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:48,669 INFO L85 PathProgramCache]: Analyzing trace with hash 728934078, now seen corresponding path program 1 times [2022-12-06 00:02:48,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:48,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138753109] [2022-12-06 00:02:48,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:48,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:50,433 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 00:02:50,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:50,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138753109] [2022-12-06 00:02:50,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138753109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:50,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:50,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-06 00:02:50,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891728470] [2022-12-06 00:02:50,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:50,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 00:02:50,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:50,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 00:02:50,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2022-12-06 00:02:50,436 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 63 [2022-12-06 00:02:50,437 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 00:02:50,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:50,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 63 [2022-12-06 00:02:50,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:02,036 INFO L130 PetriNetUnfolder]: 58208/75071 cut-off events. [2022-12-06 00:03:02,037 INFO L131 PetriNetUnfolder]: For 2018/2018 co-relation queries the response was YES. [2022-12-06 00:03:02,178 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 00:03:02,533 INFO L137 encePairwiseOnDemand]: 45/63 looper letters, 460 selfloop transitions, 150 changer transitions 20/642 dead transitions. [2022-12-06 00:03:02,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 642 transitions, 2706 flow [2022-12-06 00:03:02,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-06 00:03:02,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2022-12-06 00:03:02,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 1087 transitions. [2022-12-06 00:03:02,544 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4540517961570593 [2022-12-06 00:03:02,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 00:03:02,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 642 transitions, 2706 flow [2022-12-06 00:03:02,550 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 00:03:02,559 INFO L231 Difference]: Finished difference. Result has 117 places, 224 transitions, 931 flow [2022-12-06 00:03:02,561 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 00:03:02,567 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 39 predicate places. [2022-12-06 00:03:02,567 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:02,567 INFO L89 Accepts]: Start accepts. Operand has 117 places, 224 transitions, 931 flow [2022-12-06 00:03:02,572 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:02,573 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:02,573 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 224 transitions, 931 flow [2022-12-06 00:03:02,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 224 transitions, 931 flow [2022-12-06 00:03:02,758 INFO L130 PetriNetUnfolder]: 954/1865 cut-off events. [2022-12-06 00:03:02,759 INFO L131 PetriNetUnfolder]: For 448/450 co-relation queries the response was YES. [2022-12-06 00:03:02,772 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 00:03:02,797 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 224 transitions, 931 flow [2022-12-06 00:03:02,797 INFO L188 LiptonReduction]: Number of co-enabled transitions 5316 [2022-12-06 00:03:02,842 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 00:03:02,906 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 00:03:02,976 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 00:03:03,074 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 00:03:03,176 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 00:03:03,212 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 00:03:03,280 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 00:03:03,329 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 00:03:03,559 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 00:03:03,608 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 00:03:03,721 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 00:03:03,744 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 00:03:03,767 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 00:03:03,831 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 00:03:03,866 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 00:03:03,961 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 00:03:04,058 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 00:03:04,172 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 00:03:04,320 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 00:03:04,368 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 00:03:04,401 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 00:03:04,468 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 00:03:04,882 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 00:03:04,960 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 00:03:05,016 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 00:03:05,062 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 00:03:05,125 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 00:03:05,193 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 00:03:05,225 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 00:03:05,301 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 00:03:05,413 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 00:03:05,585 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 00:03:05,629 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 00:03:05,718 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 00:03:06,026 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 00:03:06,043 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 00:03:06,083 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 00:03:06,447 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 00:03:06,539 INFO L203 LiptonReduction]: Total number of compositions: 12 [2022-12-06 00:03:06,540 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3973 [2022-12-06 00:03:06,540 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 212 transitions, 1048 flow [2022-12-06 00:03:06,541 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 00:03:06,541 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:06,541 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 00:03:06,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:03:06,541 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 00:03:06,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:06,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1218799188, now seen corresponding path program 1 times [2022-12-06 00:03:06,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:06,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176990218] [2022-12-06 00:03:06,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:06,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:06,782 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 00:03:06,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:06,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176990218] [2022-12-06 00:03:06,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176990218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:06,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:06,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:06,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109417876] [2022-12-06 00:03:06,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:06,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:06,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:06,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:06,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:06,790 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 105 [2022-12-06 00:03:06,791 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 00:03:06,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:06,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 105 [2022-12-06 00:03:06,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:10,312 INFO L130 PetriNetUnfolder]: 29128/38908 cut-off events. [2022-12-06 00:03:10,312 INFO L131 PetriNetUnfolder]: For 58916/59078 co-relation queries the response was YES. [2022-12-06 00:03:10,525 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 00:03:10,692 INFO L137 encePairwiseOnDemand]: 92/105 looper letters, 227 selfloop transitions, 7 changer transitions 0/251 dead transitions. [2022-12-06 00:03:10,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 251 transitions, 1570 flow [2022-12-06 00:03:10,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:10,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:10,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 200 transitions. [2022-12-06 00:03:10,694 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2022-12-06 00:03:10,694 INFO L175 Difference]: Start difference. First operand has 105 places, 212 transitions, 1048 flow. Second operand 4 states and 200 transitions. [2022-12-06 00:03:10,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 251 transitions, 1570 flow [2022-12-06 00:03:10,875 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 00:03:10,879 INFO L231 Difference]: Finished difference. Result has 103 places, 201 transitions, 918 flow [2022-12-06 00:03:10,879 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 00:03:10,880 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 25 predicate places. [2022-12-06 00:03:10,880 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:10,880 INFO L89 Accepts]: Start accepts. Operand has 103 places, 201 transitions, 918 flow [2022-12-06 00:03:10,900 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:10,900 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:10,900 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 201 transitions, 918 flow [2022-12-06 00:03:10,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 201 transitions, 918 flow [2022-12-06 00:03:11,125 INFO L130 PetriNetUnfolder]: 765/1534 cut-off events. [2022-12-06 00:03:11,125 INFO L131 PetriNetUnfolder]: For 253/267 co-relation queries the response was YES. [2022-12-06 00:03:11,131 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 00:03:11,143 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 201 transitions, 918 flow [2022-12-06 00:03:11,143 INFO L188 LiptonReduction]: Number of co-enabled transitions 4296 [2022-12-06 00:03:11,301 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:11,302 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 422 [2022-12-06 00:03:11,302 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 201 transitions, 927 flow [2022-12-06 00:03:11,303 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 00:03:11,303 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:11,303 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 00:03:11,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 00:03:11,303 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 00:03:11,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:11,304 INFO L85 PathProgramCache]: Analyzing trace with hash 2119649255, now seen corresponding path program 1 times [2022-12-06 00:03:11,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:11,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095800112] [2022-12-06 00:03:11,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:11,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:11,843 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 00:03:11,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:11,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095800112] [2022-12-06 00:03:11,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095800112] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:11,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:11,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:03:11,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256353397] [2022-12-06 00:03:11,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:11,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:03:11,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:11,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:03:11,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:03:11,848 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 99 [2022-12-06 00:03:11,848 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 00:03:11,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:11,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 99 [2022-12-06 00:03:11,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:18,389 INFO L130 PetriNetUnfolder]: 44646/57720 cut-off events. [2022-12-06 00:03:18,389 INFO L131 PetriNetUnfolder]: For 42037/42037 co-relation queries the response was YES. [2022-12-06 00:03:18,630 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 00:03:19,183 INFO L137 encePairwiseOnDemand]: 61/99 looper letters, 282 selfloop transitions, 92 changer transitions 22/408 dead transitions. [2022-12-06 00:03:19,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 408 transitions, 2372 flow [2022-12-06 00:03:19,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 00:03:19,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 00:03:19,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 443 transitions. [2022-12-06 00:03:19,188 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3442113442113442 [2022-12-06 00:03:19,188 INFO L175 Difference]: Start difference. First operand has 103 places, 201 transitions, 927 flow. Second operand 13 states and 443 transitions. [2022-12-06 00:03:19,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 408 transitions, 2372 flow [2022-12-06 00:03:19,584 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 00:03:19,589 INFO L231 Difference]: Finished difference. Result has 122 places, 242 transitions, 1467 flow [2022-12-06 00:03:19,589 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 00:03:19,590 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 44 predicate places. [2022-12-06 00:03:19,590 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:19,590 INFO L89 Accepts]: Start accepts. Operand has 122 places, 242 transitions, 1467 flow [2022-12-06 00:03:19,592 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:19,592 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:19,592 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 242 transitions, 1467 flow [2022-12-06 00:03:19,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 242 transitions, 1467 flow [2022-12-06 00:03:19,988 INFO L130 PetriNetUnfolder]: 840/1668 cut-off events. [2022-12-06 00:03:19,988 INFO L131 PetriNetUnfolder]: For 528/541 co-relation queries the response was YES. [2022-12-06 00:03:19,995 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 00:03:20,005 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 242 transitions, 1467 flow [2022-12-06 00:03:20,005 INFO L188 LiptonReduction]: Number of co-enabled transitions 4960 [2022-12-06 00:03:20,027 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 00:03:20,086 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 00:03:20,359 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:03:20,360 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 770 [2022-12-06 00:03:20,360 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 240 transitions, 1455 flow [2022-12-06 00:03:20,360 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 00:03:20,360 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:20,360 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 00:03:20,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 00:03:20,360 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 00:03:20,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:20,361 INFO L85 PathProgramCache]: Analyzing trace with hash -844038683, now seen corresponding path program 1 times [2022-12-06 00:03:20,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:20,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442322586] [2022-12-06 00:03:20,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:20,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:21,511 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 00:03:21,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:21,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442322586] [2022-12-06 00:03:21,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442322586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:21,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:21,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 00:03:21,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18959043] [2022-12-06 00:03:21,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:21,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 00:03:21,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:21,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 00:03:21,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-12-06 00:03:21,513 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 99 [2022-12-06 00:03:21,514 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 00:03:21,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:21,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 99 [2022-12-06 00:03:21,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:28,994 INFO L130 PetriNetUnfolder]: 45367/58607 cut-off events. [2022-12-06 00:03:28,994 INFO L131 PetriNetUnfolder]: For 43698/43698 co-relation queries the response was YES. [2022-12-06 00:03:29,387 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 00:03:29,697 INFO L137 encePairwiseOnDemand]: 59/99 looper letters, 264 selfloop transitions, 97 changer transitions 18/391 dead transitions. [2022-12-06 00:03:29,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 391 transitions, 2651 flow [2022-12-06 00:03:29,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 00:03:29,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 00:03:29,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 402 transitions. [2022-12-06 00:03:29,716 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3691460055096419 [2022-12-06 00:03:29,716 INFO L175 Difference]: Start difference. First operand has 119 places, 240 transitions, 1455 flow. Second operand 11 states and 402 transitions. [2022-12-06 00:03:29,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 391 transitions, 2651 flow [2022-12-06 00:03:30,757 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 00:03:30,766 INFO L231 Difference]: Finished difference. Result has 126 places, 247 transitions, 1605 flow [2022-12-06 00:03:30,766 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 00:03:30,769 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 48 predicate places. [2022-12-06 00:03:30,769 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:30,769 INFO L89 Accepts]: Start accepts. Operand has 126 places, 247 transitions, 1605 flow [2022-12-06 00:03:30,777 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:30,777 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:30,777 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 247 transitions, 1605 flow [2022-12-06 00:03:30,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 247 transitions, 1605 flow [2022-12-06 00:03:30,892 INFO L130 PetriNetUnfolder]: 835/1665 cut-off events. [2022-12-06 00:03:30,893 INFO L131 PetriNetUnfolder]: For 746/943 co-relation queries the response was YES. [2022-12-06 00:03:30,901 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 00:03:30,940 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 247 transitions, 1605 flow [2022-12-06 00:03:30,941 INFO L188 LiptonReduction]: Number of co-enabled transitions 5112 [2022-12-06 00:03:30,951 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:03:30,952 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 00:03:30,952 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 247 transitions, 1605 flow [2022-12-06 00:03:30,953 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 00:03:30,953 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:30,953 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 00:03:30,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 00:03:30,953 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 00:03:30,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:30,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1934089540, now seen corresponding path program 1 times [2022-12-06 00:03:30,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:30,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708756471] [2022-12-06 00:03:30,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:30,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:32,046 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 00:03:32,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:32,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708756471] [2022-12-06 00:03:32,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708756471] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:32,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:32,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 00:03:32,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133684365] [2022-12-06 00:03:32,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:32,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:03:32,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:32,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:03:32,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:03:32,049 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 98 [2022-12-06 00:03:32,049 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 00:03:32,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:32,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 98 [2022-12-06 00:03:32,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:39,743 INFO L130 PetriNetUnfolder]: 49913/64605 cut-off events. [2022-12-06 00:03:39,743 INFO L131 PetriNetUnfolder]: For 58871/58871 co-relation queries the response was YES. [2022-12-06 00:03:40,097 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 00:03:40,323 INFO L137 encePairwiseOnDemand]: 58/98 looper letters, 356 selfloop transitions, 144 changer transitions 21/533 dead transitions. [2022-12-06 00:03:40,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 533 transitions, 3628 flow [2022-12-06 00:03:40,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 00:03:40,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 00:03:40,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 630 transitions. [2022-12-06 00:03:40,329 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32142857142857145 [2022-12-06 00:03:40,330 INFO L175 Difference]: Start difference. First operand has 125 places, 247 transitions, 1605 flow. Second operand 20 states and 630 transitions. [2022-12-06 00:03:40,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 533 transitions, 3628 flow [2022-12-06 00:03:41,016 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 00:03:41,023 INFO L231 Difference]: Finished difference. Result has 143 places, 291 transitions, 2154 flow [2022-12-06 00:03:41,023 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 00:03:41,026 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 65 predicate places. [2022-12-06 00:03:41,026 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:41,026 INFO L89 Accepts]: Start accepts. Operand has 143 places, 291 transitions, 2154 flow [2022-12-06 00:03:41,029 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:41,029 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:41,030 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 291 transitions, 2154 flow [2022-12-06 00:03:41,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 291 transitions, 2154 flow [2022-12-06 00:03:41,194 INFO L130 PetriNetUnfolder]: 967/1990 cut-off events. [2022-12-06 00:03:41,194 INFO L131 PetriNetUnfolder]: For 1583/1757 co-relation queries the response was YES. [2022-12-06 00:03:41,208 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 00:03:41,255 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 291 transitions, 2154 flow [2022-12-06 00:03:41,255 INFO L188 LiptonReduction]: Number of co-enabled transitions 5800 [2022-12-06 00:03:41,280 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 00:03:41,319 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 00:03:41,351 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 00:03:41,441 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 00:03:41,534 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 00:03:41,617 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 00:03:41,665 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 00:03:41,821 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 00:03:41,935 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:03:41,936 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 910 [2022-12-06 00:03:41,936 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 290 transitions, 2170 flow [2022-12-06 00:03:41,936 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 00:03:41,936 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:41,936 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 00:03:41,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 00:03:41,937 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 00:03:41,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:41,937 INFO L85 PathProgramCache]: Analyzing trace with hash 274624445, now seen corresponding path program 1 times [2022-12-06 00:03:41,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:41,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540404878] [2022-12-06 00:03:41,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:41,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:42,559 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 00:03:42,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:42,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540404878] [2022-12-06 00:03:42,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540404878] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:42,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:42,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 00:03:42,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362266145] [2022-12-06 00:03:42,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:42,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:03:42,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:42,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:03:42,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:03:42,561 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 107 [2022-12-06 00:03:42,562 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 00:03:42,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:42,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 107 [2022-12-06 00:03:42,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:51,672 INFO L130 PetriNetUnfolder]: 52160/67742 cut-off events. [2022-12-06 00:03:51,673 INFO L131 PetriNetUnfolder]: For 77427/77427 co-relation queries the response was YES. [2022-12-06 00:03:52,212 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 00:03:52,500 INFO L137 encePairwiseOnDemand]: 56/107 looper letters, 377 selfloop transitions, 159 changer transitions 26/574 dead transitions. [2022-12-06 00:03:52,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 574 transitions, 4205 flow [2022-12-06 00:03:52,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 00:03:52,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 00:03:52,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 663 transitions. [2022-12-06 00:03:52,520 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30981308411214953 [2022-12-06 00:03:52,520 INFO L175 Difference]: Start difference. First operand has 141 places, 290 transitions, 2170 flow. Second operand 20 states and 663 transitions. [2022-12-06 00:03:52,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 574 transitions, 4205 flow [2022-12-06 00:03:54,037 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 00:03:54,046 INFO L231 Difference]: Finished difference. Result has 160 places, 310 transitions, 2564 flow [2022-12-06 00:03:54,046 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 00:03:54,048 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 82 predicate places. [2022-12-06 00:03:54,048 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:54,048 INFO L89 Accepts]: Start accepts. Operand has 160 places, 310 transitions, 2564 flow [2022-12-06 00:03:54,065 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:54,066 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:54,066 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 310 transitions, 2564 flow [2022-12-06 00:03:54,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 310 transitions, 2564 flow [2022-12-06 00:03:54,249 INFO L130 PetriNetUnfolder]: 993/2087 cut-off events. [2022-12-06 00:03:54,249 INFO L131 PetriNetUnfolder]: For 2590/2764 co-relation queries the response was YES. [2022-12-06 00:03:54,265 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 00:03:54,287 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 310 transitions, 2564 flow [2022-12-06 00:03:54,287 INFO L188 LiptonReduction]: Number of co-enabled transitions 6208 [2022-12-06 00:03:54,295 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:03:54,305 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 257 [2022-12-06 00:03:54,306 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 310 transitions, 2564 flow [2022-12-06 00:03:54,306 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 00:03:54,307 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:54,307 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 00:03:54,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 00:03:54,307 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 00:03:54,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:54,308 INFO L85 PathProgramCache]: Analyzing trace with hash 2136642854, now seen corresponding path program 1 times [2022-12-06 00:03:54,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:54,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382496353] [2022-12-06 00:03:54,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:54,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:55,111 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 00:03:55,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:55,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382496353] [2022-12-06 00:03:55,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382496353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:55,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:55,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:03:55,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540945702] [2022-12-06 00:03:55,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:55,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:03:55,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:55,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:03:55,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:03:55,113 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 106 [2022-12-06 00:03:55,113 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 00:03:55,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:55,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 106 [2022-12-06 00:03:55,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:04,758 INFO L130 PetriNetUnfolder]: 52238/67852 cut-off events. [2022-12-06 00:04:04,758 INFO L131 PetriNetUnfolder]: For 100700/100700 co-relation queries the response was YES. [2022-12-06 00:04:05,597 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 00:04:05,874 INFO L137 encePairwiseOnDemand]: 63/106 looper letters, 342 selfloop transitions, 118 changer transitions 14/486 dead transitions. [2022-12-06 00:04:05,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 486 transitions, 4023 flow [2022-12-06 00:04:05,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 00:04:05,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 00:04:05,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 481 transitions. [2022-12-06 00:04:05,892 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32412398921832886 [2022-12-06 00:04:05,892 INFO L175 Difference]: Start difference. First operand has 159 places, 310 transitions, 2564 flow. Second operand 14 states and 481 transitions. [2022-12-06 00:04:05,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 486 transitions, 4023 flow [2022-12-06 00:04:08,661 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 00:04:08,669 INFO L231 Difference]: Finished difference. Result has 161 places, 313 transitions, 2634 flow [2022-12-06 00:04:08,670 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 00:04:08,672 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 83 predicate places. [2022-12-06 00:04:08,672 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:08,672 INFO L89 Accepts]: Start accepts. Operand has 161 places, 313 transitions, 2634 flow [2022-12-06 00:04:08,680 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:08,680 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:08,680 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 313 transitions, 2634 flow [2022-12-06 00:04:08,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 313 transitions, 2634 flow [2022-12-06 00:04:08,911 INFO L130 PetriNetUnfolder]: 1003/2100 cut-off events. [2022-12-06 00:04:08,911 INFO L131 PetriNetUnfolder]: For 2526/2700 co-relation queries the response was YES. [2022-12-06 00:04:08,924 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 00:04:08,939 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 313 transitions, 2634 flow [2022-12-06 00:04:08,940 INFO L188 LiptonReduction]: Number of co-enabled transitions 6280 [2022-12-06 00:04:08,944 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:04:08,945 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 273 [2022-12-06 00:04:08,945 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 313 transitions, 2634 flow [2022-12-06 00:04:08,945 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 00:04:08,945 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:08,945 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 00:04:08,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 00:04:08,946 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 00:04:08,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:08,946 INFO L85 PathProgramCache]: Analyzing trace with hash 105452624, now seen corresponding path program 1 times [2022-12-06 00:04:08,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:08,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952246021] [2022-12-06 00:04:08,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:08,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:09,475 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 00:04:09,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:09,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952246021] [2022-12-06 00:04:09,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952246021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:09,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:09,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 00:04:09,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128246710] [2022-12-06 00:04:09,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:09,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:04:09,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:09,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:04:09,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:04:09,477 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 104 [2022-12-06 00:04:09,477 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 00:04:09,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:09,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 104 [2022-12-06 00:04:09,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:18,216 INFO L130 PetriNetUnfolder]: 53341/69413 cut-off events. [2022-12-06 00:04:18,216 INFO L131 PetriNetUnfolder]: For 99906/99906 co-relation queries the response was YES. [2022-12-06 00:04:18,772 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 00:04:19,103 INFO L137 encePairwiseOnDemand]: 60/104 looper letters, 375 selfloop transitions, 123 changer transitions 22/532 dead transitions. [2022-12-06 00:04:19,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 532 transitions, 4326 flow [2022-12-06 00:04:19,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 00:04:19,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 00:04:19,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 555 transitions. [2022-12-06 00:04:19,106 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31391402714932126 [2022-12-06 00:04:19,106 INFO L175 Difference]: Start difference. First operand has 161 places, 313 transitions, 2634 flow. Second operand 17 states and 555 transitions. [2022-12-06 00:04:19,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 532 transitions, 4326 flow [2022-12-06 00:04:22,477 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 00:04:22,506 INFO L231 Difference]: Finished difference. Result has 171 places, 323 transitions, 2779 flow [2022-12-06 00:04:22,506 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 00:04:22,511 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 93 predicate places. [2022-12-06 00:04:22,512 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:22,512 INFO L89 Accepts]: Start accepts. Operand has 171 places, 323 transitions, 2779 flow [2022-12-06 00:04:22,515 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:22,515 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:22,515 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 323 transitions, 2779 flow [2022-12-06 00:04:22,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 323 transitions, 2779 flow [2022-12-06 00:04:22,874 INFO L130 PetriNetUnfolder]: 1007/2130 cut-off events. [2022-12-06 00:04:22,874 INFO L131 PetriNetUnfolder]: For 3174/3348 co-relation queries the response was YES. [2022-12-06 00:04:22,891 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 00:04:22,914 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 323 transitions, 2779 flow [2022-12-06 00:04:22,915 INFO L188 LiptonReduction]: Number of co-enabled transitions 6496 [2022-12-06 00:04:22,933 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 00:04:23,105 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 00:04:23,213 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 00:04:23,504 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 00:04:23,659 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 00:04:23,740 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 00:04:23,907 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 00:04:23,910 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1398 [2022-12-06 00:04:23,910 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 319 transitions, 2773 flow [2022-12-06 00:04:23,911 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 00:04:23,911 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:23,911 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 00:04:23,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 00:04:23,911 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 00:04:23,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:23,911 INFO L85 PathProgramCache]: Analyzing trace with hash 56873276, now seen corresponding path program 1 times [2022-12-06 00:04:23,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:23,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310845569] [2022-12-06 00:04:23,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:23,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:24,489 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 00:04:24,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:24,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310845569] [2022-12-06 00:04:24,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310845569] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:24,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:24,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 00:04:24,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596423833] [2022-12-06 00:04:24,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:24,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:04:24,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:24,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:04:24,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:04:24,491 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 110 [2022-12-06 00:04:24,491 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 00:04:24,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:24,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 110 [2022-12-06 00:04:24,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:33,697 INFO L130 PetriNetUnfolder]: 52809/68697 cut-off events. [2022-12-06 00:04:33,698 INFO L131 PetriNetUnfolder]: For 115945/115945 co-relation queries the response was YES. [2022-12-06 00:04:34,469 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 00:04:34,856 INFO L137 encePairwiseOnDemand]: 59/110 looper letters, 353 selfloop transitions, 131 changer transitions 28/524 dead transitions. [2022-12-06 00:04:34,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 524 transitions, 4388 flow [2022-12-06 00:04:34,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 00:04:34,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 00:04:34,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 549 transitions. [2022-12-06 00:04:34,858 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3119318181818182 [2022-12-06 00:04:34,858 INFO L175 Difference]: Start difference. First operand has 166 places, 319 transitions, 2773 flow. Second operand 16 states and 549 transitions. [2022-12-06 00:04:34,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 524 transitions, 4388 flow [2022-12-06 00:04:37,760 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 00:04:37,766 INFO L231 Difference]: Finished difference. Result has 173 places, 319 transitions, 2873 flow [2022-12-06 00:04:37,767 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 00:04:37,768 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 95 predicate places. [2022-12-06 00:04:37,768 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:37,768 INFO L89 Accepts]: Start accepts. Operand has 173 places, 319 transitions, 2873 flow [2022-12-06 00:04:37,773 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:37,773 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:37,774 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 319 transitions, 2873 flow [2022-12-06 00:04:37,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 319 transitions, 2873 flow [2022-12-06 00:04:37,949 INFO L130 PetriNetUnfolder]: 993/2110 cut-off events. [2022-12-06 00:04:37,949 INFO L131 PetriNetUnfolder]: For 3048/3222 co-relation queries the response was YES. [2022-12-06 00:04:37,965 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 00:04:37,985 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 319 transitions, 2873 flow [2022-12-06 00:04:37,986 INFO L188 LiptonReduction]: Number of co-enabled transitions 6368 [2022-12-06 00:04:37,993 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 00:04:38,078 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 00:04:38,152 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:04:38,153 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 385 [2022-12-06 00:04:38,153 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 317 transitions, 2867 flow [2022-12-06 00:04:38,153 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 00:04:38,153 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:38,153 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 00:04:38,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 00:04:38,153 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 00:04:38,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:38,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1853922615, now seen corresponding path program 1 times [2022-12-06 00:04:38,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:38,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115271538] [2022-12-06 00:04:38,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:38,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:38,678 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 00:04:38,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:38,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115271538] [2022-12-06 00:04:38,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115271538] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:38,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:38,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 00:04:38,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881072719] [2022-12-06 00:04:38,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:38,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:04:38,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:38,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:04:38,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:04:38,680 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 110 [2022-12-06 00:04:38,680 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 00:04:38,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:38,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 110 [2022-12-06 00:04:38,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:48,188 INFO L130 PetriNetUnfolder]: 51930/67448 cut-off events. [2022-12-06 00:04:48,189 INFO L131 PetriNetUnfolder]: For 110535/110535 co-relation queries the response was YES. [2022-12-06 00:04:48,918 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 00:04:49,170 INFO L137 encePairwiseOnDemand]: 61/110 looper letters, 290 selfloop transitions, 112 changer transitions 24/438 dead transitions. [2022-12-06 00:04:49,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 438 transitions, 4121 flow [2022-12-06 00:04:49,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 00:04:49,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 00:04:49,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 396 transitions. [2022-12-06 00:04:49,172 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-06 00:04:49,172 INFO L175 Difference]: Start difference. First operand has 170 places, 317 transitions, 2867 flow. Second operand 12 states and 396 transitions. [2022-12-06 00:04:49,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 438 transitions, 4121 flow [2022-12-06 00:04:54,113 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 00:04:54,120 INFO L231 Difference]: Finished difference. Result has 171 places, 319 transitions, 2891 flow [2022-12-06 00:04:54,120 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 00:04:54,121 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 93 predicate places. [2022-12-06 00:04:54,121 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:54,121 INFO L89 Accepts]: Start accepts. Operand has 171 places, 319 transitions, 2891 flow [2022-12-06 00:04:54,123 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:54,123 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:54,123 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 319 transitions, 2891 flow [2022-12-06 00:04:54,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 319 transitions, 2891 flow [2022-12-06 00:04:54,313 INFO L130 PetriNetUnfolder]: 989/2087 cut-off events. [2022-12-06 00:04:54,314 INFO L131 PetriNetUnfolder]: For 2860/3034 co-relation queries the response was YES. [2022-12-06 00:04:54,326 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 00:04:54,342 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 168 places, 319 transitions, 2891 flow [2022-12-06 00:04:54,342 INFO L188 LiptonReduction]: Number of co-enabled transitions 6284 [2022-12-06 00:04:54,354 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 00:04:54,457 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 00:04:54,616 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 00:04:54,847 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 00:04:54,919 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 00:04:54,978 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 00:04:55,005 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 00:04:55,065 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 00:04:55,122 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 00:04:55,175 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 00:04:55,228 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:04:55,229 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1108 [2022-12-06 00:04:55,229 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 318 transitions, 2964 flow [2022-12-06 00:04:55,229 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 00:04:55,230 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:55,230 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 00:04:55,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 00:04:55,230 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 00:04:55,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:55,230 INFO L85 PathProgramCache]: Analyzing trace with hash -735284647, now seen corresponding path program 1 times [2022-12-06 00:04:55,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:55,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189707656] [2022-12-06 00:04:55,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:55,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:55,945 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 00:04:55,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:55,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189707656] [2022-12-06 00:04:55,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189707656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:55,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:55,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 00:04:55,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688116521] [2022-12-06 00:04:55,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:55,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:04:55,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:55,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:04:55,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:04:55,949 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 111 [2022-12-06 00:04:55,949 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 00:04:55,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:55,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 111 [2022-12-06 00:04:55,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:04,169 INFO L130 PetriNetUnfolder]: 51578/67021 cut-off events. [2022-12-06 00:05:04,170 INFO L131 PetriNetUnfolder]: For 108254/108254 co-relation queries the response was YES. [2022-12-06 00:05:04,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246672 conditions, 67021 events. 51578/67021 cut-off events. For 108254/108254 co-relation queries the response was YES. Maximal size of possible extension queue 1656. Compared 348538 event pairs, 6733 based on Foata normal form. 1/63774 useless extension candidates. Maximal degree in co-relation 244024. Up to 60925 conditions per place. [2022-12-06 00:05:05,097 INFO L137 encePairwiseOnDemand]: 61/111 looper letters, 304 selfloop transitions, 116 changer transitions 19/451 dead transitions. [2022-12-06 00:05:05,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 451 transitions, 4267 flow [2022-12-06 00:05:05,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 00:05:05,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 00:05:05,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 410 transitions. [2022-12-06 00:05:05,100 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3078078078078078 [2022-12-06 00:05:05,100 INFO L175 Difference]: Start difference. First operand has 167 places, 318 transitions, 2964 flow. Second operand 12 states and 410 transitions. [2022-12-06 00:05:05,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 451 transitions, 4267 flow [2022-12-06 00:05:07,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 451 transitions, 3884 flow, removed 37 selfloop flow, removed 11 redundant places. [2022-12-06 00:05:07,634 INFO L231 Difference]: Finished difference. Result has 169 places, 323 transitions, 2878 flow [2022-12-06 00:05:07,634 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=2605, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2878, PETRI_PLACES=169, PETRI_TRANSITIONS=323} [2022-12-06 00:05:07,636 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 91 predicate places. [2022-12-06 00:05:07,636 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:07,636 INFO L89 Accepts]: Start accepts. Operand has 169 places, 323 transitions, 2878 flow [2022-12-06 00:05:07,640 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:07,640 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:07,640 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 323 transitions, 2878 flow [2022-12-06 00:05:07,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 323 transitions, 2878 flow [2022-12-06 00:05:07,822 INFO L130 PetriNetUnfolder]: 1005/2104 cut-off events. [2022-12-06 00:05:07,822 INFO L131 PetriNetUnfolder]: For 2871/3088 co-relation queries the response was YES. [2022-12-06 00:05:07,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6529 conditions, 2104 events. 1005/2104 cut-off events. For 2871/3088 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 14801 event pairs, 230 based on Foata normal form. 0/1882 useless extension candidates. Maximal degree in co-relation 6438. Up to 1102 conditions per place. [2022-12-06 00:05:07,860 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 323 transitions, 2878 flow [2022-12-06 00:05:07,860 INFO L188 LiptonReduction]: Number of co-enabled transitions 6302 [2022-12-06 00:05:07,862 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->L81: Formula: (and (= v_~y_1~0_242 v_~temp_5~0_165) (= v_~y_1~0_241 (+ v_~temp_5~0_165 1)) (= v_~f2_3~0_218 1) (= v_~x_0~0_249 v_~temp_4~0_167) (= (+ v_~temp_4~0_167 1) v_~x_0~0_248) (= v_~f1_2~0_228 1)) InVars {~y_1~0=v_~y_1~0_242, ~x_0~0=v_~x_0~0_249} OutVars{~temp_4~0=v_~temp_4~0_167, ~f1_2~0=v_~f1_2~0_228, ~f2_3~0=v_~f2_3~0_218, ~y_1~0=v_~y_1~0_241, ~x_0~0=v_~x_0~0_248, ~temp_5~0=v_~temp_5~0_165} AuxVars[] AssignedVars[~temp_4~0, ~f1_2~0, ~f2_3~0, ~y_1~0, ~x_0~0, ~temp_5~0] and [838] $Ultimate##0-->L144: Formula: (and (= v_~y_1~0_279 v_~temp_4~0_215) (= v_~f2_9~0_224 1) (= v_~temp_10~0_183 v_~x_6~0_280) (not (= 0 |v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_63|)) (= |v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_63| |v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_63|) (= v_~y_7~0_233 (+ v_~temp_11~0_175 1)) (= v_~f1_8~0_232 1) (= |v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_63| (ite (and (not (= (mod v_~f2_3~0_278 256) 0)) (not (= (mod v_~f1_2~0_280 256) 0))) 1 0)) (= v_~x_6~0_279 (+ v_~temp_10~0_183 1))) InVars {~f1_2~0=v_~f1_2~0_280, ~f2_3~0=v_~f2_3~0_278, ~x_6~0=v_~x_6~0_280, ~temp_11~0=v_~temp_11~0_175, ~y_1~0=v_~y_1~0_279} OutVars{~temp_4~0=v_~temp_4~0_215, ~f2_9~0=v_~f2_9~0_224, ~f1_2~0=v_~f1_2~0_280, ~f2_3~0=v_~f2_3~0_278, ~temp_10~0=v_~temp_10~0_183, thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_63|, ~x_6~0=v_~x_6~0_279, ~temp_11~0=v_~temp_11~0_175, ~y_1~0=v_~y_1~0_279, thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_63|, ~y_7~0=v_~y_7~0_233, ~f1_8~0=v_~f1_8~0_232} AuxVars[] AssignedVars[~temp_4~0, ~f2_9~0, ~temp_10~0, thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, ~x_6~0, thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1, ~y_7~0, ~f1_8~0] [2022-12-06 00:05:08,010 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->L81: Formula: (and (= v_~y_1~0_242 v_~temp_5~0_165) (= v_~y_1~0_241 (+ v_~temp_5~0_165 1)) (= v_~f2_3~0_218 1) (= v_~x_0~0_249 v_~temp_4~0_167) (= (+ v_~temp_4~0_167 1) v_~x_0~0_248) (= v_~f1_2~0_228 1)) InVars {~y_1~0=v_~y_1~0_242, ~x_0~0=v_~x_0~0_249} OutVars{~temp_4~0=v_~temp_4~0_167, ~f1_2~0=v_~f1_2~0_228, ~f2_3~0=v_~f2_3~0_218, ~y_1~0=v_~y_1~0_241, ~x_0~0=v_~x_0~0_248, ~temp_5~0=v_~temp_5~0_165} AuxVars[] AssignedVars[~temp_4~0, ~f1_2~0, ~f2_3~0, ~y_1~0, ~x_0~0, ~temp_5~0] and [834] $Ultimate##0-->thread2EXIT: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_61|)) (= |v_thread2Thread1of1ForFork5_#res#1.base_39| 0) (= v_~y_1~0_271 (+ v_~temp_4~0_209 1)) (= v_~f1_8~0_224 1) (= |v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_61| (ite (and (not (= (mod v_~f1_2~0_274 256) 0)) (not (= (mod v_~f2_3~0_272 256) 0))) 1 0)) (= v_~temp_10~0_175 v_~x_6~0_264) (= |v_thread2Thread1of1ForFork5_#res#1.offset_39| 0) (= (+ v_~temp_10~0_175 1) v_~x_6~0_263) (= v_~y_1~0_272 v_~temp_4~0_209) (= |v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_61| |v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_61|)) InVars {~f1_2~0=v_~f1_2~0_274, ~f2_3~0=v_~f2_3~0_272, ~x_6~0=v_~x_6~0_264, ~y_1~0=v_~y_1~0_272} OutVars{~temp_4~0=v_~temp_4~0_209, thread2Thread1of1ForFork5_#res#1.offset=|v_thread2Thread1of1ForFork5_#res#1.offset_39|, ~f1_2~0=v_~f1_2~0_274, ~f2_3~0=v_~f2_3~0_272, ~temp_10~0=v_~temp_10~0_175, thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_61|, ~x_6~0=v_~x_6~0_263, ~y_1~0=v_~y_1~0_271, thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1_61|, thread2Thread1of1ForFork5_#res#1.base=|v_thread2Thread1of1ForFork5_#res#1.base_39|, ~f1_8~0=v_~f1_8~0_224} AuxVars[] AssignedVars[~temp_4~0, thread2Thread1of1ForFork5_#res#1.offset, ~temp_10~0, thread2Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, ~x_6~0, ~y_1~0, thread2Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork5_#res#1.base, ~f1_8~0] [2022-12-06 00:05:08,152 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [652] L97-->L34: Formula: (and (= (store |v_#length_60| |v_thread1Thread1of1ForFork1_~#t3~0#1.base_27| 4) |v_#length_59|) (= (ite (and (= (mod v_~f2_3~0_26 256) 0) (= v_~x_0~0_18 v_~y_1~0_25) (= (mod v_~f1_2~0_25 256) 0)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (= (select |v_#valid_105| |v_thread1Thread1of1ForFork1_~#t3~0#1.base_27|) 0) (not (= |v_thread1Thread1of1ForFork1_~#t3~0#1.base_27| 0)) (= |v_thread1Thread1of1ForFork1_~#t3~0#1.offset_21| 0) (= |v_#valid_104| (store |v_#valid_105| |v_thread1Thread1of1ForFork1_~#t3~0#1.base_27| 1)) (< |v_#StackHeapBarrier_28| |v_thread1Thread1of1ForFork1_~#t3~0#1.base_27|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_28|, ~f1_2~0=v_~f1_2~0_25, ~f2_3~0=v_~f2_3~0_26, #valid=|v_#valid_105|, #length=|v_#length_60|, ~y_1~0=v_~y_1~0_25, ~x_0~0=v_~x_0~0_18} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_28|, ~f1_2~0=v_~f1_2~0_25, ~f2_3~0=v_~f2_3~0_26, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, #valid=|v_#valid_104|, thread1Thread1of1ForFork1_~#t3~0#1.base=|v_thread1Thread1of1ForFork1_~#t3~0#1.base_27|, #length=|v_#length_59|, thread1Thread1of1ForFork1_~#t3~0#1.offset=|v_thread1Thread1of1ForFork1_~#t3~0#1.offset_21|, ~y_1~0=v_~y_1~0_25, ~x_0~0=v_~x_0~0_18, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #valid, thread1Thread1of1ForFork1_~#t3~0#1.base, #length, thread1Thread1of1ForFork1_~#t3~0#1.offset, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 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 00:05:08,267 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [652] L97-->L34: Formula: (and (= (store |v_#length_60| |v_thread1Thread1of1ForFork1_~#t3~0#1.base_27| 4) |v_#length_59|) (= (ite (and (= (mod v_~f2_3~0_26 256) 0) (= v_~x_0~0_18 v_~y_1~0_25) (= (mod v_~f1_2~0_25 256) 0)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (= (select |v_#valid_105| |v_thread1Thread1of1ForFork1_~#t3~0#1.base_27|) 0) (not (= |v_thread1Thread1of1ForFork1_~#t3~0#1.base_27| 0)) (= |v_thread1Thread1of1ForFork1_~#t3~0#1.offset_21| 0) (= |v_#valid_104| (store |v_#valid_105| |v_thread1Thread1of1ForFork1_~#t3~0#1.base_27| 1)) (< |v_#StackHeapBarrier_28| |v_thread1Thread1of1ForFork1_~#t3~0#1.base_27|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_28|, ~f1_2~0=v_~f1_2~0_25, ~f2_3~0=v_~f2_3~0_26, #valid=|v_#valid_105|, #length=|v_#length_60|, ~y_1~0=v_~y_1~0_25, ~x_0~0=v_~x_0~0_18} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_28|, ~f1_2~0=v_~f1_2~0_25, ~f2_3~0=v_~f2_3~0_26, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, #valid=|v_#valid_104|, thread1Thread1of1ForFork1_~#t3~0#1.base=|v_thread1Thread1of1ForFork1_~#t3~0#1.base_27|, #length=|v_#length_59|, thread1Thread1of1ForFork1_~#t3~0#1.offset=|v_thread1Thread1of1ForFork1_~#t3~0#1.offset_21|, ~y_1~0=v_~y_1~0_25, ~x_0~0=v_~x_0~0_18, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #valid, thread1Thread1of1ForFork1_~#t3~0#1.base, #length, thread1Thread1of1ForFork1_~#t3~0#1.offset, thread1Thread1of1ForFork1_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 00:05:08,357 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:05:08,358 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 722 [2022-12-06 00:05:08,358 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 322 transitions, 2900 flow [2022-12-06 00:05:08,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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 00:05:08,358 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:08,358 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] [2022-12-06 00:05:08,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 00:05:08,358 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 00:05:08,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:08,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1664732534, now seen corresponding path program 1 times [2022-12-06 00:05:08,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:08,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67914778] [2022-12-06 00:05:08,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:08,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:08,970 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 00:05:08,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:08,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67914778] [2022-12-06 00:05:08,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67914778] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:08,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:08,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 00:05:08,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769742576] [2022-12-06 00:05:08,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:08,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:05:08,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:08,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:05:08,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:05:08,972 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 113 [2022-12-06 00:05:08,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 322 transitions, 2900 flow. Second operand has 10 states, 10 states have (on average 15.5) internal successors, (155), 10 states have internal predecessors, (155), 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 00:05:08,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:08,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 113 [2022-12-06 00:05:08,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:15,416 INFO L130 PetriNetUnfolder]: 51651/67028 cut-off events. [2022-12-06 00:05:15,417 INFO L131 PetriNetUnfolder]: For 101343/101343 co-relation queries the response was YES. [2022-12-06 00:05:16,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237906 conditions, 67028 events. 51651/67028 cut-off events. For 101343/101343 co-relation queries the response was YES. Maximal size of possible extension queue 1757. Compared 348754 event pairs, 7654 based on Foata normal form. 1/63655 useless extension candidates. Maximal degree in co-relation 235260. Up to 60245 conditions per place. [2022-12-06 00:05:16,379 INFO L137 encePairwiseOnDemand]: 72/113 looper letters, 320 selfloop transitions, 77 changer transitions 35/444 dead transitions. [2022-12-06 00:05:16,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 444 transitions, 4119 flow [2022-12-06 00:05:16,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 00:05:16,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 00:05:16,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 404 transitions. [2022-12-06 00:05:16,380 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27501701837985026 [2022-12-06 00:05:16,380 INFO L175 Difference]: Start difference. First operand has 168 places, 322 transitions, 2900 flow. Second operand 13 states and 404 transitions. [2022-12-06 00:05:16,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 444 transitions, 4119 flow [2022-12-06 00:05:18,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 444 transitions, 3834 flow, removed 20 selfloop flow, removed 10 redundant places. [2022-12-06 00:05:18,250 INFO L231 Difference]: Finished difference. Result has 175 places, 329 transitions, 2843 flow [2022-12-06 00:05:18,250 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=2625, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2843, PETRI_PLACES=175, PETRI_TRANSITIONS=329} [2022-12-06 00:05:18,250 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 97 predicate places. [2022-12-06 00:05:18,251 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:18,251 INFO L89 Accepts]: Start accepts. Operand has 175 places, 329 transitions, 2843 flow [2022-12-06 00:05:18,252 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:18,252 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:18,252 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 329 transitions, 2843 flow [2022-12-06 00:05:18,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 329 transitions, 2843 flow [2022-12-06 00:05:18,398 INFO L130 PetriNetUnfolder]: 992/2110 cut-off events. [2022-12-06 00:05:18,399 INFO L131 PetriNetUnfolder]: For 2886/3217 co-relation queries the response was YES. [2022-12-06 00:05:18,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6576 conditions, 2110 events. 992/2110 cut-off events. For 2886/3217 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 14939 event pairs, 236 based on Foata normal form. 1/1877 useless extension candidates. Maximal degree in co-relation 6519. Up to 1083 conditions per place. [2022-12-06 00:05:18,430 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 329 transitions, 2843 flow [2022-12-06 00:05:18,430 INFO L188 LiptonReduction]: Number of co-enabled transitions 6338 [2022-12-06 00:05:18,520 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [624] L160-->L34: Formula: (and (= (select |v_#valid_35| |v_thread4Thread1of1ForFork3_~#t6~0#1.base_19|) 0) (< |v_#StackHeapBarrier_10| |v_thread4Thread1of1ForFork3_~#t6~0#1.base_19|) (= |v_thread4Thread1of1ForFork3_~#t6~0#1.offset_17| 0) (= |v_#valid_34| (store |v_#valid_35| |v_thread4Thread1of1ForFork3_~#t6~0#1.base_19| 1)) (= (ite (and (= (mod v_~f1_8~0_34 256) 0) (= v_~x_6~0_30 v_~y_7~0_22) (= (mod v_~f2_9~0_34 256) 0)) 1 0) |v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_9|) (not (= |v_thread4Thread1of1ForFork3_~#t6~0#1.base_19| 0)) (= (store |v_#length_20| |v_thread4Thread1of1ForFork3_~#t6~0#1.base_19| 4) |v_#length_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, ~f2_9~0=v_~f2_9~0_34, ~x_6~0=v_~x_6~0_30, #valid=|v_#valid_35|, #length=|v_#length_20|, ~y_7~0=v_~y_7~0_22, ~f1_8~0=v_~f1_8~0_34} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_13|, ~f2_9~0=v_~f2_9~0_34, ~x_6~0=v_~x_6~0_30, thread4Thread1of1ForFork3_~#t6~0#1.base=|v_thread4Thread1of1ForFork3_~#t6~0#1.base_19|, #valid=|v_#valid_34|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_9|, #length=|v_#length_19|, ~y_7~0=v_~y_7~0_22, ~f1_8~0=v_~f1_8~0_34, thread4Thread1of1ForFork3_~#t6~0#1.offset=|v_thread4Thread1of1ForFork3_~#t6~0#1.offset_17|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_~#t6~0#1.base, #valid, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, #length, thread4Thread1of1ForFork3_~#t6~0#1.offset] and [843] L97-->L101: Formula: (and (< |v_#StackHeapBarrier_174| |v_thread1Thread1of1ForFork1_~#t3~0#1.base_199|) (= (select |v_#valid_707| |v_thread1Thread1of1ForFork1_~#t3~0#1.base_199|) 0) (= |v_thread1Thread1of1ForFork1_#t~pre1#1_142| |v_#pthreadsForks_410|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_156| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_157| (ite (and (= (mod v_~f1_2~0_288 256) 0) (= v_~y_1~0_295 v_~x_0~0_374) (= (mod v_~f2_3~0_286 256) 0)) 1 0)) (= |v_thread1Thread1of1ForFork1_~#t3~0#1.offset_157| 0) (not (= |v_thread1Thread1of1ForFork1_~#t3~0#1.base_199| 0)) (= |v_#valid_706| (store |v_#valid_707| |v_thread1Thread1of1ForFork1_~#t3~0#1.base_199| 1)) (= (store |v_#length_474| |v_thread1Thread1of1ForFork1_~#t3~0#1.base_199| 4) |v_#length_473|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_157| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_156|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_174|, ~f1_2~0=v_~f1_2~0_288, #pthreadsForks=|v_#pthreadsForks_410|, ~f2_3~0=v_~f2_3~0_286, #valid=|v_#valid_707|, #length=|v_#length_474|, ~y_1~0=v_~y_1~0_295, ~x_0~0=v_~x_0~0_374} OutVars{~f2_3~0=v_~f2_3~0_286, thread1Thread1of1ForFork1_~#t3~0#1.base=|v_thread1Thread1of1ForFork1_~#t3~0#1.base_199|, thread1Thread1of1ForFork1_~#t3~0#1.offset=|v_thread1Thread1of1ForFork1_~#t3~0#1.offset_157|, ~x_0~0=v_~x_0~0_374, #StackHeapBarrier=|v_#StackHeapBarrier_174|, ~f1_2~0=v_~f1_2~0_288, #pthreadsForks=|v_#pthreadsForks_410|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_157|, #valid=|v_#valid_706|, thread1Thread1of1ForFork1_#t~pre1#1=|v_thread1Thread1of1ForFork1_#t~pre1#1_142|, #length=|v_#length_473|, ~y_1~0=v_~y_1~0_295, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_156|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #valid, thread1Thread1of1ForFork1_~#t3~0#1.base, thread1Thread1of1ForFork1_#t~pre1#1, thread1Thread1of1ForFork1_~#t3~0#1.offset, #length, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 00:05:18,635 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:18,636 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 385 [2022-12-06 00:05:18,636 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 328 transitions, 2843 flow [2022-12-06 00:05:18,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.5) internal successors, (155), 10 states have internal predecessors, (155), 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 00:05:18,636 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:18,636 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 00:05:18,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 00:05:18,636 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 00:05:18,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:18,637 INFO L85 PathProgramCache]: Analyzing trace with hash -481251300, now seen corresponding path program 1 times [2022-12-06 00:05:18,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:18,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704322925] [2022-12-06 00:05:18,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:18,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:19,022 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 00:05:19,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:19,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704322925] [2022-12-06 00:05:19,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704322925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:19,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:19,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:05:19,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618408838] [2022-12-06 00:05:19,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:19,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:05:19,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:19,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:05:19,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:05:19,024 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 114 [2022-12-06 00:05:19,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 328 transitions, 2843 flow. Second operand has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 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 00:05:19,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:19,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 114 [2022-12-06 00:05:19,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:27,014 INFO L130 PetriNetUnfolder]: 51930/67471 cut-off events. [2022-12-06 00:05:27,015 INFO L131 PetriNetUnfolder]: For 105576/105576 co-relation queries the response was YES. [2022-12-06 00:05:27,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243012 conditions, 67471 events. 51930/67471 cut-off events. For 105576/105576 co-relation queries the response was YES. Maximal size of possible extension queue 1749. Compared 352228 event pairs, 7952 based on Foata normal form. 1/64047 useless extension candidates. Maximal degree in co-relation 242950. Up to 62825 conditions per place. [2022-12-06 00:05:27,972 INFO L137 encePairwiseOnDemand]: 77/114 looper letters, 327 selfloop transitions, 66 changer transitions 35/440 dead transitions. [2022-12-06 00:05:27,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 440 transitions, 4005 flow [2022-12-06 00:05:27,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 00:05:27,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 00:05:27,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 370 transitions. [2022-12-06 00:05:27,974 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29505582137161085 [2022-12-06 00:05:27,974 INFO L175 Difference]: Start difference. First operand has 172 places, 328 transitions, 2843 flow. Second operand 11 states and 370 transitions. [2022-12-06 00:05:27,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 440 transitions, 4005 flow [2022-12-06 00:05:30,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 440 transitions, 3873 flow, removed 9 selfloop flow, removed 9 redundant places. [2022-12-06 00:05:30,265 INFO L231 Difference]: Finished difference. Result has 176 places, 329 transitions, 2865 flow [2022-12-06 00:05:30,265 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=2717, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2865, PETRI_PLACES=176, PETRI_TRANSITIONS=329} [2022-12-06 00:05:30,266 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 98 predicate places. [2022-12-06 00:05:30,266 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:30,266 INFO L89 Accepts]: Start accepts. Operand has 176 places, 329 transitions, 2865 flow [2022-12-06 00:05:30,267 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:30,267 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:30,267 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 329 transitions, 2865 flow [2022-12-06 00:05:30,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 329 transitions, 2865 flow [2022-12-06 00:05:30,462 INFO L130 PetriNetUnfolder]: 1018/2205 cut-off events. [2022-12-06 00:05:30,462 INFO L131 PetriNetUnfolder]: For 3269/3349 co-relation queries the response was YES. [2022-12-06 00:05:30,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7031 conditions, 2205 events. 1018/2205 cut-off events. For 3269/3349 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 15696 event pairs, 247 based on Foata normal form. 2/1979 useless extension candidates. Maximal degree in co-relation 6974. Up to 1119 conditions per place. [2022-12-06 00:05:30,495 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 329 transitions, 2865 flow [2022-12-06 00:05:30,496 INFO L188 LiptonReduction]: Number of co-enabled transitions 6360 [2022-12-06 00:05:30,498 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [832] L119-->thread6EXIT: Formula: (let ((.cse0 (ite (and (not (= (mod v_~f2_9~0_220 256) 0)) (not (= 0 (mod v_~f1_8~0_220 256)))) 1 0))) (and (= .cse0 |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_71|) (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_59| .cse0) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_71| |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_71|) (not (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_59| 0)) (= |v_thread6Thread1of1ForFork4_#res#1.offset_45| 0) (= |v_thread6Thread1of1ForFork4_#res#1.base_45| 0) (= |v_thread5Thread1of1ForFork2_#res#1.offset_43| 0) (= v_~x_6~0_255 (+ v_~temp_11~0_171 1)) (= v_~temp_11~0_171 v_~x_6~0_256) (= v_~temp_10~0_171 v_~y_7~0_228) (= v_~y_7~0_227 (+ v_~temp_10~0_171 1)) (= |v_thread5Thread1of1ForFork2_#res#1.base_43| 0) (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_59| |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_59|))) InVars {~f2_9~0=v_~f2_9~0_220, ~x_6~0=v_~x_6~0_256, ~y_7~0=v_~y_7~0_228, ~f1_8~0=v_~f1_8~0_220} OutVars{thread5Thread1of1ForFork2_#res#1.offset=|v_thread5Thread1of1ForFork2_#res#1.offset_43|, thread6Thread1of1ForFork4_#res#1.offset=|v_thread6Thread1of1ForFork4_#res#1.offset_45|, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_71|, ~f1_8~0=v_~f1_8~0_220, thread5Thread1of1ForFork2_#res#1.base=|v_thread5Thread1of1ForFork2_#res#1.base_43|, thread6Thread1of1ForFork4_#res#1.base=|v_thread6Thread1of1ForFork4_#res#1.base_45|, thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_71|, thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_59|, ~f2_9~0=v_~f2_9~0_220, ~temp_10~0=v_~temp_10~0_171, ~x_6~0=v_~x_6~0_255, ~temp_11~0=v_~temp_11~0_171, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_59|, ~y_7~0=v_~y_7~0_227} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_#res#1.offset, thread6Thread1of1ForFork4_#res#1.base, thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~temp_10~0, ~x_6~0, thread6Thread1of1ForFork4_#res#1.offset, ~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 00:05:30,608 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:30,609 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 343 [2022-12-06 00:05:30,609 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 328 transitions, 2859 flow [2022-12-06 00:05:30,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 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 00:05:30,609 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:30,609 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] [2022-12-06 00:05:30,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 00:05:30,609 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 00:05:30,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:30,610 INFO L85 PathProgramCache]: Analyzing trace with hash -789127430, now seen corresponding path program 1 times [2022-12-06 00:05:30,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:30,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636805425] [2022-12-06 00:05:30,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:30,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:31,131 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 00:05:31,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:31,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636805425] [2022-12-06 00:05:31,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636805425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:31,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:31,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 00:05:31,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526853558] [2022-12-06 00:05:31,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:31,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:05:31,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:31,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:05:31,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:05:31,133 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 114 [2022-12-06 00:05:31,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 328 transitions, 2859 flow. Second operand has 10 states, 10 states have (on average 15.5) internal successors, (155), 10 states have internal predecessors, (155), 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 00:05:31,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:31,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 114 [2022-12-06 00:05:31,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:39,420 INFO L130 PetriNetUnfolder]: 56426/73287 cut-off events. [2022-12-06 00:05:39,421 INFO L131 PetriNetUnfolder]: For 125726/125726 co-relation queries the response was YES. [2022-12-06 00:05:40,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266339 conditions, 73287 events. 56426/73287 cut-off events. For 125726/125726 co-relation queries the response was YES. Maximal size of possible extension queue 1949. Compared 387021 event pairs, 6220 based on Foata normal form. 1/69425 useless extension candidates. Maximal degree in co-relation 266277. Up to 59901 conditions per place. [2022-12-06 00:05:40,552 INFO L137 encePairwiseOnDemand]: 63/114 looper letters, 447 selfloop transitions, 117 changer transitions 38/614 dead transitions. [2022-12-06 00:05:40,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 614 transitions, 5244 flow [2022-12-06 00:05:40,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 00:05:40,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 00:05:40,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 618 transitions. [2022-12-06 00:05:40,554 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2853185595567867 [2022-12-06 00:05:40,554 INFO L175 Difference]: Start difference. First operand has 173 places, 328 transitions, 2859 flow. Second operand 19 states and 618 transitions. [2022-12-06 00:05:40,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 614 transitions, 5244 flow [2022-12-06 00:05:47,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 614 transitions, 5040 flow, removed 12 selfloop flow, removed 10 redundant places. [2022-12-06 00:05:47,796 INFO L231 Difference]: Finished difference. Result has 191 places, 377 transitions, 3540 flow [2022-12-06 00:05:47,797 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=2719, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3540, PETRI_PLACES=191, PETRI_TRANSITIONS=377} [2022-12-06 00:05:47,797 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 113 predicate places. [2022-12-06 00:05:47,797 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:47,797 INFO L89 Accepts]: Start accepts. Operand has 191 places, 377 transitions, 3540 flow [2022-12-06 00:05:47,799 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:47,799 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:47,800 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 377 transitions, 3540 flow [2022-12-06 00:05:47,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 377 transitions, 3540 flow [2022-12-06 00:05:48,032 INFO L130 PetriNetUnfolder]: 1154/2412 cut-off events. [2022-12-06 00:05:48,033 INFO L131 PetriNetUnfolder]: For 4463/4665 co-relation queries the response was YES. [2022-12-06 00:05:48,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8276 conditions, 2412 events. 1154/2412 cut-off events. For 4463/4665 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 17064 event pairs, 219 based on Foata normal form. 2/2167 useless extension candidates. Maximal degree in co-relation 8212. Up to 1225 conditions per place. [2022-12-06 00:05:48,122 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 189 places, 377 transitions, 3540 flow [2022-12-06 00:05:48,122 INFO L188 LiptonReduction]: Number of co-enabled transitions 7284 [2022-12-06 00:05:48,147 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:05:48,148 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 351 [2022-12-06 00:05:48,148 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 377 transitions, 3540 flow [2022-12-06 00:05:48,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.5) internal successors, (155), 10 states have internal predecessors, (155), 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 00:05:48,148 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:48,148 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] [2022-12-06 00:05:48,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 00:05:48,148 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 00:05:48,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:48,149 INFO L85 PathProgramCache]: Analyzing trace with hash -379113793, now seen corresponding path program 1 times [2022-12-06 00:05:48,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:48,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483196350] [2022-12-06 00:05:48,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:48,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:48,960 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 00:05:48,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:48,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483196350] [2022-12-06 00:05:48,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483196350] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:48,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:48,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 00:05:48,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600394354] [2022-12-06 00:05:48,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:48,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:05:48,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:48,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:05:48,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:05:48,962 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 114 [2022-12-06 00:05:48,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 377 transitions, 3540 flow. Second operand has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 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 00:05:48,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:48,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 114 [2022-12-06 00:05:48,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand