/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe001_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:24:08,123 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:24:08,125 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:24:08,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:24:08,188 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:24:08,191 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:24:08,194 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:24:08,198 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:24:08,202 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:24:08,207 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:24:08,208 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:24:08,210 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:24:08,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:24:08,212 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:24:08,213 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:24:08,216 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:24:08,217 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:24:08,217 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:24:08,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:24:08,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:24:08,226 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:24:08,227 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:24:08,228 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:24:08,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:24:08,236 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:24:08,237 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:24:08,237 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:24:08,239 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:24:08,239 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:24:08,240 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:24:08,240 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:24:08,246 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:24:08,248 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:24:08,249 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:24:08,249 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:24:08,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:24:08,250 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:24:08,250 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:24:08,250 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:24:08,251 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:24:08,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:24:08,253 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:24:08,286 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:24:08,286 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:24:08,288 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:24:08,288 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:24:08,288 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:24:08,289 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:24:08,289 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:24:08,290 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:24:08,290 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:24:08,290 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:24:08,291 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:24:08,291 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:24:08,291 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:24:08,291 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:24:08,292 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:24:08,292 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:24:08,292 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:24:08,292 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:24:08,292 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:24:08,293 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:24:08,293 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:24:08,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:24:08,293 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:24:08,293 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:24:08,294 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:24:08,294 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:24:08,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:24:08,294 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:24:08,294 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 04:24:08,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:24:08,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:24:08,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:24:08,623 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:24:08,624 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:24:08,625 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_power.oepc.i [2022-12-06 04:24:09,838 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:24:10,111 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:24:10,111 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_power.oepc.i [2022-12-06 04:24:10,124 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf1360a12/e45bb6886db443be950382bbb39e0080/FLAG250f857cc [2022-12-06 04:24:10,139 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf1360a12/e45bb6886db443be950382bbb39e0080 [2022-12-06 04:24:10,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:24:10,145 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:24:10,146 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:24:10,146 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:24:10,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:24:10,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:24:10" (1/1) ... [2022-12-06 04:24:10,149 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cfe8988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:10, skipping insertion in model container [2022-12-06 04:24:10,150 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:24:10" (1/1) ... [2022-12-06 04:24:10,155 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:24:10,202 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:24:10,323 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_power.oepc.i[995,1008] [2022-12-06 04:24:10,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:10,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:10,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:10,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:10,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:10,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:10,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:10,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:10,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:10,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:10,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:10,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:10,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:10,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:10,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:10,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:10,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:10,553 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:10,553 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:10,559 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:10,559 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:10,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:10,562 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:10,562 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:10,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:10,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:10,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:10,572 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:10,572 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:10,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:10,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:24:10,590 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:24:10,603 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_power.oepc.i[995,1008] [2022-12-06 04:24:10,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:10,629 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:10,629 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:10,629 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:10,629 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:10,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:10,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:10,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:10,631 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:10,631 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:10,631 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:10,632 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:10,632 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:10,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:10,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:10,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:10,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:10,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:10,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:10,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:10,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:10,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:10,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:10,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:10,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:10,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:10,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:10,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:10,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:10,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:10,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:24:10,694 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:24:10,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:10 WrapperNode [2022-12-06 04:24:10,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:24:10,696 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:24:10,696 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:24:10,696 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:24:10,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:10" (1/1) ... [2022-12-06 04:24:10,737 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:10" (1/1) ... [2022-12-06 04:24:10,783 INFO L138 Inliner]: procedures = 176, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 170 [2022-12-06 04:24:10,783 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:24:10,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:24:10,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:24:10,785 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:24:10,793 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:10" (1/1) ... [2022-12-06 04:24:10,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:10" (1/1) ... [2022-12-06 04:24:10,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:10" (1/1) ... [2022-12-06 04:24:10,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:10" (1/1) ... [2022-12-06 04:24:10,834 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:10" (1/1) ... [2022-12-06 04:24:10,836 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:10" (1/1) ... [2022-12-06 04:24:10,838 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:10" (1/1) ... [2022-12-06 04:24:10,840 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:10" (1/1) ... [2022-12-06 04:24:10,843 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:24:10,844 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:24:10,844 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:24:10,844 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:24:10,845 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:10" (1/1) ... [2022-12-06 04:24:10,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:24:10,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:24:10,892 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 04:24:10,915 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 04:24:10,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:24:10,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:24:10,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:24:10,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:24:10,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:24:10,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:24:10,938 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:24:10,938 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:24:10,938 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:24:10,938 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:24:10,938 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:24:10,939 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:24:10,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:24:10,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:24:10,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:24:10,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:24:10,941 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 04:24:11,151 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:24:11,153 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:24:11,641 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:24:11,998 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:24:11,998 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:24:12,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:24:12 BoogieIcfgContainer [2022-12-06 04:24:12,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:24:12,003 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:24:12,003 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:24:12,006 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:24:12,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:24:10" (1/3) ... [2022-12-06 04:24:12,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6188779e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:24:12, skipping insertion in model container [2022-12-06 04:24:12,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:10" (2/3) ... [2022-12-06 04:24:12,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6188779e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:24:12, skipping insertion in model container [2022-12-06 04:24:12,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:24:12" (3/3) ... [2022-12-06 04:24:12,009 INFO L112 eAbstractionObserver]: Analyzing ICFG safe001_power.oepc.i [2022-12-06 04:24:12,025 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:24:12,025 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 04:24:12,025 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:24:12,101 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:24:12,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2022-12-06 04:24:12,195 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-12-06 04:24:12,195 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:24:12,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-06 04:24:12,201 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 124 transitions, 263 flow [2022-12-06 04:24:12,204 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 109 transitions, 227 flow [2022-12-06 04:24:12,205 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:12,219 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 109 transitions, 227 flow [2022-12-06 04:24:12,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 109 transitions, 227 flow [2022-12-06 04:24:12,276 INFO L130 PetriNetUnfolder]: 1/109 cut-off events. [2022-12-06 04:24:12,276 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:24:12,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 1/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-12-06 04:24:12,281 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 109 transitions, 227 flow [2022-12-06 04:24:12,281 INFO L188 LiptonReduction]: Number of co-enabled transitions 1212 [2022-12-06 04:24:38,805 INFO L203 LiptonReduction]: Total number of compositions: 90 [2022-12-06 04:24:38,828 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:24:38,835 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;@6b8a104c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:24:38,835 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 04:24:38,842 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2022-12-06 04:24:38,843 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:24:38,843 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:38,844 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:38,844 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:24:38,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:38,848 INFO L85 PathProgramCache]: Analyzing trace with hash -572602539, now seen corresponding path program 1 times [2022-12-06 04:24:38,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:38,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876929544] [2022-12-06 04:24:38,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:38,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:39,094 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 04:24:39,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:39,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876929544] [2022-12-06 04:24:39,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876929544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:39,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:39,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:24:39,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337039312] [2022-12-06 04:24:39,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:39,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 04:24:39,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:39,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 04:24:39,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 04:24:39,133 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2022-12-06 04:24:39,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 51 flow. Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:24:39,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:39,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2022-12-06 04:24:39,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:39,411 INFO L130 PetriNetUnfolder]: 407/655 cut-off events. [2022-12-06 04:24:39,412 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 04:24:39,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 655 events. 407/655 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2816 event pairs, 407 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 1311. Up to 631 conditions per place. [2022-12-06 04:24:39,425 INFO L137 encePairwiseOnDemand]: 20/21 looper letters, 17 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2022-12-06 04:24:39,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 20 transitions, 83 flow [2022-12-06 04:24:39,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 04:24:39,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 04:24:39,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 24 transitions. [2022-12-06 04:24:39,436 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-06 04:24:39,438 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 51 flow. Second operand 2 states and 24 transitions. [2022-12-06 04:24:39,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 20 transitions, 83 flow [2022-12-06 04:24:39,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 20 transitions, 80 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:24:39,444 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 46 flow [2022-12-06 04:24:39,446 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=46, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2022-12-06 04:24:39,450 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2022-12-06 04:24:39,450 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:39,451 INFO L89 Accepts]: Start accepts. Operand has 28 places, 20 transitions, 46 flow [2022-12-06 04:24:39,453 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:39,454 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:39,454 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 20 transitions, 46 flow [2022-12-06 04:24:39,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 20 transitions, 46 flow [2022-12-06 04:24:39,462 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 04:24:39,462 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:24:39,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-06 04:24:39,463 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 20 transitions, 46 flow [2022-12-06 04:24:39,463 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-06 04:24:39,762 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:24:39,764 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 314 [2022-12-06 04:24:39,764 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 20 transitions, 46 flow [2022-12-06 04:24:39,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:24:39,764 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:39,764 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:39,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:24:39,765 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:24:39,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:39,765 INFO L85 PathProgramCache]: Analyzing trace with hash -515224621, now seen corresponding path program 1 times [2022-12-06 04:24:39,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:39,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712238292] [2022-12-06 04:24:39,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:39,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:39,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:24:39,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:39,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712238292] [2022-12-06 04:24:39,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712238292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:39,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:39,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:24:39,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121957666] [2022-12-06 04:24:39,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:39,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:24:39,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:39,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:24:39,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:24:39,944 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 04:24:39,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:24:39,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:39,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 04:24:39,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:40,189 INFO L130 PetriNetUnfolder]: 545/894 cut-off events. [2022-12-06 04:24:40,189 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:24:40,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1772 conditions, 894 events. 545/894 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4098 event pairs, 125 based on Foata normal form. 8/898 useless extension candidates. Maximal degree in co-relation 1764. Up to 775 conditions per place. [2022-12-06 04:24:40,195 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 27 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2022-12-06 04:24:40,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 32 transitions, 134 flow [2022-12-06 04:24:40,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:24:40,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:24:40,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 04:24:40,197 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2022-12-06 04:24:40,197 INFO L175 Difference]: Start difference. First operand has 27 places, 20 transitions, 46 flow. Second operand 3 states and 37 transitions. [2022-12-06 04:24:40,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 32 transitions, 134 flow [2022-12-06 04:24:40,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 32 transitions, 134 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:24:40,198 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 65 flow [2022-12-06 04:24:40,199 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2022-12-06 04:24:40,199 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2022-12-06 04:24:40,200 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:40,200 INFO L89 Accepts]: Start accepts. Operand has 30 places, 22 transitions, 65 flow [2022-12-06 04:24:40,200 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:40,200 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:40,201 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 22 transitions, 65 flow [2022-12-06 04:24:40,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 22 transitions, 65 flow [2022-12-06 04:24:40,220 INFO L130 PetriNetUnfolder]: 3/32 cut-off events. [2022-12-06 04:24:40,220 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:24:40,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 32 events. 3/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 65 event pairs, 1 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 45. Up to 10 conditions per place. [2022-12-06 04:24:40,221 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 22 transitions, 65 flow [2022-12-06 04:24:40,221 INFO L188 LiptonReduction]: Number of co-enabled transitions 212 [2022-12-06 04:24:40,362 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:24:40,363 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 04:24:40,363 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 65 flow [2022-12-06 04:24:40,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:24:40,364 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:40,364 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:40,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:24:40,364 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:24:40,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:40,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1207905047, now seen corresponding path program 1 times [2022-12-06 04:24:40,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:40,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668920205] [2022-12-06 04:24:40,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:40,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:40,614 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 04:24:40,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:40,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668920205] [2022-12-06 04:24:40,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668920205] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:40,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:40,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:24:40,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432090257] [2022-12-06 04:24:40,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:40,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:24:40,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:40,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:24:40,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:24:40,617 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2022-12-06 04:24:40,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 04:24:40,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:40,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2022-12-06 04:24:40,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:40,845 INFO L130 PetriNetUnfolder]: 450/763 cut-off events. [2022-12-06 04:24:40,845 INFO L131 PetriNetUnfolder]: For 98/98 co-relation queries the response was YES. [2022-12-06 04:24:40,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1649 conditions, 763 events. 450/763 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3533 event pairs, 118 based on Foata normal form. 14/772 useless extension candidates. Maximal degree in co-relation 1638. Up to 527 conditions per place. [2022-12-06 04:24:40,852 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 24 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2022-12-06 04:24:40,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 30 transitions, 138 flow [2022-12-06 04:24:40,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:24:40,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:24:40,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 04:24:40,854 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2022-12-06 04:24:40,854 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 65 flow. Second operand 3 states and 34 transitions. [2022-12-06 04:24:40,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 30 transitions, 138 flow [2022-12-06 04:24:40,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:24:40,855 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 70 flow [2022-12-06 04:24:40,855 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2022-12-06 04:24:40,857 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2022-12-06 04:24:40,857 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:40,857 INFO L89 Accepts]: Start accepts. Operand has 32 places, 22 transitions, 70 flow [2022-12-06 04:24:40,858 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:40,858 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:40,858 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 22 transitions, 70 flow [2022-12-06 04:24:40,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 22 transitions, 70 flow [2022-12-06 04:24:40,866 INFO L130 PetriNetUnfolder]: 3/32 cut-off events. [2022-12-06 04:24:40,867 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 04:24:40,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 32 events. 3/32 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 66 event pairs, 1 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 48. Up to 10 conditions per place. [2022-12-06 04:24:40,867 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 22 transitions, 70 flow [2022-12-06 04:24:40,867 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 04:24:40,869 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:24:40,871 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 04:24:40,871 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 70 flow [2022-12-06 04:24:40,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 04:24:40,871 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:40,871 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:40,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:24:40,872 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:24:40,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:40,872 INFO L85 PathProgramCache]: Analyzing trace with hash -158652350, now seen corresponding path program 1 times [2022-12-06 04:24:40,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:40,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911151740] [2022-12-06 04:24:40,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:40,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:41,178 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 04:24:41,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:41,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911151740] [2022-12-06 04:24:41,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911151740] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:41,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:41,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:24:41,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539138003] [2022-12-06 04:24:41,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:41,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:24:41,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:41,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:24:41,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:24:41,180 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2022-12-06 04:24:41,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:24:41,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:41,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2022-12-06 04:24:41,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:41,388 INFO L130 PetriNetUnfolder]: 469/771 cut-off events. [2022-12-06 04:24:41,389 INFO L131 PetriNetUnfolder]: For 203/203 co-relation queries the response was YES. [2022-12-06 04:24:41,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1769 conditions, 771 events. 469/771 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3510 event pairs, 135 based on Foata normal form. 9/776 useless extension candidates. Maximal degree in co-relation 1756. Up to 547 conditions per place. [2022-12-06 04:24:41,394 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 28 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2022-12-06 04:24:41,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 34 transitions, 163 flow [2022-12-06 04:24:41,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:24:41,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:24:41,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-06 04:24:41,398 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.65 [2022-12-06 04:24:41,398 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 70 flow. Second operand 3 states and 39 transitions. [2022-12-06 04:24:41,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 34 transitions, 163 flow [2022-12-06 04:24:41,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 157 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:24:41,401 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 74 flow [2022-12-06 04:24:41,401 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2022-12-06 04:24:41,405 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2022-12-06 04:24:41,405 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:41,406 INFO L89 Accepts]: Start accepts. Operand has 33 places, 22 transitions, 74 flow [2022-12-06 04:24:41,407 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:41,407 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:41,408 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 74 flow [2022-12-06 04:24:41,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 22 transitions, 74 flow [2022-12-06 04:24:41,419 INFO L130 PetriNetUnfolder]: 3/32 cut-off events. [2022-12-06 04:24:41,419 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 04:24:41,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 32 events. 3/32 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 67 event pairs, 1 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 52. Up to 10 conditions per place. [2022-12-06 04:24:41,420 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 74 flow [2022-12-06 04:24:41,420 INFO L188 LiptonReduction]: Number of co-enabled transitions 208 [2022-12-06 04:24:41,422 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:24:41,423 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 04:24:41,423 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 74 flow [2022-12-06 04:24:41,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:24:41,423 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:41,423 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:41,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:24:41,423 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:24:41,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:41,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1295960846, now seen corresponding path program 1 times [2022-12-06 04:24:41,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:41,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887169390] [2022-12-06 04:24:41,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:41,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:41,510 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 04:24:41,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:41,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887169390] [2022-12-06 04:24:41,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887169390] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:41,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:41,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:24:41,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322122574] [2022-12-06 04:24:41,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:41,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:24:41,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:41,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:24:41,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:24:41,513 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 04:24:41,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:24:41,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:41,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 04:24:41,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:41,765 INFO L130 PetriNetUnfolder]: 620/1008 cut-off events. [2022-12-06 04:24:41,765 INFO L131 PetriNetUnfolder]: For 386/386 co-relation queries the response was YES. [2022-12-06 04:24:41,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2438 conditions, 1008 events. 620/1008 cut-off events. For 386/386 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4912 event pairs, 333 based on Foata normal form. 24/1018 useless extension candidates. Maximal degree in co-relation 2424. Up to 613 conditions per place. [2022-12-06 04:24:41,772 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 29 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2022-12-06 04:24:41,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 34 transitions, 167 flow [2022-12-06 04:24:41,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:24:41,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:24:41,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-06 04:24:41,775 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2022-12-06 04:24:41,776 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 74 flow. Second operand 3 states and 38 transitions. [2022-12-06 04:24:41,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 34 transitions, 167 flow [2022-12-06 04:24:41,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 34 transitions, 163 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:24:41,784 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 81 flow [2022-12-06 04:24:41,785 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2022-12-06 04:24:41,786 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2022-12-06 04:24:41,787 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:41,787 INFO L89 Accepts]: Start accepts. Operand has 34 places, 22 transitions, 81 flow [2022-12-06 04:24:41,788 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:41,788 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:41,788 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 22 transitions, 81 flow [2022-12-06 04:24:41,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 22 transitions, 81 flow [2022-12-06 04:24:41,796 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-06 04:24:41,796 INFO L131 PetriNetUnfolder]: For 20/26 co-relation queries the response was YES. [2022-12-06 04:24:41,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 29 events. 0/29 cut-off events. For 20/26 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 71 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2022-12-06 04:24:41,797 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 22 transitions, 81 flow [2022-12-06 04:24:41,797 INFO L188 LiptonReduction]: Number of co-enabled transitions 208 [2022-12-06 04:24:41,806 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:24:41,809 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 04:24:41,809 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 81 flow [2022-12-06 04:24:41,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:24:41,809 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:41,809 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:41,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:24:41,809 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:24:41,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:41,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1960641544, now seen corresponding path program 1 times [2022-12-06 04:24:41,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:41,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969729380] [2022-12-06 04:24:41,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:41,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:43,071 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 04:24:43,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:43,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969729380] [2022-12-06 04:24:43,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969729380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:43,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:43,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:24:43,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804591991] [2022-12-06 04:24:43,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:43,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:24:43,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:43,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:24:43,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:24:43,074 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 04:24:43,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 81 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:24:43,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:43,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 04:24:43,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:43,495 INFO L130 PetriNetUnfolder]: 968/1518 cut-off events. [2022-12-06 04:24:43,496 INFO L131 PetriNetUnfolder]: For 706/731 co-relation queries the response was YES. [2022-12-06 04:24:43,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3637 conditions, 1518 events. 968/1518 cut-off events. For 706/731 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7175 event pairs, 698 based on Foata normal form. 17/1531 useless extension candidates. Maximal degree in co-relation 3623. Up to 1322 conditions per place. [2022-12-06 04:24:43,504 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 24 selfloop transitions, 7 changer transitions 0/33 dead transitions. [2022-12-06 04:24:43,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 173 flow [2022-12-06 04:24:43,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:24:43,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:24:43,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-12-06 04:24:43,505 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.425 [2022-12-06 04:24:43,505 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 81 flow. Second operand 4 states and 34 transitions. [2022-12-06 04:24:43,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 173 flow [2022-12-06 04:24:43,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 33 transitions, 165 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 04:24:43,508 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 120 flow [2022-12-06 04:24:43,508 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2022-12-06 04:24:43,509 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2022-12-06 04:24:43,509 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:43,509 INFO L89 Accepts]: Start accepts. Operand has 37 places, 27 transitions, 120 flow [2022-12-06 04:24:43,510 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:43,510 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:43,510 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 27 transitions, 120 flow [2022-12-06 04:24:43,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 27 transitions, 120 flow [2022-12-06 04:24:43,543 INFO L130 PetriNetUnfolder]: 42/146 cut-off events. [2022-12-06 04:24:43,543 INFO L131 PetriNetUnfolder]: For 177/198 co-relation queries the response was YES. [2022-12-06 04:24:43,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 146 events. 42/146 cut-off events. For 177/198 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 680 event pairs, 21 based on Foata normal form. 1/144 useless extension candidates. Maximal degree in co-relation 349. Up to 79 conditions per place. [2022-12-06 04:24:43,545 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 27 transitions, 120 flow [2022-12-06 04:24:43,545 INFO L188 LiptonReduction]: Number of co-enabled transitions 224 [2022-12-06 04:24:43,760 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [743] L793-->L801: Formula: (let ((.cse4 (= (mod v_~y$r_buff0_thd2~0_36 256) 0))) (let ((.cse9 (= (mod v_~y$r_buff1_thd2~0_34 256) 0)) (.cse1 (not .cse4)) (.cse11 (not (= (mod v_~y$w_buff0_used~0_260 256) 0))) (.cse8 (= (mod v_~y$w_buff1_used~0_243 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_261 256) 0))) (let ((.cse0 (not .cse3)) (.cse5 (not .cse8)) (.cse10 (and .cse1 .cse11)) (.cse6 (not .cse9)) (.cse7 (select |v_#memory_int_275| |v_~#y~0.base_206|))) (and (= (ite (and .cse0 .cse1) 0 v_~y$w_buff0_used~0_261) v_~y$w_buff0_used~0_260) (let ((.cse2 (= |v_P1Thread1of1ForFork2_#t~mem19_1| |v_P1_#t~mem19_32|))) (or (and .cse0 .cse1 .cse2 (= |v_P1Thread1of1ForFork2_#t~ite20_1| |v_P1_#t~ite20_29|) (= |v_P1_#t~ite21_25| v_~y$w_buff0~0_119)) (and (or .cse3 .cse4) (or (and .cse2 .cse5 (= v_~y$w_buff1~0_117 |v_P1_#t~ite20_29|) .cse6) (and (= (select .cse7 |v_~#y~0.offset_206|) |v_P1_#t~mem19_32|) (= |v_P1_#t~ite20_29| |v_P1_#t~mem19_32|) (or .cse8 .cse9))) (= |v_P1_#t~ite20_29| |v_P1_#t~ite21_25|)))) (= v_~y$w_buff1_used~0_242 (ite (or (and .cse5 .cse6) .cse10) 0 v_~y$w_buff1_used~0_243)) (= (ite .cse10 0 v_~y$r_buff0_thd2~0_36) v_~y$r_buff0_thd2~0_35) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_242 256) 0)) .cse6) (and (not (= (mod v_~y$r_buff0_thd2~0_35 256) 0)) .cse11)) 0 v_~y$r_buff1_thd2~0_34) v_~y$r_buff1_thd2~0_33) (= (store |v_#memory_int_275| |v_~#y~0.base_206| (store .cse7 |v_~#y~0.offset_206| |v_P1_#t~ite21_25|)) |v_#memory_int_274|))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_34, ~#y~0.offset=|v_~#y~0.offset_206|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_261, ~y$w_buff1~0=v_~y$w_buff1~0_117, ~y$w_buff0~0=v_~y$w_buff0~0_119, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_36, #memory_int=|v_#memory_int_275|, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_1|, ~#y~0.base=|v_~#y~0.base_206|, P1Thread1of1ForFork2_#t~mem19=|v_P1Thread1of1ForFork2_#t~mem19_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_243} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_33, ~#y~0.offset=|v_~#y~0.offset_206|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_260, ~y$w_buff1~0=v_~y$w_buff1~0_117, ~y$w_buff0~0=v_~y$w_buff0~0_119, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_35, #memory_int=|v_#memory_int_274|, ~#y~0.base=|v_~#y~0.base_206|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_242} AuxVars[|v_P1_#t~mem19_32|, |v_P1_#t~ite20_29|, |v_P1_#t~ite21_25|] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, #memory_int, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21, ~y$w_buff1_used~0, P1Thread1of1ForFork2_#t~mem19] and [797] $Ultimate##0-->L824: Formula: (let ((.cse14 (= (mod v_~y$w_buff1_used~0_317 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_105 256) 0)) (.cse15 (= (mod v_~y$r_buff0_thd3~0_118 256) 0)) (.cse16 (= (mod v_~y$w_buff0_used~0_339 256) 0))) (let ((.cse12 (not .cse16)) (.cse13 (not .cse15)) (.cse1 (and .cse15 .cse5)) (.cse3 (and .cse15 .cse14)) (.cse8 (= (mod v_~weak$$choice2~0_134 256) 0)) (.cse7 (select |v_#memory_int_393| |v_~#y~0.base_250|))) (let ((.cse10 (select .cse7 |v_~#y~0.offset_250|)) (.cse6 (= (mod v_~y$w_buff1_used~0_316 256) 0)) (.cse2 (= (mod v_~y$w_buff0_used~0_338 256) 0)) (.cse0 (not .cse8)) (.cse9 (or .cse1 .cse3 .cse16)) (.cse11 (and .cse12 .cse13))) (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P2Thread1of1ForFork0_#t~nondet22_10| v_~weak$$choice0~0_109) (= v_~y$flush_delayed~0_112 0) (= v_~y$w_buff1_used~0_316 (ite .cse0 v_~y$w_buff1_used~0_317 (ite (or .cse1 .cse2 .cse3) v_~y$w_buff1_used~0_317 0))) (= v_~y$w_buff1~0_180 v_~y$w_buff1~0_179) (= (ite .cse0 v_~y$r_buff1_thd3~0_105 (ite (let ((.cse4 (= (mod v_~y$r_buff0_thd3~0_117 256) 0))) (or (and .cse4 .cse5) .cse2 (and .cse4 .cse6))) v_~y$r_buff1_thd3~0_105 0)) v_~y$r_buff1_thd3~0_104) (= (store |v_#memory_int_393| |v_~#y~0.base_250| (store .cse7 |v_~#y~0.offset_250| |v_P2_#t~ite29_32|)) |v_#memory_int_392|) (or (and (= |v_P2_#t~ite29_32| v_~y$mem_tmp~0_84) .cse0 (= |v_P2Thread1of1ForFork0_#t~mem28_10| |v_P2_#t~mem28_31|)) (and (= |v_P2_#t~ite29_32| |v_P2_#t~mem28_31|) .cse8 (= |v_P2_#t~mem28_31| v_~__unbuffered_p2_EAX~0_42))) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (or (and .cse9 (= |v_P2_#t~mem25_47| v_~__unbuffered_p2_EAX~0_42) (= |v_P2_#t~mem25_47| .cse10)) (and (= (ite .cse11 v_~y$w_buff0~0_186 v_~y$w_buff1~0_180) v_~__unbuffered_p2_EAX~0_42) .cse12 (or (not .cse5) .cse13) (= |v_P2Thread1of1ForFork0_#t~mem25_10| |v_P2_#t~mem25_47|) (or .cse13 (not .cse14)))) (= v_~weak$$choice2~0_134 |v_P2Thread1of1ForFork0_#t~nondet23_10|) (= v_~y$w_buff0~0_186 v_~y$w_buff0~0_185) (= v_~y$mem_tmp~0_84 .cse10) (= (ite .cse0 v_~y$r_buff0_thd3~0_118 (ite (or .cse1 .cse2 (and .cse6 .cse15)) v_~y$r_buff0_thd3~0_118 (ite (and .cse13 (not .cse2)) 0 v_~y$r_buff0_thd3~0_118))) v_~y$r_buff0_thd3~0_117) (= v_~y$w_buff0_used~0_338 (ite .cse0 v_~y$w_buff0_used~0_339 (ite .cse9 v_~y$w_buff0_used~0_339 (ite .cse11 0 v_~y$w_buff0_used~0_339)))))))) InVars {~#y~0.offset=|v_~#y~0.offset_250|, P2Thread1of1ForFork0_#t~nondet22=|v_P2Thread1of1ForFork0_#t~nondet22_10|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_339, P2Thread1of1ForFork0_#t~mem28=|v_P2Thread1of1ForFork0_#t~mem28_10|, ~#y~0.base=|v_~#y~0.base_250|, P2Thread1of1ForFork0_#t~nondet23=|v_P2Thread1of1ForFork0_#t~nondet23_10|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_180, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_118, ~y$w_buff0~0=v_~y$w_buff0~0_186, #memory_int=|v_#memory_int_393|, P2Thread1of1ForFork0_#t~mem25=|v_P2Thread1of1ForFork0_#t~mem25_10|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_317} OutVars{~#y~0.offset=|v_~#y~0.offset_250|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_338, ~#y~0.base=|v_~#y~0.base_250|, P2Thread1of1ForFork0_#t~ite26=|v_P2Thread1of1ForFork0_#t~ite26_7|, ~y$mem_tmp~0=v_~y$mem_tmp~0_84, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_104, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_117, ~y$w_buff0~0=v_~y$w_buff0~0_185, ~y$flush_delayed~0=v_~y$flush_delayed~0_112, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_7|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_#t~mem27=|v_P2Thread1of1ForFork0_#t~mem27_7|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~weak$$choice0~0=v_~weak$$choice0~0_109, ~y$w_buff1~0=v_~y$w_buff1~0_179, #memory_int=|v_#memory_int_392|, P2Thread1of1ForFork0_#t~mem24=|v_P2Thread1of1ForFork0_#t~mem24_7|, ~weak$$choice2~0=v_~weak$$choice2~0_134, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_316} AuxVars[|v_P2_#t~ite29_32|, |v_P2_#t~mem28_31|, |v_P2_#t~mem25_47|] AssignedVars[P2Thread1of1ForFork0_#t~nondet22, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~mem27, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~mem28, P2Thread1of1ForFork0_#t~nondet23, P2Thread1of1ForFork0_#t~ite26, ~weak$$choice0~0, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, #memory_int, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~mem25, P2Thread1of1ForFork0_#t~mem24, P2Thread1of1ForFork0_#t~ite29, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-06 04:24:45,350 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L824-->L826: Formula: (= (store |v_#memory_int_25| |v_~#y~0.base_19| (store (select |v_#memory_int_25| |v_~#y~0.base_19|) |v_~#y~0.offset_19| 2)) |v_#memory_int_24|) InVars {#memory_int=|v_#memory_int_25|, ~#y~0.offset=|v_~#y~0.offset_19|, ~#y~0.base=|v_~#y~0.base_19|} OutVars{#memory_int=|v_#memory_int_24|, ~#y~0.offset=|v_~#y~0.offset_19|, ~#y~0.base=|v_~#y~0.base_19|} AuxVars[] AssignedVars[#memory_int] and [797] $Ultimate##0-->L824: Formula: (let ((.cse14 (= (mod v_~y$w_buff1_used~0_317 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_105 256) 0)) (.cse15 (= (mod v_~y$r_buff0_thd3~0_118 256) 0)) (.cse16 (= (mod v_~y$w_buff0_used~0_339 256) 0))) (let ((.cse12 (not .cse16)) (.cse13 (not .cse15)) (.cse1 (and .cse15 .cse5)) (.cse3 (and .cse15 .cse14)) (.cse8 (= (mod v_~weak$$choice2~0_134 256) 0)) (.cse7 (select |v_#memory_int_393| |v_~#y~0.base_250|))) (let ((.cse10 (select .cse7 |v_~#y~0.offset_250|)) (.cse6 (= (mod v_~y$w_buff1_used~0_316 256) 0)) (.cse2 (= (mod v_~y$w_buff0_used~0_338 256) 0)) (.cse0 (not .cse8)) (.cse9 (or .cse1 .cse3 .cse16)) (.cse11 (and .cse12 .cse13))) (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P2Thread1of1ForFork0_#t~nondet22_10| v_~weak$$choice0~0_109) (= v_~y$flush_delayed~0_112 0) (= v_~y$w_buff1_used~0_316 (ite .cse0 v_~y$w_buff1_used~0_317 (ite (or .cse1 .cse2 .cse3) v_~y$w_buff1_used~0_317 0))) (= v_~y$w_buff1~0_180 v_~y$w_buff1~0_179) (= (ite .cse0 v_~y$r_buff1_thd3~0_105 (ite (let ((.cse4 (= (mod v_~y$r_buff0_thd3~0_117 256) 0))) (or (and .cse4 .cse5) .cse2 (and .cse4 .cse6))) v_~y$r_buff1_thd3~0_105 0)) v_~y$r_buff1_thd3~0_104) (= (store |v_#memory_int_393| |v_~#y~0.base_250| (store .cse7 |v_~#y~0.offset_250| |v_P2_#t~ite29_32|)) |v_#memory_int_392|) (or (and (= |v_P2_#t~ite29_32| v_~y$mem_tmp~0_84) .cse0 (= |v_P2Thread1of1ForFork0_#t~mem28_10| |v_P2_#t~mem28_31|)) (and (= |v_P2_#t~ite29_32| |v_P2_#t~mem28_31|) .cse8 (= |v_P2_#t~mem28_31| v_~__unbuffered_p2_EAX~0_42))) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (or (and .cse9 (= |v_P2_#t~mem25_47| v_~__unbuffered_p2_EAX~0_42) (= |v_P2_#t~mem25_47| .cse10)) (and (= (ite .cse11 v_~y$w_buff0~0_186 v_~y$w_buff1~0_180) v_~__unbuffered_p2_EAX~0_42) .cse12 (or (not .cse5) .cse13) (= |v_P2Thread1of1ForFork0_#t~mem25_10| |v_P2_#t~mem25_47|) (or .cse13 (not .cse14)))) (= v_~weak$$choice2~0_134 |v_P2Thread1of1ForFork0_#t~nondet23_10|) (= v_~y$w_buff0~0_186 v_~y$w_buff0~0_185) (= v_~y$mem_tmp~0_84 .cse10) (= (ite .cse0 v_~y$r_buff0_thd3~0_118 (ite (or .cse1 .cse2 (and .cse6 .cse15)) v_~y$r_buff0_thd3~0_118 (ite (and .cse13 (not .cse2)) 0 v_~y$r_buff0_thd3~0_118))) v_~y$r_buff0_thd3~0_117) (= v_~y$w_buff0_used~0_338 (ite .cse0 v_~y$w_buff0_used~0_339 (ite .cse9 v_~y$w_buff0_used~0_339 (ite .cse11 0 v_~y$w_buff0_used~0_339)))))))) InVars {~#y~0.offset=|v_~#y~0.offset_250|, P2Thread1of1ForFork0_#t~nondet22=|v_P2Thread1of1ForFork0_#t~nondet22_10|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_339, P2Thread1of1ForFork0_#t~mem28=|v_P2Thread1of1ForFork0_#t~mem28_10|, ~#y~0.base=|v_~#y~0.base_250|, P2Thread1of1ForFork0_#t~nondet23=|v_P2Thread1of1ForFork0_#t~nondet23_10|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_180, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_118, ~y$w_buff0~0=v_~y$w_buff0~0_186, #memory_int=|v_#memory_int_393|, P2Thread1of1ForFork0_#t~mem25=|v_P2Thread1of1ForFork0_#t~mem25_10|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_317} OutVars{~#y~0.offset=|v_~#y~0.offset_250|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_338, ~#y~0.base=|v_~#y~0.base_250|, P2Thread1of1ForFork0_#t~ite26=|v_P2Thread1of1ForFork0_#t~ite26_7|, ~y$mem_tmp~0=v_~y$mem_tmp~0_84, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_104, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_117, ~y$w_buff0~0=v_~y$w_buff0~0_185, ~y$flush_delayed~0=v_~y$flush_delayed~0_112, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_7|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_#t~mem27=|v_P2Thread1of1ForFork0_#t~mem27_7|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~weak$$choice0~0=v_~weak$$choice0~0_109, ~y$w_buff1~0=v_~y$w_buff1~0_179, #memory_int=|v_#memory_int_392|, P2Thread1of1ForFork0_#t~mem24=|v_P2Thread1of1ForFork0_#t~mem24_7|, ~weak$$choice2~0=v_~weak$$choice2~0_134, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_316} AuxVars[|v_P2_#t~ite29_32|, |v_P2_#t~mem28_31|, |v_P2_#t~mem25_47|] AssignedVars[P2Thread1of1ForFork0_#t~nondet22, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~mem27, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~mem28, P2Thread1of1ForFork0_#t~nondet23, P2Thread1of1ForFork0_#t~ite26, ~weak$$choice0~0, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, #memory_int, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~mem25, P2Thread1of1ForFork0_#t~mem24, P2Thread1of1ForFork0_#t~ite29, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-06 04:24:45,900 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [742] L791-->L793: Formula: (= |v_#memory_int_11| (store |v_#memory_int_12| |v_~#y~0.base_10| (store (select |v_#memory_int_12| |v_~#y~0.base_10|) |v_~#y~0.offset_10| 1))) InVars {#memory_int=|v_#memory_int_12|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} OutVars{#memory_int=|v_#memory_int_11|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} AuxVars[] AssignedVars[#memory_int] and [797] $Ultimate##0-->L824: Formula: (let ((.cse14 (= (mod v_~y$w_buff1_used~0_317 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_105 256) 0)) (.cse15 (= (mod v_~y$r_buff0_thd3~0_118 256) 0)) (.cse16 (= (mod v_~y$w_buff0_used~0_339 256) 0))) (let ((.cse12 (not .cse16)) (.cse13 (not .cse15)) (.cse1 (and .cse15 .cse5)) (.cse3 (and .cse15 .cse14)) (.cse8 (= (mod v_~weak$$choice2~0_134 256) 0)) (.cse7 (select |v_#memory_int_393| |v_~#y~0.base_250|))) (let ((.cse10 (select .cse7 |v_~#y~0.offset_250|)) (.cse6 (= (mod v_~y$w_buff1_used~0_316 256) 0)) (.cse2 (= (mod v_~y$w_buff0_used~0_338 256) 0)) (.cse0 (not .cse8)) (.cse9 (or .cse1 .cse3 .cse16)) (.cse11 (and .cse12 .cse13))) (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P2Thread1of1ForFork0_#t~nondet22_10| v_~weak$$choice0~0_109) (= v_~y$flush_delayed~0_112 0) (= v_~y$w_buff1_used~0_316 (ite .cse0 v_~y$w_buff1_used~0_317 (ite (or .cse1 .cse2 .cse3) v_~y$w_buff1_used~0_317 0))) (= v_~y$w_buff1~0_180 v_~y$w_buff1~0_179) (= (ite .cse0 v_~y$r_buff1_thd3~0_105 (ite (let ((.cse4 (= (mod v_~y$r_buff0_thd3~0_117 256) 0))) (or (and .cse4 .cse5) .cse2 (and .cse4 .cse6))) v_~y$r_buff1_thd3~0_105 0)) v_~y$r_buff1_thd3~0_104) (= (store |v_#memory_int_393| |v_~#y~0.base_250| (store .cse7 |v_~#y~0.offset_250| |v_P2_#t~ite29_32|)) |v_#memory_int_392|) (or (and (= |v_P2_#t~ite29_32| v_~y$mem_tmp~0_84) .cse0 (= |v_P2Thread1of1ForFork0_#t~mem28_10| |v_P2_#t~mem28_31|)) (and (= |v_P2_#t~ite29_32| |v_P2_#t~mem28_31|) .cse8 (= |v_P2_#t~mem28_31| v_~__unbuffered_p2_EAX~0_42))) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (or (and .cse9 (= |v_P2_#t~mem25_47| v_~__unbuffered_p2_EAX~0_42) (= |v_P2_#t~mem25_47| .cse10)) (and (= (ite .cse11 v_~y$w_buff0~0_186 v_~y$w_buff1~0_180) v_~__unbuffered_p2_EAX~0_42) .cse12 (or (not .cse5) .cse13) (= |v_P2Thread1of1ForFork0_#t~mem25_10| |v_P2_#t~mem25_47|) (or .cse13 (not .cse14)))) (= v_~weak$$choice2~0_134 |v_P2Thread1of1ForFork0_#t~nondet23_10|) (= v_~y$w_buff0~0_186 v_~y$w_buff0~0_185) (= v_~y$mem_tmp~0_84 .cse10) (= (ite .cse0 v_~y$r_buff0_thd3~0_118 (ite (or .cse1 .cse2 (and .cse6 .cse15)) v_~y$r_buff0_thd3~0_118 (ite (and .cse13 (not .cse2)) 0 v_~y$r_buff0_thd3~0_118))) v_~y$r_buff0_thd3~0_117) (= v_~y$w_buff0_used~0_338 (ite .cse0 v_~y$w_buff0_used~0_339 (ite .cse9 v_~y$w_buff0_used~0_339 (ite .cse11 0 v_~y$w_buff0_used~0_339)))))))) InVars {~#y~0.offset=|v_~#y~0.offset_250|, P2Thread1of1ForFork0_#t~nondet22=|v_P2Thread1of1ForFork0_#t~nondet22_10|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_339, P2Thread1of1ForFork0_#t~mem28=|v_P2Thread1of1ForFork0_#t~mem28_10|, ~#y~0.base=|v_~#y~0.base_250|, P2Thread1of1ForFork0_#t~nondet23=|v_P2Thread1of1ForFork0_#t~nondet23_10|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_180, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_118, ~y$w_buff0~0=v_~y$w_buff0~0_186, #memory_int=|v_#memory_int_393|, P2Thread1of1ForFork0_#t~mem25=|v_P2Thread1of1ForFork0_#t~mem25_10|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_317} OutVars{~#y~0.offset=|v_~#y~0.offset_250|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_338, ~#y~0.base=|v_~#y~0.base_250|, P2Thread1of1ForFork0_#t~ite26=|v_P2Thread1of1ForFork0_#t~ite26_7|, ~y$mem_tmp~0=v_~y$mem_tmp~0_84, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_104, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_117, ~y$w_buff0~0=v_~y$w_buff0~0_185, ~y$flush_delayed~0=v_~y$flush_delayed~0_112, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_7|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_#t~mem27=|v_P2Thread1of1ForFork0_#t~mem27_7|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~weak$$choice0~0=v_~weak$$choice0~0_109, ~y$w_buff1~0=v_~y$w_buff1~0_179, #memory_int=|v_#memory_int_392|, P2Thread1of1ForFork0_#t~mem24=|v_P2Thread1of1ForFork0_#t~mem24_7|, ~weak$$choice2~0=v_~weak$$choice2~0_134, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_316} AuxVars[|v_P2_#t~ite29_32|, |v_P2_#t~mem28_31|, |v_P2_#t~mem25_47|] AssignedVars[P2Thread1of1ForFork0_#t~nondet22, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~mem27, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~mem28, P2Thread1of1ForFork0_#t~nondet23, P2Thread1of1ForFork0_#t~ite26, ~weak$$choice0~0, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, #memory_int, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~mem25, P2Thread1of1ForFork0_#t~mem24, P2Thread1of1ForFork0_#t~ite29, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-06 04:24:46,494 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:24:46,495 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2986 [2022-12-06 04:24:46,495 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 126 flow [2022-12-06 04:24:46,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:24:46,495 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:46,496 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:46,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:24:46,496 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:24:46,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:46,496 INFO L85 PathProgramCache]: Analyzing trace with hash -618581144, now seen corresponding path program 2 times [2022-12-06 04:24:46,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:46,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817123643] [2022-12-06 04:24:46,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:46,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:48,077 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 04:24:48,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:48,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817123643] [2022-12-06 04:24:48,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817123643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:48,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:48,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:24:48,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648486770] [2022-12-06 04:24:48,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:48,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:24:48,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:48,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:24:48,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:24:48,080 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 04:24:48,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 126 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:24:48,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:48,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 04:24:48,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:48,428 INFO L130 PetriNetUnfolder]: 776/1294 cut-off events. [2022-12-06 04:24:48,428 INFO L131 PetriNetUnfolder]: For 1050/1068 co-relation queries the response was YES. [2022-12-06 04:24:48,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3484 conditions, 1294 events. 776/1294 cut-off events. For 1050/1068 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6571 event pairs, 430 based on Foata normal form. 9/1300 useless extension candidates. Maximal degree in co-relation 3468. Up to 1016 conditions per place. [2022-12-06 04:24:48,438 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 23 selfloop transitions, 6 changer transitions 2/33 dead transitions. [2022-12-06 04:24:48,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 33 transitions, 195 flow [2022-12-06 04:24:48,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:24:48,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:24:48,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-06 04:24:48,440 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.358695652173913 [2022-12-06 04:24:48,440 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 126 flow. Second operand 4 states and 33 transitions. [2022-12-06 04:24:48,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 33 transitions, 195 flow [2022-12-06 04:24:48,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 33 transitions, 191 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:24:48,443 INFO L231 Difference]: Finished difference. Result has 39 places, 25 transitions, 130 flow [2022-12-06 04:24:48,443 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2022-12-06 04:24:48,444 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2022-12-06 04:24:48,444 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:48,444 INFO L89 Accepts]: Start accepts. Operand has 39 places, 25 transitions, 130 flow [2022-12-06 04:24:48,444 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:48,445 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:48,445 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 25 transitions, 130 flow [2022-12-06 04:24:48,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 25 transitions, 130 flow [2022-12-06 04:24:48,464 INFO L130 PetriNetUnfolder]: 17/88 cut-off events. [2022-12-06 04:24:48,465 INFO L131 PetriNetUnfolder]: For 137/147 co-relation queries the response was YES. [2022-12-06 04:24:48,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 88 events. 17/88 cut-off events. For 137/147 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 355 event pairs, 10 based on Foata normal form. 1/89 useless extension candidates. Maximal degree in co-relation 254. Up to 44 conditions per place. [2022-12-06 04:24:48,466 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 25 transitions, 130 flow [2022-12-06 04:24:48,466 INFO L188 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-06 04:24:48,499 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [736] L776-->L779: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [794] $Ultimate##0-->L791: Formula: (and (= v_~x~0_36 2) (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_36} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~x~0] [2022-12-06 04:24:48,628 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L824-->L826: Formula: (= (store |v_#memory_int_25| |v_~#y~0.base_19| (store (select |v_#memory_int_25| |v_~#y~0.base_19|) |v_~#y~0.offset_19| 2)) |v_#memory_int_24|) InVars {#memory_int=|v_#memory_int_25|, ~#y~0.offset=|v_~#y~0.offset_19|, ~#y~0.base=|v_~#y~0.base_19|} OutVars{#memory_int=|v_#memory_int_24|, ~#y~0.offset=|v_~#y~0.offset_19|, ~#y~0.base=|v_~#y~0.base_19|} AuxVars[] AssignedVars[#memory_int] and [797] $Ultimate##0-->L824: Formula: (let ((.cse14 (= (mod v_~y$w_buff1_used~0_317 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_105 256) 0)) (.cse15 (= (mod v_~y$r_buff0_thd3~0_118 256) 0)) (.cse16 (= (mod v_~y$w_buff0_used~0_339 256) 0))) (let ((.cse12 (not .cse16)) (.cse13 (not .cse15)) (.cse1 (and .cse15 .cse5)) (.cse3 (and .cse15 .cse14)) (.cse8 (= (mod v_~weak$$choice2~0_134 256) 0)) (.cse7 (select |v_#memory_int_393| |v_~#y~0.base_250|))) (let ((.cse10 (select .cse7 |v_~#y~0.offset_250|)) (.cse6 (= (mod v_~y$w_buff1_used~0_316 256) 0)) (.cse2 (= (mod v_~y$w_buff0_used~0_338 256) 0)) (.cse0 (not .cse8)) (.cse9 (or .cse1 .cse3 .cse16)) (.cse11 (and .cse12 .cse13))) (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P2Thread1of1ForFork0_#t~nondet22_10| v_~weak$$choice0~0_109) (= v_~y$flush_delayed~0_112 0) (= v_~y$w_buff1_used~0_316 (ite .cse0 v_~y$w_buff1_used~0_317 (ite (or .cse1 .cse2 .cse3) v_~y$w_buff1_used~0_317 0))) (= v_~y$w_buff1~0_180 v_~y$w_buff1~0_179) (= (ite .cse0 v_~y$r_buff1_thd3~0_105 (ite (let ((.cse4 (= (mod v_~y$r_buff0_thd3~0_117 256) 0))) (or (and .cse4 .cse5) .cse2 (and .cse4 .cse6))) v_~y$r_buff1_thd3~0_105 0)) v_~y$r_buff1_thd3~0_104) (= (store |v_#memory_int_393| |v_~#y~0.base_250| (store .cse7 |v_~#y~0.offset_250| |v_P2_#t~ite29_32|)) |v_#memory_int_392|) (or (and (= |v_P2_#t~ite29_32| v_~y$mem_tmp~0_84) .cse0 (= |v_P2Thread1of1ForFork0_#t~mem28_10| |v_P2_#t~mem28_31|)) (and (= |v_P2_#t~ite29_32| |v_P2_#t~mem28_31|) .cse8 (= |v_P2_#t~mem28_31| v_~__unbuffered_p2_EAX~0_42))) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (or (and .cse9 (= |v_P2_#t~mem25_47| v_~__unbuffered_p2_EAX~0_42) (= |v_P2_#t~mem25_47| .cse10)) (and (= (ite .cse11 v_~y$w_buff0~0_186 v_~y$w_buff1~0_180) v_~__unbuffered_p2_EAX~0_42) .cse12 (or (not .cse5) .cse13) (= |v_P2Thread1of1ForFork0_#t~mem25_10| |v_P2_#t~mem25_47|) (or .cse13 (not .cse14)))) (= v_~weak$$choice2~0_134 |v_P2Thread1of1ForFork0_#t~nondet23_10|) (= v_~y$w_buff0~0_186 v_~y$w_buff0~0_185) (= v_~y$mem_tmp~0_84 .cse10) (= (ite .cse0 v_~y$r_buff0_thd3~0_118 (ite (or .cse1 .cse2 (and .cse6 .cse15)) v_~y$r_buff0_thd3~0_118 (ite (and .cse13 (not .cse2)) 0 v_~y$r_buff0_thd3~0_118))) v_~y$r_buff0_thd3~0_117) (= v_~y$w_buff0_used~0_338 (ite .cse0 v_~y$w_buff0_used~0_339 (ite .cse9 v_~y$w_buff0_used~0_339 (ite .cse11 0 v_~y$w_buff0_used~0_339)))))))) InVars {~#y~0.offset=|v_~#y~0.offset_250|, P2Thread1of1ForFork0_#t~nondet22=|v_P2Thread1of1ForFork0_#t~nondet22_10|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_339, P2Thread1of1ForFork0_#t~mem28=|v_P2Thread1of1ForFork0_#t~mem28_10|, ~#y~0.base=|v_~#y~0.base_250|, P2Thread1of1ForFork0_#t~nondet23=|v_P2Thread1of1ForFork0_#t~nondet23_10|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_180, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_118, ~y$w_buff0~0=v_~y$w_buff0~0_186, #memory_int=|v_#memory_int_393|, P2Thread1of1ForFork0_#t~mem25=|v_P2Thread1of1ForFork0_#t~mem25_10|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_317} OutVars{~#y~0.offset=|v_~#y~0.offset_250|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_338, ~#y~0.base=|v_~#y~0.base_250|, P2Thread1of1ForFork0_#t~ite26=|v_P2Thread1of1ForFork0_#t~ite26_7|, ~y$mem_tmp~0=v_~y$mem_tmp~0_84, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_104, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_117, ~y$w_buff0~0=v_~y$w_buff0~0_185, ~y$flush_delayed~0=v_~y$flush_delayed~0_112, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_7|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_#t~mem27=|v_P2Thread1of1ForFork0_#t~mem27_7|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~weak$$choice0~0=v_~weak$$choice0~0_109, ~y$w_buff1~0=v_~y$w_buff1~0_179, #memory_int=|v_#memory_int_392|, P2Thread1of1ForFork0_#t~mem24=|v_P2Thread1of1ForFork0_#t~mem24_7|, ~weak$$choice2~0=v_~weak$$choice2~0_134, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_316} AuxVars[|v_P2_#t~ite29_32|, |v_P2_#t~mem28_31|, |v_P2_#t~mem25_47|] AssignedVars[P2Thread1of1ForFork0_#t~nondet22, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~mem27, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~mem28, P2Thread1of1ForFork0_#t~nondet23, P2Thread1of1ForFork0_#t~ite26, ~weak$$choice0~0, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, #memory_int, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~mem25, P2Thread1of1ForFork0_#t~mem24, P2Thread1of1ForFork0_#t~ite29, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-06 04:24:49,188 ERROR L799 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-06 04:24:49,189 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:24:49,190 ERROR L123 eatedLiptonReduction]: Lipton reduction run adaptation of counterexample failed. [2022-12-06 04:24:49,190 INFO L89 Accepts]: Start accepts. Operand has 39 places, 25 transitions, 134 flow [2022-12-06 04:24:49,191 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:49,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:24:49,191 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction! at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 04:24:49,194 INFO L158 Benchmark]: Toolchain (without parser) took 39049.99ms. Allocated memory was 181.4MB in the beginning and 665.8MB in the end (delta: 484.4MB). Free memory was 139.3MB in the beginning and 605.4MB in the end (delta: -466.1MB). Peak memory consumption was 387.4MB. Max. memory is 8.0GB. [2022-12-06 04:24:49,195 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 181.4MB. Free memory is still 157.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:24:49,195 INFO L158 Benchmark]: CACSL2BoogieTranslator took 549.32ms. Allocated memory is still 181.4MB. Free memory was 138.8MB in the beginning and 109.9MB in the end (delta: 28.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 04:24:49,195 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.55ms. Allocated memory is still 181.4MB. Free memory was 109.9MB in the beginning and 106.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:24:49,196 INFO L158 Benchmark]: Boogie Preprocessor took 58.93ms. Allocated memory is still 181.4MB. Free memory was 106.8MB in the beginning and 104.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:24:49,196 INFO L158 Benchmark]: RCFGBuilder took 1156.94ms. Allocated memory is still 181.4MB. Free memory was 104.2MB in the beginning and 105.8MB in the end (delta: -1.7MB). Peak memory consumption was 52.9MB. Max. memory is 8.0GB. [2022-12-06 04:24:49,196 INFO L158 Benchmark]: TraceAbstraction took 37190.84ms. Allocated memory was 181.4MB in the beginning and 665.8MB in the end (delta: 484.4MB). Free memory was 105.3MB in the beginning and 605.4MB in the end (delta: -500.1MB). Peak memory consumption was 353.4MB. Max. memory is 8.0GB. [2022-12-06 04:24:49,197 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 181.4MB. Free memory is still 157.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 549.32ms. Allocated memory is still 181.4MB. Free memory was 138.8MB in the beginning and 109.9MB in the end (delta: 28.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 87.55ms. Allocated memory is still 181.4MB. Free memory was 109.9MB in the beginning and 106.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.93ms. Allocated memory is still 181.4MB. Free memory was 106.8MB in the beginning and 104.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1156.94ms. Allocated memory is still 181.4MB. Free memory was 104.2MB in the beginning and 105.8MB in the end (delta: -1.7MB). Peak memory consumption was 52.9MB. Max. memory is 8.0GB. * TraceAbstraction took 37190.84ms. Allocated memory was 181.4MB in the beginning and 665.8MB in the end (delta: 484.4MB). Free memory was 105.3MB in the beginning and 605.4MB in the end (delta: -500.1MB). Peak memory consumption was 353.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 26.5s, 118 PlacesBefore, 30 PlacesAfterwards, 109 TransitionsBefore, 21 TransitionsAfterwards, 1212 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 56 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 90 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 872, independent: 802, independent conditional: 802, independent unconditional: 0, dependent: 70, dependent conditional: 70, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 872, independent: 802, independent conditional: 0, independent unconditional: 802, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 872, independent: 802, independent conditional: 0, independent unconditional: 802, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 872, independent: 802, independent conditional: 0, independent unconditional: 802, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 730, independent: 692, independent conditional: 0, independent unconditional: 692, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 730, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 60, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 445, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 413, dependent conditional: 0, dependent unconditional: 413, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 872, independent: 110, independent conditional: 0, independent unconditional: 110, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 730, unknown conditional: 0, unknown unconditional: 730] , Statistics on independence cache: Total cache size (in pairs): 1034, Positive cache size: 996, Positive conditional cache size: 0, Positive unconditional cache size: 996, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 27 PlacesBefore, 27 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 55, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 55, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 55, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 53, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 53, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 294, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 289, dependent conditional: 0, dependent unconditional: 289, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 55, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 53, unknown conditional: 0, unknown unconditional: 53] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 34, Positive conditional cache size: 0, Positive unconditional cache size: 34, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 30 PlacesBefore, 30 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 212 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 52, independent: 35, independent conditional: 3, independent unconditional: 32, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 52, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 52, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 138, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 138, dependent conditional: 0, dependent unconditional: 138, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 52, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 34, independent conditional: 3, independent unconditional: 31, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 208 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 49, independent: 34, independent conditional: 6, independent unconditional: 28, dependent: 15, dependent conditional: 3, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 49, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 49, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 49, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 208 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 51, independent: 34, independent conditional: 6, independent unconditional: 28, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 51, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 51, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 51, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 37 PlacesBefore, 37 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 224 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, independent: 62, independent conditional: 62, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 76, independent: 62, independent conditional: 38, independent unconditional: 24, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 76, independent: 62, independent conditional: 23, independent unconditional: 39, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 76, independent: 62, independent conditional: 23, independent unconditional: 39, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 14, independent conditional: 9, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 197, independent: 176, independent conditional: 176, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 76, independent: 48, independent conditional: 14, independent unconditional: 34, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 15, unknown conditional: 9, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 52, Positive conditional cache size: 9, Positive unconditional cache size: 43, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 39 PlacesBefore, 39 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 107, independent: 89, independent conditional: 89, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 107, independent: 89, independent conditional: 51, independent unconditional: 38, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 107, independent: 89, independent conditional: 25, independent unconditional: 64, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 107, independent: 89, independent conditional: 25, independent unconditional: 64, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 15, independent conditional: 5, independent unconditional: 10, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 107, independent: 74, independent conditional: 20, independent unconditional: 54, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 16, unknown conditional: 5, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 73, Positive conditional cache size: 14, Positive unconditional cache size: 59, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 0 - ExceptionOrErrorResult: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction!: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:132) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 04:24:49,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...