/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix019.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:36:49,785 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:36:49,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:36:49,840 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:36:49,841 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:36:49,843 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:36:49,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:36:49,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:36:49,853 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:36:49,857 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:36:49,858 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:36:49,860 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:36:49,860 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:36:49,862 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:36:49,863 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:36:49,866 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:36:49,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:36:49,868 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:36:49,870 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:36:49,876 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:36:49,877 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:36:49,878 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:36:49,879 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:36:49,880 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:36:49,886 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:36:49,886 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:36:49,887 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:36:49,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:36:49,889 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:36:49,889 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:36:49,890 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:36:49,891 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:36:49,892 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:36:49,893 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:36:49,894 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:36:49,894 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:36:49,894 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:36:49,895 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:36:49,895 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:36:49,895 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:36:49,896 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:36:49,897 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 00:36:49,929 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:36:49,930 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:36:49,931 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:36:49,931 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:36:49,932 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:36:49,932 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:36:49,932 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:36:49,933 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:36:49,933 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:36:49,933 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:36:49,933 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:36:49,934 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:36:49,934 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:36:49,934 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:36:49,934 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:36:49,934 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:36:49,934 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:36:49,934 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:36:49,935 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:36:49,935 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:36:49,935 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:36:49,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:36:49,935 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:36:49,935 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:36:49,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:36:49,936 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:36:49,936 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:36:49,936 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:36:49,936 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 00:36:50,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:36:50,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:36:50,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:36:50,262 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:36:50,263 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:36:50,264 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019.opt.i [2022-12-13 00:36:51,424 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:36:51,730 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:36:51,731 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019.opt.i [2022-12-13 00:36:51,761 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8ffae8a4/64ea51146aa64904839ac3f42dd00428/FLAG34859bef3 [2022-12-13 00:36:51,779 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8ffae8a4/64ea51146aa64904839ac3f42dd00428 [2022-12-13 00:36:51,781 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:36:51,783 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:36:51,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:36:51,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:36:51,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:36:51,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:36:51" (1/1) ... [2022-12-13 00:36:51,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b5cbcea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:51, skipping insertion in model container [2022-12-13 00:36:51,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:36:51" (1/1) ... [2022-12-13 00:36:51,794 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:36:51,847 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:36:52,011 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/mix019.opt.i[944,957] [2022-12-13 00:36:52,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:52,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:52,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:52,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:52,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:52,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:52,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:52,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:52,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:52,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:52,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:52,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:52,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:52,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:52,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:52,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:52,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:52,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:52,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:52,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:52,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:52,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:52,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:52,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:52,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:52,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:52,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:52,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:52,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:52,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:52,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:52,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:52,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:36:52,250 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:36:52,262 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/mix019.opt.i[944,957] [2022-12-13 00:36:52,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:52,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:52,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:52,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:52,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:52,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:52,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:52,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:52,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:52,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:52,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:52,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:52,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:52,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:52,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:52,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:52,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:52,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:52,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:52,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:52,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:52,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:52,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:52,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:52,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:52,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:52,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:52,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:52,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:52,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:52,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:52,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:52,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:36:52,339 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:36:52,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:52 WrapperNode [2022-12-13 00:36:52,340 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:36:52,341 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:36:52,341 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:36:52,341 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:36:52,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:52" (1/1) ... [2022-12-13 00:36:52,380 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:52" (1/1) ... [2022-12-13 00:36:52,416 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2022-12-13 00:36:52,417 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:36:52,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:36:52,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:36:52,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:36:52,426 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:52" (1/1) ... [2022-12-13 00:36:52,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:52" (1/1) ... [2022-12-13 00:36:52,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:52" (1/1) ... [2022-12-13 00:36:52,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:52" (1/1) ... [2022-12-13 00:36:52,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:52" (1/1) ... [2022-12-13 00:36:52,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:52" (1/1) ... [2022-12-13 00:36:52,452 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:52" (1/1) ... [2022-12-13 00:36:52,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:52" (1/1) ... [2022-12-13 00:36:52,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:36:52,473 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:36:52,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:36:52,473 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:36:52,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:52" (1/1) ... [2022-12-13 00:36:52,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:36:52,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:36:52,504 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 00:36:52,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 00:36:52,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:36:52,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:36:52,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:36:52,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:36:52,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:36:52,548 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:36:52,548 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:36:52,549 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:36:52,549 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:36:52,549 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:36:52,549 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:36:52,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:36:52,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:36:52,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:36:52,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:36:52,551 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:36:52,662 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:36:52,664 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:36:52,996 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:36:53,117 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:36:53,117 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:36:53,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:36:53 BoogieIcfgContainer [2022-12-13 00:36:53,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:36:53,131 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:36:53,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:36:53,134 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:36:53,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:36:51" (1/3) ... [2022-12-13 00:36:53,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f229b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:36:53, skipping insertion in model container [2022-12-13 00:36:53,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:52" (2/3) ... [2022-12-13 00:36:53,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f229b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:36:53, skipping insertion in model container [2022-12-13 00:36:53,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:36:53" (3/3) ... [2022-12-13 00:36:53,139 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019.opt.i [2022-12-13 00:36:53,151 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:36:53,152 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:36:53,152 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:36:53,207 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:36:53,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2022-12-13 00:36:53,344 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-13 00:36:53,345 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:36:53,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 00:36:53,349 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2022-12-13 00:36:53,354 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2022-12-13 00:36:53,355 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:36:53,376 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-13 00:36:53,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2022-12-13 00:36:53,416 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-13 00:36:53,416 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:36:53,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 00:36:53,420 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-13 00:36:53,420 INFO L226 LiptonReduction]: Number of co-enabled transitions 1758 [2022-12-13 00:36:58,062 INFO L241 LiptonReduction]: Total number of compositions: 86 [2022-12-13 00:36:58,085 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:36:58,092 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;@386d751a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:36:58,095 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 00:36:58,104 INFO L130 PetriNetUnfolder]: 1/20 cut-off events. [2022-12-13 00:36:58,104 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:36:58,104 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:36:58,105 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:36:58,105 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:36:58,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:36:58,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1074649435, now seen corresponding path program 1 times [2022-12-13 00:36:58,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:36:58,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640254504] [2022-12-13 00:36:58,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:36:58,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:36:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:36:58,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:36:58,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:36:58,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640254504] [2022-12-13 00:36:58,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640254504] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:36:58,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:36:58,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:36:58,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716709933] [2022-12-13 00:36:58,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:36:58,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:36:58,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:36:58,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:36:58,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:36:58,604 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 55 [2022-12-13 00:36:58,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:36:58,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:36:58,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 55 [2022-12-13 00:36:58,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:36:59,785 INFO L130 PetriNetUnfolder]: 7099/11207 cut-off events. [2022-12-13 00:36:59,786 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-13 00:36:59,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21410 conditions, 11207 events. 7099/11207 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 822. Compared 80429 event pairs, 824 based on Foata normal form. 0/6816 useless extension candidates. Maximal degree in co-relation 21399. Up to 8776 conditions per place. [2022-12-13 00:36:59,828 INFO L137 encePairwiseOnDemand]: 50/55 looper letters, 29 selfloop transitions, 2 changer transitions 42/83 dead transitions. [2022-12-13 00:36:59,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 83 transitions, 321 flow [2022-12-13 00:36:59,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:36:59,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:36:59,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2022-12-13 00:36:59,838 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6545454545454545 [2022-12-13 00:36:59,840 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 119 flow. Second operand 3 states and 108 transitions. [2022-12-13 00:36:59,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 83 transitions, 321 flow [2022-12-13 00:36:59,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 83 transitions, 318 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:36:59,845 INFO L231 Difference]: Finished difference. Result has 61 places, 31 transitions, 72 flow [2022-12-13 00:36:59,846 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=61, PETRI_TRANSITIONS=31} [2022-12-13 00:36:59,849 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -3 predicate places. [2022-12-13 00:36:59,850 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:36:59,850 INFO L89 Accepts]: Start accepts. Operand has 61 places, 31 transitions, 72 flow [2022-12-13 00:36:59,853 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:36:59,853 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:36:59,853 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 31 transitions, 72 flow [2022-12-13 00:36:59,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 72 flow [2022-12-13 00:36:59,858 INFO L130 PetriNetUnfolder]: 0/31 cut-off events. [2022-12-13 00:36:59,858 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:36:59,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 57 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 00:36:59,861 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 31 transitions, 72 flow [2022-12-13 00:36:59,861 INFO L226 LiptonReduction]: Number of co-enabled transitions 536 [2022-12-13 00:37:00,039 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:37:00,041 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-13 00:37:00,041 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 72 flow [2022-12-13 00:37:00,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:00,041 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:00,041 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:00,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:37:00,042 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:37:00,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:00,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1945957556, now seen corresponding path program 1 times [2022-12-13 00:37:00,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:00,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733082759] [2022-12-13 00:37:00,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:00,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:00,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:37:00,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:00,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733082759] [2022-12-13 00:37:00,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733082759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:00,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:00,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:37:00,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172201904] [2022-12-13 00:37:00,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:00,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:37:00,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:00,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:37:00,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:37:00,180 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2022-12-13 00:37:00,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:00,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:00,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2022-12-13 00:37:00,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:00,644 INFO L130 PetriNetUnfolder]: 3012/4764 cut-off events. [2022-12-13 00:37:00,644 INFO L131 PetriNetUnfolder]: For 163/163 co-relation queries the response was YES. [2022-12-13 00:37:00,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9491 conditions, 4764 events. 3012/4764 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 27555 event pairs, 965 based on Foata normal form. 0/3745 useless extension candidates. Maximal degree in co-relation 9481. Up to 2991 conditions per place. [2022-12-13 00:37:00,669 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 35 selfloop transitions, 6 changer transitions 2/50 dead transitions. [2022-12-13 00:37:00,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 200 flow [2022-12-13 00:37:00,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:37:00,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:37:00,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-12-13 00:37:00,671 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6989247311827957 [2022-12-13 00:37:00,671 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 72 flow. Second operand 3 states and 65 transitions. [2022-12-13 00:37:00,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 200 flow [2022-12-13 00:37:00,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:37:00,674 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 112 flow [2022-12-13 00:37:00,674 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2022-12-13 00:37:00,675 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -22 predicate places. [2022-12-13 00:37:00,675 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:00,675 INFO L89 Accepts]: Start accepts. Operand has 42 places, 35 transitions, 112 flow [2022-12-13 00:37:00,676 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:00,676 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:00,676 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 35 transitions, 112 flow [2022-12-13 00:37:00,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 112 flow [2022-12-13 00:37:00,693 INFO L130 PetriNetUnfolder]: 48/216 cut-off events. [2022-12-13 00:37:00,694 INFO L131 PetriNetUnfolder]: For 19/22 co-relation queries the response was YES. [2022-12-13 00:37:00,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 216 events. 48/216 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1288 event pairs, 24 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 355. Up to 81 conditions per place. [2022-12-13 00:37:00,696 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 35 transitions, 112 flow [2022-12-13 00:37:00,696 INFO L226 LiptonReduction]: Number of co-enabled transitions 580 [2022-12-13 00:37:00,706 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:37:00,707 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-13 00:37:00,708 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 112 flow [2022-12-13 00:37:00,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:00,709 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:00,709 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:00,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:37:00,709 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:37:00,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:00,709 INFO L85 PathProgramCache]: Analyzing trace with hash -195140615, now seen corresponding path program 1 times [2022-12-13 00:37:00,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:00,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814437045] [2022-12-13 00:37:00,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:00,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:00,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:37:00,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:00,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814437045] [2022-12-13 00:37:00,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814437045] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:00,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:00,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:37:00,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784403173] [2022-12-13 00:37:00,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:00,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:37:00,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:00,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:37:00,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:37:00,819 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2022-12-13 00:37:00,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:00,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:00,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2022-12-13 00:37:00,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:01,177 INFO L130 PetriNetUnfolder]: 2218/3552 cut-off events. [2022-12-13 00:37:01,177 INFO L131 PetriNetUnfolder]: For 1221/1221 co-relation queries the response was YES. [2022-12-13 00:37:01,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8358 conditions, 3552 events. 2218/3552 cut-off events. For 1221/1221 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 19163 event pairs, 578 based on Foata normal form. 40/2934 useless extension candidates. Maximal degree in co-relation 8346. Up to 1767 conditions per place. [2022-12-13 00:37:01,198 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 41 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2022-12-13 00:37:01,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 262 flow [2022-12-13 00:37:01,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:37:01,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:37:01,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-13 00:37:01,199 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2022-12-13 00:37:01,199 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 112 flow. Second operand 4 states and 74 transitions. [2022-12-13 00:37:01,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 262 flow [2022-12-13 00:37:01,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 55 transitions, 244 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:37:01,205 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 148 flow [2022-12-13 00:37:01,231 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2022-12-13 00:37:01,232 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -19 predicate places. [2022-12-13 00:37:01,232 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:01,232 INFO L89 Accepts]: Start accepts. Operand has 45 places, 38 transitions, 148 flow [2022-12-13 00:37:01,233 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:01,233 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:01,234 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 38 transitions, 148 flow [2022-12-13 00:37:01,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 38 transitions, 148 flow [2022-12-13 00:37:01,249 INFO L130 PetriNetUnfolder]: 39/177 cut-off events. [2022-12-13 00:37:01,249 INFO L131 PetriNetUnfolder]: For 68/78 co-relation queries the response was YES. [2022-12-13 00:37:01,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 177 events. 39/177 cut-off events. For 68/78 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 954 event pairs, 14 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 346. Up to 68 conditions per place. [2022-12-13 00:37:01,251 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 38 transitions, 148 flow [2022-12-13 00:37:01,251 INFO L226 LiptonReduction]: Number of co-enabled transitions 612 [2022-12-13 00:37:01,253 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:37:01,254 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 00:37:01,254 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 148 flow [2022-12-13 00:37:01,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:01,254 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:01,254 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:01,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:37:01,254 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:37:01,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:01,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1739701779, now seen corresponding path program 1 times [2022-12-13 00:37:01,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:01,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89552496] [2022-12-13 00:37:01,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:01,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:01,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:37:01,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:01,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89552496] [2022-12-13 00:37:01,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89552496] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:01,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:01,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:37:01,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915771189] [2022-12-13 00:37:01,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:01,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:37:01,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:01,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:37:01,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:37:01,421 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2022-12-13 00:37:01,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:01,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:01,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2022-12-13 00:37:01,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:01,808 INFO L130 PetriNetUnfolder]: 2168/3509 cut-off events. [2022-12-13 00:37:01,808 INFO L131 PetriNetUnfolder]: For 2159/2159 co-relation queries the response was YES. [2022-12-13 00:37:01,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8718 conditions, 3509 events. 2168/3509 cut-off events. For 2159/2159 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 19835 event pairs, 440 based on Foata normal form. 10/2871 useless extension candidates. Maximal degree in co-relation 8703. Up to 2111 conditions per place. [2022-12-13 00:37:01,831 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 46 selfloop transitions, 13 changer transitions 0/66 dead transitions. [2022-12-13 00:37:01,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 66 transitions, 348 flow [2022-12-13 00:37:01,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:37:01,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:37:01,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-12-13 00:37:01,833 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6916666666666667 [2022-12-13 00:37:01,833 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 148 flow. Second operand 4 states and 83 transitions. [2022-12-13 00:37:01,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 66 transitions, 348 flow [2022-12-13 00:37:01,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 66 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:37:01,838 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 217 flow [2022-12-13 00:37:01,839 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=217, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2022-12-13 00:37:01,839 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -15 predicate places. [2022-12-13 00:37:01,839 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:01,839 INFO L89 Accepts]: Start accepts. Operand has 49 places, 42 transitions, 217 flow [2022-12-13 00:37:01,840 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:01,840 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:01,841 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 42 transitions, 217 flow [2022-12-13 00:37:01,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 42 transitions, 217 flow [2022-12-13 00:37:01,858 INFO L130 PetriNetUnfolder]: 33/161 cut-off events. [2022-12-13 00:37:01,859 INFO L131 PetriNetUnfolder]: For 153/180 co-relation queries the response was YES. [2022-12-13 00:37:01,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 161 events. 33/161 cut-off events. For 153/180 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 844 event pairs, 13 based on Foata normal form. 1/110 useless extension candidates. Maximal degree in co-relation 377. Up to 60 conditions per place. [2022-12-13 00:37:01,861 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 42 transitions, 217 flow [2022-12-13 00:37:01,861 INFO L226 LiptonReduction]: Number of co-enabled transitions 662 [2022-12-13 00:37:01,863 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:37:01,864 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-13 00:37:01,864 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 217 flow [2022-12-13 00:37:01,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:01,864 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:01,865 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:01,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:37:01,865 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:37:01,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:01,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1903947656, now seen corresponding path program 1 times [2022-12-13 00:37:01,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:01,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379732598] [2022-12-13 00:37:01,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:01,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:02,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:37:02,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:02,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379732598] [2022-12-13 00:37:02,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379732598] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:02,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:02,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:37:02,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895612754] [2022-12-13 00:37:02,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:02,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:37:02,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:02,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:37:02,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:37:02,028 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2022-12-13 00:37:02,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 217 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:02,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:02,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2022-12-13 00:37:02,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:02,531 INFO L130 PetriNetUnfolder]: 3436/5423 cut-off events. [2022-12-13 00:37:02,531 INFO L131 PetriNetUnfolder]: For 4693/4814 co-relation queries the response was YES. [2022-12-13 00:37:02,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14330 conditions, 5423 events. 3436/5423 cut-off events. For 4693/4814 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 34510 event pairs, 240 based on Foata normal form. 476/3981 useless extension candidates. Maximal degree in co-relation 14312. Up to 2983 conditions per place. [2022-12-13 00:37:02,567 INFO L137 encePairwiseOnDemand]: 18/30 looper letters, 68 selfloop transitions, 11 changer transitions 0/89 dead transitions. [2022-12-13 00:37:02,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 89 transitions, 585 flow [2022-12-13 00:37:02,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:37:02,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:37:02,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-12-13 00:37:02,568 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2022-12-13 00:37:02,568 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 217 flow. Second operand 4 states and 85 transitions. [2022-12-13 00:37:02,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 89 transitions, 585 flow [2022-12-13 00:37:02,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 89 transitions, 583 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-13 00:37:02,574 INFO L231 Difference]: Finished difference. Result has 54 places, 52 transitions, 301 flow [2022-12-13 00:37:02,574 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=301, PETRI_PLACES=54, PETRI_TRANSITIONS=52} [2022-12-13 00:37:02,575 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -10 predicate places. [2022-12-13 00:37:02,575 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:02,575 INFO L89 Accepts]: Start accepts. Operand has 54 places, 52 transitions, 301 flow [2022-12-13 00:37:02,576 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:02,576 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:02,576 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 52 transitions, 301 flow [2022-12-13 00:37:02,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 52 transitions, 301 flow [2022-12-13 00:37:02,712 INFO L130 PetriNetUnfolder]: 1041/2051 cut-off events. [2022-12-13 00:37:02,712 INFO L131 PetriNetUnfolder]: For 736/795 co-relation queries the response was YES. [2022-12-13 00:37:02,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4892 conditions, 2051 events. 1041/2051 cut-off events. For 736/795 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 16384 event pairs, 436 based on Foata normal form. 3/918 useless extension candidates. Maximal degree in co-relation 4873. Up to 1720 conditions per place. [2022-12-13 00:37:02,731 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 52 transitions, 301 flow [2022-12-13 00:37:02,731 INFO L226 LiptonReduction]: Number of co-enabled transitions 846 [2022-12-13 00:37:03,098 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:37:03,099 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 524 [2022-12-13 00:37:03,100 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 303 flow [2022-12-13 00:37:03,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:03,100 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:03,100 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:03,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:37:03,100 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:37:03,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:03,101 INFO L85 PathProgramCache]: Analyzing trace with hash 677440308, now seen corresponding path program 1 times [2022-12-13 00:37:03,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:03,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339138093] [2022-12-13 00:37:03,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:03,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:03,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:37:03,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:03,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339138093] [2022-12-13 00:37:03,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339138093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:03,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:03,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:37:03,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84257525] [2022-12-13 00:37:03,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:03,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:37:03,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:03,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:37:03,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:37:03,213 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2022-12-13 00:37:03,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 303 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:03,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:03,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2022-12-13 00:37:03,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:03,731 INFO L130 PetriNetUnfolder]: 3258/5370 cut-off events. [2022-12-13 00:37:03,734 INFO L131 PetriNetUnfolder]: For 6612/6864 co-relation queries the response was YES. [2022-12-13 00:37:03,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17794 conditions, 5370 events. 3258/5370 cut-off events. For 6612/6864 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 34478 event pairs, 1370 based on Foata normal form. 183/4378 useless extension candidates. Maximal degree in co-relation 17772. Up to 3327 conditions per place. [2022-12-13 00:37:03,772 INFO L137 encePairwiseOnDemand]: 28/31 looper letters, 49 selfloop transitions, 6 changer transitions 6/73 dead transitions. [2022-12-13 00:37:03,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 73 transitions, 517 flow [2022-12-13 00:37:03,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:37:03,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:37:03,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-13 00:37:03,775 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6881720430107527 [2022-12-13 00:37:03,775 INFO L175 Difference]: Start difference. First operand has 54 places, 52 transitions, 303 flow. Second operand 3 states and 64 transitions. [2022-12-13 00:37:03,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 73 transitions, 517 flow [2022-12-13 00:37:03,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 73 transitions, 493 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 00:37:03,786 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 285 flow [2022-12-13 00:37:03,787 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=285, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2022-12-13 00:37:03,789 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -9 predicate places. [2022-12-13 00:37:03,789 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:03,789 INFO L89 Accepts]: Start accepts. Operand has 55 places, 49 transitions, 285 flow [2022-12-13 00:37:03,790 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:03,790 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:03,790 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 49 transitions, 285 flow [2022-12-13 00:37:03,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 49 transitions, 285 flow [2022-12-13 00:37:03,963 INFO L130 PetriNetUnfolder]: 1064/1992 cut-off events. [2022-12-13 00:37:03,963 INFO L131 PetriNetUnfolder]: For 943/964 co-relation queries the response was YES. [2022-12-13 00:37:03,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4429 conditions, 1992 events. 1064/1992 cut-off events. For 943/964 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 14741 event pairs, 515 based on Foata normal form. 6/929 useless extension candidates. Maximal degree in co-relation 4410. Up to 1696 conditions per place. [2022-12-13 00:37:03,981 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 49 transitions, 285 flow [2022-12-13 00:37:03,981 INFO L226 LiptonReduction]: Number of co-enabled transitions 740 [2022-12-13 00:37:04,008 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:37:04,009 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 220 [2022-12-13 00:37:04,009 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 285 flow [2022-12-13 00:37:04,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:04,009 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:04,009 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:04,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:37:04,009 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:37:04,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:04,010 INFO L85 PathProgramCache]: Analyzing trace with hash 984910201, now seen corresponding path program 1 times [2022-12-13 00:37:04,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:04,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063407864] [2022-12-13 00:37:04,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:04,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:04,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:37:04,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:04,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063407864] [2022-12-13 00:37:04,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063407864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:04,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:04,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:37:04,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603141863] [2022-12-13 00:37:04,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:04,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:37:04,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:04,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:37:04,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:37:04,224 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2022-12-13 00:37:04,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 285 flow. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:04,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:04,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2022-12-13 00:37:04,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:04,696 INFO L130 PetriNetUnfolder]: 2305/4053 cut-off events. [2022-12-13 00:37:04,696 INFO L131 PetriNetUnfolder]: For 4088/4155 co-relation queries the response was YES. [2022-12-13 00:37:04,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12933 conditions, 4053 events. 2305/4053 cut-off events. For 4088/4155 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 28254 event pairs, 66 based on Foata normal form. 469/3069 useless extension candidates. Maximal degree in co-relation 12911. Up to 2386 conditions per place. [2022-12-13 00:37:04,713 INFO L137 encePairwiseOnDemand]: 18/30 looper letters, 68 selfloop transitions, 20 changer transitions 4/101 dead transitions. [2022-12-13 00:37:04,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 101 transitions, 744 flow [2022-12-13 00:37:04,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:37:04,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:37:04,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2022-12-13 00:37:04,714 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.72 [2022-12-13 00:37:04,715 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 285 flow. Second operand 5 states and 108 transitions. [2022-12-13 00:37:04,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 101 transitions, 744 flow [2022-12-13 00:37:04,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 101 transitions, 704 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 00:37:04,726 INFO L231 Difference]: Finished difference. Result has 59 places, 58 transitions, 389 flow [2022-12-13 00:37:04,727 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=389, PETRI_PLACES=59, PETRI_TRANSITIONS=58} [2022-12-13 00:37:04,727 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -5 predicate places. [2022-12-13 00:37:04,727 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:04,727 INFO L89 Accepts]: Start accepts. Operand has 59 places, 58 transitions, 389 flow [2022-12-13 00:37:04,728 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:04,728 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:04,729 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 58 transitions, 389 flow [2022-12-13 00:37:04,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 58 transitions, 389 flow [2022-12-13 00:37:04,856 INFO L130 PetriNetUnfolder]: 867/1935 cut-off events. [2022-12-13 00:37:04,856 INFO L131 PetriNetUnfolder]: For 1412/2054 co-relation queries the response was YES. [2022-12-13 00:37:04,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6669 conditions, 1935 events. 867/1935 cut-off events. For 1412/2054 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 16280 event pairs, 104 based on Foata normal form. 8/936 useless extension candidates. Maximal degree in co-relation 6648. Up to 1597 conditions per place. [2022-12-13 00:37:04,873 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 58 transitions, 389 flow [2022-12-13 00:37:04,873 INFO L226 LiptonReduction]: Number of co-enabled transitions 744 [2022-12-13 00:37:05,170 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:37:05,171 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 444 [2022-12-13 00:37:05,171 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 58 transitions, 393 flow [2022-12-13 00:37:05,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:05,171 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:05,171 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:05,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:37:05,171 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:37:05,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:05,172 INFO L85 PathProgramCache]: Analyzing trace with hash 587120204, now seen corresponding path program 1 times [2022-12-13 00:37:05,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:05,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381840082] [2022-12-13 00:37:05,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:05,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:05,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:37:05,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:05,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381840082] [2022-12-13 00:37:05,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381840082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:05,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:05,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:37:05,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650409273] [2022-12-13 00:37:05,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:05,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:37:05,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:05,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:37:05,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:37:05,376 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2022-12-13 00:37:05,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 58 transitions, 393 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:05,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:05,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2022-12-13 00:37:05,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:05,653 INFO L130 PetriNetUnfolder]: 1042/2087 cut-off events. [2022-12-13 00:37:05,653 INFO L131 PetriNetUnfolder]: For 2534/2622 co-relation queries the response was YES. [2022-12-13 00:37:05,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8618 conditions, 2087 events. 1042/2087 cut-off events. For 2534/2622 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 14361 event pairs, 48 based on Foata normal form. 299/1631 useless extension candidates. Maximal degree in co-relation 8594. Up to 1165 conditions per place. [2022-12-13 00:37:05,664 INFO L137 encePairwiseOnDemand]: 19/31 looper letters, 38 selfloop transitions, 29 changer transitions 7/81 dead transitions. [2022-12-13 00:37:05,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 81 transitions, 647 flow [2022-12-13 00:37:05,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:37:05,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:37:05,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2022-12-13 00:37:05,666 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.532258064516129 [2022-12-13 00:37:05,666 INFO L175 Difference]: Start difference. First operand has 59 places, 58 transitions, 393 flow. Second operand 6 states and 99 transitions. [2022-12-13 00:37:05,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 81 transitions, 647 flow [2022-12-13 00:37:05,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 81 transitions, 575 flow, removed 12 selfloop flow, removed 6 redundant places. [2022-12-13 00:37:05,692 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 383 flow [2022-12-13 00:37:05,692 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=383, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2022-12-13 00:37:05,694 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -4 predicate places. [2022-12-13 00:37:05,694 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:05,695 INFO L89 Accepts]: Start accepts. Operand has 60 places, 53 transitions, 383 flow [2022-12-13 00:37:05,696 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:05,696 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:05,696 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 53 transitions, 383 flow [2022-12-13 00:37:05,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 53 transitions, 383 flow [2022-12-13 00:37:05,720 INFO L130 PetriNetUnfolder]: 124/350 cut-off events. [2022-12-13 00:37:05,721 INFO L131 PetriNetUnfolder]: For 511/705 co-relation queries the response was YES. [2022-12-13 00:37:05,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1426 conditions, 350 events. 124/350 cut-off events. For 511/705 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 1933 event pairs, 2 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 1406. Up to 235 conditions per place. [2022-12-13 00:37:05,724 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 53 transitions, 383 flow [2022-12-13 00:37:05,724 INFO L226 LiptonReduction]: Number of co-enabled transitions 470 [2022-12-13 00:37:05,730 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [339] L749-->L754: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [398] L846-3-->L849: Formula: (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0) 0) 0 1) v_~main$tmp_guard0~0_10) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1] [2022-12-13 00:37:05,741 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [421] L749-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] and [398] L846-3-->L849: Formula: (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0) 0) 0 1) v_~main$tmp_guard0~0_10) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1] [2022-12-13 00:37:05,765 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [422] L749-->P0FINAL: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_9| 0) (= v_~__unbuffered_cnt~0_55 (+ v_~__unbuffered_cnt~0_56 1)) (= |v_P0Thread1of1ForFork1_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] and [398] L846-3-->L849: Formula: (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0) 0) 0 1) v_~main$tmp_guard0~0_10) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1] [2022-12-13 00:37:06,276 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [405] L777-->P1FINAL: Formula: (and (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P1Thread1of1ForFork2_#res.base_5| 0) (= |v_P1Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] and [507] L846-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (not (= (mod v_~y$r_buff1_thd0~0_122 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_364 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_125 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_365 256) 0)))) (.cse3 (and .cse1 .cse5)) (.cse4 (and .cse0 (not (= (mod v_~y$w_buff1_used~0_325 256) 0))))) (and (= v_~y$r_buff1_thd0~0_121 (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_324 256) 0))) (and .cse1 (not (= (mod v_~y$r_buff0_thd0~0_124 256) 0)))) 0 v_~y$r_buff1_thd0~0_122)) (= (ite .cse2 0 v_~y$w_buff0_used~0_365) v_~y$w_buff0_used~0_364) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_83|) (= v_~y$r_buff0_thd0~0_124 (ite .cse3 0 v_~y$r_buff0_thd0~0_125)) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_119 0) (= v_~__unbuffered_p2_EAX~0_117 1) (= v_~__unbuffered_p2_EBX~0_103 0) (= 2 v_~x~0_116))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_104) (= (ite (= (ite (= v_~__unbuffered_cnt~0_513 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_132) (= v_~y~0_295 (ite .cse2 v_~y$w_buff0~0_248 (ite .cse4 v_~y$w_buff1~0_220 v_~y~0_296))) (= v_~y$w_buff1_used~0_324 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_325)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_83| (mod v_~main$tmp_guard0~0_132 256)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99| (mod v_~main$tmp_guard1~0_104 256)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_101| 0) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_101| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| 0))))) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_103, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_365, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, ~y$w_buff0~0=v_~y$w_buff0~0_248, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_117, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_513, ~y~0=v_~y~0_296, ~x~0=v_~x~0_116, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_122, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_325} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_101|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_103, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_364, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_121|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_132, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_107|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_124, ~y$w_buff0~0=v_~y$w_buff0~0_248, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_87|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_117, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_513, ~y~0=v_~y~0_295, ~x~0=v_~x~0_116, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_121, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_324, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_83|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:37:06,518 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [434] L777-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.offset_9| 0) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63) (= |v_P1Thread1of1ForFork2_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] and [507] L846-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (not (= (mod v_~y$r_buff1_thd0~0_122 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_364 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_125 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_365 256) 0)))) (.cse3 (and .cse1 .cse5)) (.cse4 (and .cse0 (not (= (mod v_~y$w_buff1_used~0_325 256) 0))))) (and (= v_~y$r_buff1_thd0~0_121 (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_324 256) 0))) (and .cse1 (not (= (mod v_~y$r_buff0_thd0~0_124 256) 0)))) 0 v_~y$r_buff1_thd0~0_122)) (= (ite .cse2 0 v_~y$w_buff0_used~0_365) v_~y$w_buff0_used~0_364) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_83|) (= v_~y$r_buff0_thd0~0_124 (ite .cse3 0 v_~y$r_buff0_thd0~0_125)) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_119 0) (= v_~__unbuffered_p2_EAX~0_117 1) (= v_~__unbuffered_p2_EBX~0_103 0) (= 2 v_~x~0_116))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_104) (= (ite (= (ite (= v_~__unbuffered_cnt~0_513 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_132) (= v_~y~0_295 (ite .cse2 v_~y$w_buff0~0_248 (ite .cse4 v_~y$w_buff1~0_220 v_~y~0_296))) (= v_~y$w_buff1_used~0_324 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_325)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_83| (mod v_~main$tmp_guard0~0_132 256)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99| (mod v_~main$tmp_guard1~0_104 256)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_101| 0) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_101| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| 0))))) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_103, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_365, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, ~y$w_buff0~0=v_~y$w_buff0~0_248, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_117, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_513, ~y~0=v_~y~0_296, ~x~0=v_~x~0_116, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_122, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_325} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_101|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_103, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_364, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_121|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_132, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_107|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_124, ~y$w_buff0~0=v_~y$w_buff0~0_248, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_87|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_117, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_513, ~y~0=v_~y~0_295, ~x~0=v_~x~0_116, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_121, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_324, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_83|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:37:06,728 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [345] L777-->L782: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [507] L846-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (not (= (mod v_~y$r_buff1_thd0~0_122 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_364 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_125 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_365 256) 0)))) (.cse3 (and .cse1 .cse5)) (.cse4 (and .cse0 (not (= (mod v_~y$w_buff1_used~0_325 256) 0))))) (and (= v_~y$r_buff1_thd0~0_121 (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_324 256) 0))) (and .cse1 (not (= (mod v_~y$r_buff0_thd0~0_124 256) 0)))) 0 v_~y$r_buff1_thd0~0_122)) (= (ite .cse2 0 v_~y$w_buff0_used~0_365) v_~y$w_buff0_used~0_364) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_83|) (= v_~y$r_buff0_thd0~0_124 (ite .cse3 0 v_~y$r_buff0_thd0~0_125)) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_119 0) (= v_~__unbuffered_p2_EAX~0_117 1) (= v_~__unbuffered_p2_EBX~0_103 0) (= 2 v_~x~0_116))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_104) (= (ite (= (ite (= v_~__unbuffered_cnt~0_513 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_132) (= v_~y~0_295 (ite .cse2 v_~y$w_buff0~0_248 (ite .cse4 v_~y$w_buff1~0_220 v_~y~0_296))) (= v_~y$w_buff1_used~0_324 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_325)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_83| (mod v_~main$tmp_guard0~0_132 256)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99| (mod v_~main$tmp_guard1~0_104 256)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_101| 0) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_101| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| 0))))) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_103, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_365, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, ~y$w_buff0~0=v_~y$w_buff0~0_248, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_117, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_513, ~y~0=v_~y~0_296, ~x~0=v_~x~0_116, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_122, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_325} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_101|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_103, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_364, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_121|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_132, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_107|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_124, ~y$w_buff0~0=v_~y$w_buff0~0_248, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_87|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_117, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_513, ~y~0=v_~y~0_295, ~x~0=v_~x~0_116, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_121, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_324, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_83|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:37:06,900 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [339] L749-->L754: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [507] L846-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (not (= (mod v_~y$r_buff1_thd0~0_122 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_364 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_125 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_365 256) 0)))) (.cse3 (and .cse1 .cse5)) (.cse4 (and .cse0 (not (= (mod v_~y$w_buff1_used~0_325 256) 0))))) (and (= v_~y$r_buff1_thd0~0_121 (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_324 256) 0))) (and .cse1 (not (= (mod v_~y$r_buff0_thd0~0_124 256) 0)))) 0 v_~y$r_buff1_thd0~0_122)) (= (ite .cse2 0 v_~y$w_buff0_used~0_365) v_~y$w_buff0_used~0_364) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_83|) (= v_~y$r_buff0_thd0~0_124 (ite .cse3 0 v_~y$r_buff0_thd0~0_125)) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_119 0) (= v_~__unbuffered_p2_EAX~0_117 1) (= v_~__unbuffered_p2_EBX~0_103 0) (= 2 v_~x~0_116))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_104) (= (ite (= (ite (= v_~__unbuffered_cnt~0_513 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_132) (= v_~y~0_295 (ite .cse2 v_~y$w_buff0~0_248 (ite .cse4 v_~y$w_buff1~0_220 v_~y~0_296))) (= v_~y$w_buff1_used~0_324 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_325)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_83| (mod v_~main$tmp_guard0~0_132 256)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99| (mod v_~main$tmp_guard1~0_104 256)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_101| 0) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_101| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| 0))))) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_103, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_365, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, ~y$w_buff0~0=v_~y$w_buff0~0_248, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_117, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_513, ~y~0=v_~y~0_296, ~x~0=v_~x~0_116, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_122, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_325} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_101|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_103, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_364, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_121|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_132, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_107|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_124, ~y$w_buff0~0=v_~y$w_buff0~0_248, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_87|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_117, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_513, ~y~0=v_~y~0_295, ~x~0=v_~x~0_116, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_121, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_324, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_83|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:37:07,098 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [421] L749-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] and [507] L846-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (not (= (mod v_~y$r_buff1_thd0~0_122 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_364 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_125 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_365 256) 0)))) (.cse3 (and .cse1 .cse5)) (.cse4 (and .cse0 (not (= (mod v_~y$w_buff1_used~0_325 256) 0))))) (and (= v_~y$r_buff1_thd0~0_121 (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_324 256) 0))) (and .cse1 (not (= (mod v_~y$r_buff0_thd0~0_124 256) 0)))) 0 v_~y$r_buff1_thd0~0_122)) (= (ite .cse2 0 v_~y$w_buff0_used~0_365) v_~y$w_buff0_used~0_364) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_83|) (= v_~y$r_buff0_thd0~0_124 (ite .cse3 0 v_~y$r_buff0_thd0~0_125)) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_119 0) (= v_~__unbuffered_p2_EAX~0_117 1) (= v_~__unbuffered_p2_EBX~0_103 0) (= 2 v_~x~0_116))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_104) (= (ite (= (ite (= v_~__unbuffered_cnt~0_513 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_132) (= v_~y~0_295 (ite .cse2 v_~y$w_buff0~0_248 (ite .cse4 v_~y$w_buff1~0_220 v_~y~0_296))) (= v_~y$w_buff1_used~0_324 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_325)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_83| (mod v_~main$tmp_guard0~0_132 256)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99| (mod v_~main$tmp_guard1~0_104 256)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_101| 0) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_101| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| 0))))) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_103, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_365, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, ~y$w_buff0~0=v_~y$w_buff0~0_248, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_117, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_513, ~y~0=v_~y~0_296, ~x~0=v_~x~0_116, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_122, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_325} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_101|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_103, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_364, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_121|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_132, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_107|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_124, ~y$w_buff0~0=v_~y$w_buff0~0_248, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_87|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_117, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_513, ~y~0=v_~y~0_295, ~x~0=v_~x~0_116, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_121, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_324, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_83|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:37:07,315 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [422] L749-->P0FINAL: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_9| 0) (= v_~__unbuffered_cnt~0_55 (+ v_~__unbuffered_cnt~0_56 1)) (= |v_P0Thread1of1ForFork1_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] and [507] L846-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (not (= (mod v_~y$r_buff1_thd0~0_122 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_364 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_125 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_365 256) 0)))) (.cse3 (and .cse1 .cse5)) (.cse4 (and .cse0 (not (= (mod v_~y$w_buff1_used~0_325 256) 0))))) (and (= v_~y$r_buff1_thd0~0_121 (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_324 256) 0))) (and .cse1 (not (= (mod v_~y$r_buff0_thd0~0_124 256) 0)))) 0 v_~y$r_buff1_thd0~0_122)) (= (ite .cse2 0 v_~y$w_buff0_used~0_365) v_~y$w_buff0_used~0_364) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_83|) (= v_~y$r_buff0_thd0~0_124 (ite .cse3 0 v_~y$r_buff0_thd0~0_125)) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_119 0) (= v_~__unbuffered_p2_EAX~0_117 1) (= v_~__unbuffered_p2_EBX~0_103 0) (= 2 v_~x~0_116))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_104) (= (ite (= (ite (= v_~__unbuffered_cnt~0_513 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_132) (= v_~y~0_295 (ite .cse2 v_~y$w_buff0~0_248 (ite .cse4 v_~y$w_buff1~0_220 v_~y~0_296))) (= v_~y$w_buff1_used~0_324 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_325)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_83| (mod v_~main$tmp_guard0~0_132 256)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99| (mod v_~main$tmp_guard1~0_104 256)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_101| 0) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_101| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| 0))))) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_103, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_365, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, ~y$w_buff0~0=v_~y$w_buff0~0_248, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_117, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_513, ~y~0=v_~y~0_296, ~x~0=v_~x~0_116, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_122, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_325} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_101|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_103, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_364, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_121|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_132, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_107|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_124, ~y$w_buff0~0=v_~y$w_buff0~0_248, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_87|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_117, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_513, ~y~0=v_~y~0_295, ~x~0=v_~x~0_116, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_121, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_324, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_83|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:37:07,553 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [354] L824-->L827: Formula: (= (+ v_~__unbuffered_cnt~0_6 1) v_~__unbuffered_cnt~0_5) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_6} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_5} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [507] L846-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (not (= (mod v_~y$r_buff1_thd0~0_122 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_364 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_125 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_365 256) 0)))) (.cse3 (and .cse1 .cse5)) (.cse4 (and .cse0 (not (= (mod v_~y$w_buff1_used~0_325 256) 0))))) (and (= v_~y$r_buff1_thd0~0_121 (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_324 256) 0))) (and .cse1 (not (= (mod v_~y$r_buff0_thd0~0_124 256) 0)))) 0 v_~y$r_buff1_thd0~0_122)) (= (ite .cse2 0 v_~y$w_buff0_used~0_365) v_~y$w_buff0_used~0_364) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_83|) (= v_~y$r_buff0_thd0~0_124 (ite .cse3 0 v_~y$r_buff0_thd0~0_125)) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_119 0) (= v_~__unbuffered_p2_EAX~0_117 1) (= v_~__unbuffered_p2_EBX~0_103 0) (= 2 v_~x~0_116))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_104) (= (ite (= (ite (= v_~__unbuffered_cnt~0_513 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_132) (= v_~y~0_295 (ite .cse2 v_~y$w_buff0~0_248 (ite .cse4 v_~y$w_buff1~0_220 v_~y~0_296))) (= v_~y$w_buff1_used~0_324 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_325)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_83| (mod v_~main$tmp_guard0~0_132 256)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99| (mod v_~main$tmp_guard1~0_104 256)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_101| 0) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_101| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| 0))))) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_103, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_365, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, ~y$w_buff0~0=v_~y$w_buff0~0_248, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_117, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_513, ~y~0=v_~y~0_296, ~x~0=v_~x~0_116, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_122, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_325} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_101|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_103, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_364, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_121|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_132, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_107|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_124, ~y$w_buff0~0=v_~y$w_buff0~0_248, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_87|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_117, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_513, ~y~0=v_~y~0_295, ~x~0=v_~x~0_116, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_121, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_324, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_83|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:37:07,751 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [485] L824-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_103 (+ v_~__unbuffered_cnt~0_104 1)) (= |v_P2Thread1of1ForFork0_#res#1.base_9| 0) (= 0 |v_P2Thread1of1ForFork0_#res#1.offset_9|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_104} OutVars{P2Thread1of1ForFork0_#res#1.offset=|v_P2Thread1of1ForFork0_#res#1.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P2Thread1of1ForFork0_#res#1.base=|v_P2Thread1of1ForFork0_#res#1.base_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res#1.offset, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res#1.base] and [507] L846-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (not (= (mod v_~y$r_buff1_thd0~0_122 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_364 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_125 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_365 256) 0)))) (.cse3 (and .cse1 .cse5)) (.cse4 (and .cse0 (not (= (mod v_~y$w_buff1_used~0_325 256) 0))))) (and (= v_~y$r_buff1_thd0~0_121 (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_324 256) 0))) (and .cse1 (not (= (mod v_~y$r_buff0_thd0~0_124 256) 0)))) 0 v_~y$r_buff1_thd0~0_122)) (= (ite .cse2 0 v_~y$w_buff0_used~0_365) v_~y$w_buff0_used~0_364) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_83|) (= v_~y$r_buff0_thd0~0_124 (ite .cse3 0 v_~y$r_buff0_thd0~0_125)) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_119 0) (= v_~__unbuffered_p2_EAX~0_117 1) (= v_~__unbuffered_p2_EBX~0_103 0) (= 2 v_~x~0_116))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_104) (= (ite (= (ite (= v_~__unbuffered_cnt~0_513 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_132) (= v_~y~0_295 (ite .cse2 v_~y$w_buff0~0_248 (ite .cse4 v_~y$w_buff1~0_220 v_~y~0_296))) (= v_~y$w_buff1_used~0_324 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_325)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_83| (mod v_~main$tmp_guard0~0_132 256)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99| (mod v_~main$tmp_guard1~0_104 256)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_101| 0) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_101| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| 0))))) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_103, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_365, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, ~y$w_buff0~0=v_~y$w_buff0~0_248, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_117, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_513, ~y~0=v_~y~0_296, ~x~0=v_~x~0_116, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_122, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_325} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_101|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_103, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_364, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_121|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_132, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_107|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_124, ~y$w_buff0~0=v_~y$w_buff0~0_248, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_87|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_117, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_513, ~y~0=v_~y~0_295, ~x~0=v_~x~0_116, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_121, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_324, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_83|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:37:07,948 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [413] L824-->P2FINAL: Formula: (and (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= 0 |v_P2Thread1of1ForFork0_#res#1.offset_5|) (= |v_P2Thread1of1ForFork0_#res#1.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{P2Thread1of1ForFork0_#res#1.offset=|v_P2Thread1of1ForFork0_#res#1.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P2Thread1of1ForFork0_#res#1.base=|v_P2Thread1of1ForFork0_#res#1.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res#1.offset, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res#1.base] and [507] L846-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (not (= (mod v_~y$r_buff1_thd0~0_122 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_364 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_125 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_365 256) 0)))) (.cse3 (and .cse1 .cse5)) (.cse4 (and .cse0 (not (= (mod v_~y$w_buff1_used~0_325 256) 0))))) (and (= v_~y$r_buff1_thd0~0_121 (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_324 256) 0))) (and .cse1 (not (= (mod v_~y$r_buff0_thd0~0_124 256) 0)))) 0 v_~y$r_buff1_thd0~0_122)) (= (ite .cse2 0 v_~y$w_buff0_used~0_365) v_~y$w_buff0_used~0_364) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_83|) (= v_~y$r_buff0_thd0~0_124 (ite .cse3 0 v_~y$r_buff0_thd0~0_125)) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_119 0) (= v_~__unbuffered_p2_EAX~0_117 1) (= v_~__unbuffered_p2_EBX~0_103 0) (= 2 v_~x~0_116))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_104) (= (ite (= (ite (= v_~__unbuffered_cnt~0_513 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_132) (= v_~y~0_295 (ite .cse2 v_~y$w_buff0~0_248 (ite .cse4 v_~y$w_buff1~0_220 v_~y~0_296))) (= v_~y$w_buff1_used~0_324 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_325)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_83| (mod v_~main$tmp_guard0~0_132 256)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99| (mod v_~main$tmp_guard1~0_104 256)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_101| 0) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_101| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| 0))))) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_103, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_365, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, ~y$w_buff0~0=v_~y$w_buff0~0_248, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_117, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_513, ~y~0=v_~y~0_296, ~x~0=v_~x~0_116, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_122, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_325} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_101|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_103, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_364, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_121|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_132, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_107|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_124, ~y$w_buff0~0=v_~y$w_buff0~0_248, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_87|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_117, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_513, ~y~0=v_~y~0_295, ~x~0=v_~x~0_116, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_121, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_324, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_83|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:37:08,169 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 00:37:08,170 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2476 [2022-12-13 00:37:08,170 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 409 flow [2022-12-13 00:37:08,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:08,170 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:08,170 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:08,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:37:08,171 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:37:08,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:08,171 INFO L85 PathProgramCache]: Analyzing trace with hash 599306798, now seen corresponding path program 1 times [2022-12-13 00:37:08,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:08,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689500006] [2022-12-13 00:37:08,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:08,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:08,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:37:08,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:08,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689500006] [2022-12-13 00:37:08,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689500006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:08,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:08,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:37:08,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941343356] [2022-12-13 00:37:08,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:08,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:37:08,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:08,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:37:08,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:37:08,387 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2022-12-13 00:37:08,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 409 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:08,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:08,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2022-12-13 00:37:08,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:08,581 INFO L130 PetriNetUnfolder]: 283/618 cut-off events. [2022-12-13 00:37:08,581 INFO L131 PetriNetUnfolder]: For 2352/2406 co-relation queries the response was YES. [2022-12-13 00:37:08,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3075 conditions, 618 events. 283/618 cut-off events. For 2352/2406 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3419 event pairs, 28 based on Foata normal form. 40/495 useless extension candidates. Maximal degree in co-relation 3052. Up to 366 conditions per place. [2022-12-13 00:37:08,585 INFO L137 encePairwiseOnDemand]: 19/35 looper letters, 51 selfloop transitions, 12 changer transitions 4/75 dead transitions. [2022-12-13 00:37:08,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 75 transitions, 700 flow [2022-12-13 00:37:08,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:37:08,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:37:08,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2022-12-13 00:37:08,586 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5371428571428571 [2022-12-13 00:37:08,586 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 409 flow. Second operand 5 states and 94 transitions. [2022-12-13 00:37:08,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 75 transitions, 700 flow [2022-12-13 00:37:08,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 75 transitions, 493 flow, removed 30 selfloop flow, removed 10 redundant places. [2022-12-13 00:37:08,594 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 353 flow [2022-12-13 00:37:08,594 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=353, PETRI_PLACES=52, PETRI_TRANSITIONS=53} [2022-12-13 00:37:08,595 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -12 predicate places. [2022-12-13 00:37:08,595 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:08,595 INFO L89 Accepts]: Start accepts. Operand has 52 places, 53 transitions, 353 flow [2022-12-13 00:37:08,598 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:08,598 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:08,598 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 53 transitions, 353 flow [2022-12-13 00:37:08,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 53 transitions, 353 flow [2022-12-13 00:37:08,625 INFO L130 PetriNetUnfolder]: 80/255 cut-off events. [2022-12-13 00:37:08,625 INFO L131 PetriNetUnfolder]: For 331/347 co-relation queries the response was YES. [2022-12-13 00:37:08,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 797 conditions, 255 events. 80/255 cut-off events. For 331/347 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 1540 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 781. Up to 102 conditions per place. [2022-12-13 00:37:08,627 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 53 transitions, 353 flow [2022-12-13 00:37:08,627 INFO L226 LiptonReduction]: Number of co-enabled transitions 430 [2022-12-13 00:37:08,628 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:37:08,629 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-13 00:37:08,629 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 353 flow [2022-12-13 00:37:08,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:08,629 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:08,629 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:08,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:37:08,629 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:37:08,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:08,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1318633214, now seen corresponding path program 1 times [2022-12-13 00:37:08,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:08,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414769429] [2022-12-13 00:37:08,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:08,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:08,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:37:08,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:08,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414769429] [2022-12-13 00:37:08,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414769429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:08,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:08,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:37:08,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577416103] [2022-12-13 00:37:08,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:08,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:37:08,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:08,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:37:08,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:37:08,864 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2022-12-13 00:37:08,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 53 transitions, 353 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:08,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:08,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2022-12-13 00:37:08,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:09,105 INFO L130 PetriNetUnfolder]: 331/746 cut-off events. [2022-12-13 00:37:09,105 INFO L131 PetriNetUnfolder]: For 1756/1779 co-relation queries the response was YES. [2022-12-13 00:37:09,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2804 conditions, 746 events. 331/746 cut-off events. For 1756/1779 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4518 event pairs, 46 based on Foata normal form. 34/583 useless extension candidates. Maximal degree in co-relation 2785. Up to 338 conditions per place. [2022-12-13 00:37:09,109 INFO L137 encePairwiseOnDemand]: 20/35 looper letters, 38 selfloop transitions, 5 changer transitions 34/84 dead transitions. [2022-12-13 00:37:09,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 84 transitions, 626 flow [2022-12-13 00:37:09,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:37:09,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:37:09,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2022-12-13 00:37:09,110 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5095238095238095 [2022-12-13 00:37:09,110 INFO L175 Difference]: Start difference. First operand has 52 places, 53 transitions, 353 flow. Second operand 6 states and 107 transitions. [2022-12-13 00:37:09,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 84 transitions, 626 flow [2022-12-13 00:37:09,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 84 transitions, 624 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-13 00:37:09,114 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 267 flow [2022-12-13 00:37:09,114 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=267, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2022-12-13 00:37:09,114 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -6 predicate places. [2022-12-13 00:37:09,114 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:09,115 INFO L89 Accepts]: Start accepts. Operand has 58 places, 40 transitions, 267 flow [2022-12-13 00:37:09,115 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:09,116 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:09,116 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 40 transitions, 267 flow [2022-12-13 00:37:09,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 40 transitions, 267 flow [2022-12-13 00:37:09,136 INFO L130 PetriNetUnfolder]: 63/161 cut-off events. [2022-12-13 00:37:09,137 INFO L131 PetriNetUnfolder]: For 424/451 co-relation queries the response was YES. [2022-12-13 00:37:09,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 161 events. 63/161 cut-off events. For 424/451 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 779 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 645. Up to 88 conditions per place. [2022-12-13 00:37:09,138 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 40 transitions, 267 flow [2022-12-13 00:37:09,138 INFO L226 LiptonReduction]: Number of co-enabled transitions 156 [2022-12-13 00:37:10,142 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 00:37:10,142 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1028 [2022-12-13 00:37:10,142 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 37 transitions, 266 flow [2022-12-13 00:37:10,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:10,143 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:10,143 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:10,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:37:10,143 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:37:10,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:10,143 INFO L85 PathProgramCache]: Analyzing trace with hash -236750629, now seen corresponding path program 1 times [2022-12-13 00:37:10,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:10,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924459214] [2022-12-13 00:37:10,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:10,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:10,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:37:10,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:10,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924459214] [2022-12-13 00:37:10,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924459214] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:10,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:10,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:37:10,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505883709] [2022-12-13 00:37:10,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:10,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:37:10,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:10,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:37:10,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:37:10,778 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2022-12-13 00:37:10,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 37 transitions, 266 flow. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:10,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:10,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2022-12-13 00:37:10,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:11,015 INFO L130 PetriNetUnfolder]: 99/239 cut-off events. [2022-12-13 00:37:11,015 INFO L131 PetriNetUnfolder]: For 1299/1306 co-relation queries the response was YES. [2022-12-13 00:37:11,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1105 conditions, 239 events. 99/239 cut-off events. For 1299/1306 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 1386 event pairs, 8 based on Foata normal form. 32/173 useless extension candidates. Maximal degree in co-relation 1083. Up to 97 conditions per place. [2022-12-13 00:37:11,017 INFO L137 encePairwiseOnDemand]: 17/31 looper letters, 23 selfloop transitions, 14 changer transitions 14/57 dead transitions. [2022-12-13 00:37:11,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 57 transitions, 458 flow [2022-12-13 00:37:11,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:37:11,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:37:11,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2022-12-13 00:37:11,018 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2022-12-13 00:37:11,018 INFO L175 Difference]: Start difference. First operand has 53 places, 37 transitions, 266 flow. Second operand 7 states and 84 transitions. [2022-12-13 00:37:11,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 57 transitions, 458 flow [2022-12-13 00:37:11,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 57 transitions, 344 flow, removed 30 selfloop flow, removed 15 redundant places. [2022-12-13 00:37:11,021 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 185 flow [2022-12-13 00:37:11,021 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=185, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2022-12-13 00:37:11,022 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -21 predicate places. [2022-12-13 00:37:11,022 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:11,022 INFO L89 Accepts]: Start accepts. Operand has 43 places, 35 transitions, 185 flow [2022-12-13 00:37:11,022 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:11,022 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:11,023 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 35 transitions, 185 flow [2022-12-13 00:37:11,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 185 flow [2022-12-13 00:37:11,055 INFO L130 PetriNetUnfolder]: 63/141 cut-off events. [2022-12-13 00:37:11,055 INFO L131 PetriNetUnfolder]: For 135/135 co-relation queries the response was YES. [2022-12-13 00:37:11,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 141 events. 63/141 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 650 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 418. Up to 82 conditions per place. [2022-12-13 00:37:11,056 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 35 transitions, 185 flow [2022-12-13 00:37:11,056 INFO L226 LiptonReduction]: Number of co-enabled transitions 62 [2022-12-13 00:37:13,411 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [518] $Ultimate##0-->L749: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= v_~z~0_39 1) (= v_~x~0_136 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, ~z~0=v_~z~0_39, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_136, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] and [530] $Ultimate##0-->L782: Formula: (let ((.cse3 (= (mod v_~y$r_buff1_thd2~0_151 256) 0)) (.cse9 (= (mod v_~y$r_buff0_thd2~0_150 256) 0))) (let ((.cse10 (not .cse9)) (.cse7 (and (= (mod v_~y$w_buff1_used~0_429 256) 0) .cse9)) (.cse8 (and .cse3 .cse9)) (.cse11 (= (mod v_~y$w_buff0_used~0_473 256) 0))) (let ((.cse5 (or .cse7 .cse8 .cse11)) (.cse6 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_144 256) 0))) (.cse2 (= (mod v_~y$w_buff1_used~0_428 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_472 256) 0))) (and (= (ite .cse0 v_~y$r_buff1_thd2~0_151 (ite (let ((.cse1 (= (mod v_~y$r_buff0_thd2~0_149 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse1) .cse4)) v_~y$r_buff1_thd2~0_151 0)) v_~y$r_buff1_thd2~0_150) (= |v_P1Thread1of1ForFork2_#in~arg.base_27| v_P1Thread1of1ForFork2_~arg.base_27) (= (ite .cse0 v_~y$w_buff0_used~0_473 (ite .cse5 v_~y$w_buff0_used~0_473 (ite .cse6 0 v_~y$w_buff0_used~0_473))) v_~y$w_buff0_used~0_472) (= |v_P1Thread1of1ForFork2_#in~arg.offset_27| v_P1Thread1of1ForFork2_~arg.offset_27) (= (ite .cse0 v_~y$w_buff1_used~0_429 (ite (or .cse7 .cse8 .cse4) v_~y$w_buff1_used~0_429 0)) v_~y$w_buff1_used~0_428) (= v_~y~0_401 (ite .cse0 v_~y$mem_tmp~0_112 v_~__unbuffered_p1_EAX~0_151)) (= (ite .cse5 v_~y~0_402 (ite .cse6 v_~y$w_buff0~0_309 v_~y$w_buff1~0_277)) v_~__unbuffered_p1_EAX~0_151) (= 2 v_~x~0_150) (= v_~y$flush_delayed~0_132 0) (= |v_P1Thread1of1ForFork2_#t~nondet3_86| v_~weak$$choice0~0_96) (= v_~y$r_buff0_thd2~0_149 (ite .cse0 v_~y$r_buff0_thd2~0_150 (ite (or .cse8 (and .cse2 .cse9) .cse4) v_~y$r_buff0_thd2~0_150 (ite (and .cse10 (not .cse4)) 0 v_~y$r_buff0_thd2~0_150)))) (= v_~y$w_buff1~0_277 v_~y$w_buff1~0_276) (= v_~y$w_buff0~0_309 v_~y$w_buff0~0_308) (= |v_P1Thread1of1ForFork2_#t~nondet4_86| v_~weak$$choice2~0_144) (= v_~y~0_402 v_~y$mem_tmp~0_112) (= v_~__unbuffered_cnt~0_587 (+ v_~__unbuffered_cnt~0_588 1)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_151, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_27|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_473, ~y$w_buff1~0=v_~y$w_buff1~0_277, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_86|, ~y$w_buff0~0=v_~y$w_buff0~0_309, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_86|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_150, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_588, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_27|, ~y~0=v_~y~0_402, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_429} OutVars{P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_472, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_150, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_27|, ~weak$$choice0~0=v_~weak$$choice0~0_96, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_27, ~y$mem_tmp~0=v_~y$mem_tmp~0_112, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_151, ~y$w_buff1~0=v_~y$w_buff1~0_276, ~y$w_buff0~0=v_~y$w_buff0~0_308, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_149, ~y$flush_delayed~0=v_~y$flush_delayed~0_132, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_587, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_27|, ~y~0=v_~y~0_401, ~weak$$choice2~0=v_~weak$$choice2~0_144, ~x~0=v_~x~0_150, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_428} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.base, ~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, P1Thread1of1ForFork2_~arg.offset, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, ~weak$$choice2~0, ~x~0, ~y$w_buff1_used~0] [2022-12-13 00:37:13,636 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [518] $Ultimate##0-->L749: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= v_~z~0_39 1) (= v_~x~0_136 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, ~z~0=v_~z~0_39, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_136, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] and [519] $Ultimate##0-->L777: Formula: (let ((.cse9 (= (mod v_~y$r_buff1_thd2~0_137 256) 0)) (.cse4 (= 0 (mod v_~y$r_buff0_thd2~0_136 256)))) (let ((.cse7 (not .cse4)) (.cse5 (and .cse4 .cse9)) (.cse10 (and .cse4 (= (mod v_~y$w_buff1_used~0_369 256) 0))) (.cse11 (= (mod v_~y$w_buff0_used~0_411 256) 0))) (let ((.cse3 (= (mod v_~y$w_buff1_used~0_368 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_136 256) 0))) (.cse6 (= (mod v_~y$w_buff0_used~0_410 256) 0)) (.cse1 (or .cse5 .cse10 .cse11)) (.cse2 (and .cse7 (not .cse11)))) (and (= v_~y$w_buff0_used~0_410 (ite .cse0 v_~y$w_buff0_used~0_411 (ite .cse1 v_~y$w_buff0_used~0_411 (ite .cse2 0 v_~y$w_buff0_used~0_411)))) (= |v_P1Thread1of1ForFork2_#in~arg.offset_21| v_P1Thread1of1ForFork2_~arg.offset_21) (= v_~y$flush_delayed~0_124 0) (= |v_P1Thread1of1ForFork2_#t~nondet4_74| v_~weak$$choice2~0_136) (= (ite .cse0 v_~y$r_buff0_thd2~0_136 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~y$r_buff0_thd2~0_136 (ite (and .cse7 (not .cse6)) 0 v_~y$r_buff0_thd2~0_136))) v_~y$r_buff0_thd2~0_135) (= |v_P1Thread1of1ForFork2_#in~arg.base_21| v_P1Thread1of1ForFork2_~arg.base_21) (= v_~y$w_buff1~0_245 v_~y$w_buff1~0_244) (= v_~y~0_339 (ite .cse0 v_~y$mem_tmp~0_104 v_~__unbuffered_p1_EAX~0_139)) (= v_~y$r_buff1_thd2~0_136 (ite .cse0 v_~y$r_buff1_thd2~0_137 (ite (let ((.cse8 (= (mod v_~y$r_buff0_thd2~0_135 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse6)) v_~y$r_buff1_thd2~0_137 0))) (= v_~y$w_buff0~0_275 v_~y$w_buff0~0_274) (= 2 v_~x~0_138) (= v_~y~0_340 v_~y$mem_tmp~0_104) (= v_~y$w_buff1_used~0_368 (ite .cse0 v_~y$w_buff1_used~0_369 (ite (or .cse5 .cse6 .cse10) v_~y$w_buff1_used~0_369 0))) (= (ite .cse1 v_~y~0_340 (ite .cse2 v_~y$w_buff0~0_275 v_~y$w_buff1~0_245)) v_~__unbuffered_p1_EAX~0_139) (= |v_P1Thread1of1ForFork2_#t~nondet3_74| v_~weak$$choice0~0_88))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_137, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_21|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_411, ~y$w_buff1~0=v_~y$w_buff1~0_245, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_74|, ~y$w_buff0~0=v_~y$w_buff0~0_275, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_74|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_21|, ~y~0=v_~y~0_340, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_369} OutVars{P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_410, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_136, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_21|, ~weak$$choice0~0=v_~weak$$choice0~0_88, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_21, ~y$mem_tmp~0=v_~y$mem_tmp~0_104, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_139, ~y$w_buff1~0=v_~y$w_buff1~0_244, ~y$w_buff0~0=v_~y$w_buff0~0_274, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_135, ~y$flush_delayed~0=v_~y$flush_delayed~0_124, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_21|, ~y~0=v_~y~0_339, ~weak$$choice2~0=v_~weak$$choice2~0_136, ~x~0=v_~x~0_138, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_368} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.base, ~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, P1Thread1of1ForFork2_~arg.offset, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~x~0, ~y$w_buff1_used~0] [2022-12-13 00:37:13,816 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [518] $Ultimate##0-->L749: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= v_~z~0_39 1) (= v_~x~0_136 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, ~z~0=v_~z~0_39, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_136, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] and [531] $Ultimate##0-->P1FINAL: Formula: (let ((.cse4 (= 0 (mod v_~y$r_buff1_thd2~0_155 256))) (.cse8 (= (mod v_~y$r_buff0_thd2~0_154 256) 0))) (let ((.cse9 (not .cse8)) (.cse7 (and .cse4 .cse8)) (.cse10 (and (= (mod v_~y$w_buff1_used~0_433 256) 0) .cse8)) (.cse11 (= (mod v_~y$w_buff0_used~0_477 256) 0))) (let ((.cse2 (= (mod v_~y$w_buff1_used~0_432 256) 0)) (.cse5 (or .cse7 .cse10 .cse11)) (.cse6 (and .cse9 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_146 256) 0))) (.cse1 (= (mod v_~y$w_buff0_used~0_476 256) 0))) (and (= v_~y~0_406 v_~y$mem_tmp~0_114) (= |v_P1Thread1of1ForFork2_#t~nondet3_90| v_~weak$$choice0~0_98) (= (ite .cse0 v_~y$r_buff1_thd2~0_155 (ite (let ((.cse3 (= (mod v_~y$r_buff0_thd2~0_153 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse4 .cse3))) v_~y$r_buff1_thd2~0_155 0)) v_~y$r_buff1_thd2~0_154) (= v_~y$w_buff0~0_313 v_~y$w_buff0~0_312) (= v_~__unbuffered_p1_EAX~0_153 (ite .cse5 v_~y~0_406 (ite .cse6 v_~y$w_buff0~0_313 v_~y$w_buff1~0_281))) (= 0 |v_P1Thread1of1ForFork2_#res.offset_79|) (= v_~y~0_405 (ite .cse0 v_~y$mem_tmp~0_114 v_~__unbuffered_p1_EAX~0_153)) (= |v_P1Thread1of1ForFork2_#t~nondet4_90| v_~weak$$choice2~0_146) (= |v_P1Thread1of1ForFork2_#in~arg.base_29| v_P1Thread1of1ForFork2_~arg.base_29) (= 2 v_~x~0_152) (= (ite .cse0 v_~y$r_buff0_thd2~0_154 (ite (or .cse1 .cse7 (and .cse2 .cse8)) v_~y$r_buff0_thd2~0_154 (ite (and .cse9 (not .cse1)) 0 v_~y$r_buff0_thd2~0_154))) v_~y$r_buff0_thd2~0_153) (= |v_P1Thread1of1ForFork2_#res.base_79| 0) (= v_~y$w_buff0_used~0_476 (ite .cse0 v_~y$w_buff0_used~0_477 (ite .cse5 v_~y$w_buff0_used~0_477 (ite .cse6 0 v_~y$w_buff0_used~0_477)))) (= v_~y$w_buff1_used~0_432 (ite .cse0 v_~y$w_buff1_used~0_433 (ite (or .cse1 .cse7 .cse10) v_~y$w_buff1_used~0_433 0))) (= v_~y$flush_delayed~0_134 0) (= v_~__unbuffered_cnt~0_591 (+ v_~__unbuffered_cnt~0_592 1)) (= |v_P1Thread1of1ForFork2_#in~arg.offset_29| v_P1Thread1of1ForFork2_~arg.offset_29) (= v_~y$w_buff1~0_281 v_~y$w_buff1~0_280))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_155, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_29|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_477, ~y$w_buff1~0=v_~y$w_buff1~0_281, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_90|, ~y$w_buff0~0=v_~y$w_buff0~0_313, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_90|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_154, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_592, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_29|, ~y~0=v_~y~0_406, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_433} OutVars{P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_29, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_476, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_79|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_154, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_29|, ~weak$$choice0~0=v_~weak$$choice0~0_98, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_29, ~y$mem_tmp~0=v_~y$mem_tmp~0_114, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_153, ~y$w_buff1~0=v_~y$w_buff1~0_280, ~y$w_buff0~0=v_~y$w_buff0~0_312, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_153, ~y$flush_delayed~0=v_~y$flush_delayed~0_134, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_591, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_29|, ~y~0=v_~y~0_405, ~weak$$choice2~0=v_~weak$$choice2~0_146, ~x~0=v_~x~0_152, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_79|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_432} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.base, ~y$w_buff0_used~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, P1Thread1of1ForFork2_~arg.offset, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, ~weak$$choice2~0, ~x~0, P1Thread1of1ForFork2_#res.base, ~y$w_buff1_used~0] [2022-12-13 00:37:14,014 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [518] $Ultimate##0-->L749: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= v_~z~0_39 1) (= v_~x~0_136 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, ~z~0=v_~z~0_39, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_136, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] and [532] $Ultimate##0-->P1EXIT: Formula: (let ((.cse1 (= (mod v_~y$r_buff1_thd2~0_159 256) 0)) (.cse7 (= (mod v_~y$r_buff0_thd2~0_158 256) 0))) (let ((.cse9 (not .cse7)) (.cse10 (and (= (mod v_~y$w_buff1_used~0_437 256) 0) .cse7)) (.cse8 (and .cse1 .cse7)) (.cse11 (= 0 (mod v_~y$w_buff0_used~0_481 256)))) (let ((.cse3 (= (mod v_~y$w_buff1_used~0_436 256) 0)) (.cse5 (or .cse10 .cse8 .cse11)) (.cse6 (and .cse9 (not .cse11))) (.cse4 (= (mod v_~y$w_buff0_used~0_480 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_148 256) 0)))) (and (= (ite .cse0 v_~y$r_buff1_thd2~0_159 (ite (let ((.cse2 (= (mod v_~y$r_buff0_thd2~0_157 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4)) v_~y$r_buff1_thd2~0_159 0)) v_~y$r_buff1_thd2~0_158) (= v_~__unbuffered_p1_EAX~0_155 (ite .cse5 v_~y~0_410 (ite .cse6 v_~y$w_buff0~0_317 v_~y$w_buff1~0_285))) (= (ite .cse0 v_~y$r_buff0_thd2~0_158 (ite (or .cse4 (and .cse3 .cse7) .cse8) v_~y$r_buff0_thd2~0_158 (ite (and .cse9 (not .cse4)) 0 v_~y$r_buff0_thd2~0_158))) v_~y$r_buff0_thd2~0_157) (= (ite .cse0 v_~y$w_buff0_used~0_481 (ite .cse5 v_~y$w_buff0_used~0_481 (ite .cse6 0 v_~y$w_buff0_used~0_481))) v_~y$w_buff0_used~0_480) (= 2 v_~x~0_154) (= 0 |v_P1Thread1of1ForFork2_#res.offset_81|) (= v_~y$w_buff0~0_317 v_~y$w_buff0~0_316) (= |v_P1Thread1of1ForFork2_#in~arg.base_31| v_P1Thread1of1ForFork2_~arg.base_31) (= |v_P1Thread1of1ForFork2_#in~arg.offset_31| v_P1Thread1of1ForFork2_~arg.offset_31) (= |v_P1Thread1of1ForFork2_#res.base_81| 0) (= v_~y~0_410 v_~y$mem_tmp~0_116) (= |v_P1Thread1of1ForFork2_#t~nondet4_94| v_~weak$$choice2~0_148) (= (ite .cse0 v_~y$w_buff1_used~0_437 (ite (or .cse4 .cse10 .cse8) v_~y$w_buff1_used~0_437 0)) v_~y$w_buff1_used~0_436) (= v_~__unbuffered_cnt~0_595 (+ v_~__unbuffered_cnt~0_596 1)) (= v_~y$w_buff1~0_285 v_~y$w_buff1~0_284) (= v_~y$flush_delayed~0_136 0) (= |v_P1Thread1of1ForFork2_#t~nondet3_94| v_~weak$$choice0~0_100) (= v_~y~0_409 (ite .cse0 v_~y$mem_tmp~0_116 v_~__unbuffered_p1_EAX~0_155)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_159, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_31|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_481, ~y$w_buff1~0=v_~y$w_buff1~0_285, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_94|, ~y$w_buff0~0=v_~y$w_buff0~0_317, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_94|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_158, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_596, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_31|, ~y~0=v_~y~0_410, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_437} OutVars{P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_31, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_480, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_81|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_158, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_31|, ~weak$$choice0~0=v_~weak$$choice0~0_100, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_31, ~y$mem_tmp~0=v_~y$mem_tmp~0_116, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_155, ~y$w_buff1~0=v_~y$w_buff1~0_284, ~y$w_buff0~0=v_~y$w_buff0~0_316, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_157, ~y$flush_delayed~0=v_~y$flush_delayed~0_136, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_595, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_31|, ~y~0=v_~y~0_409, ~weak$$choice2~0=v_~weak$$choice2~0_148, ~x~0=v_~x~0_154, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_81|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_436} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.base, ~y$w_buff0_used~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, P1Thread1of1ForFork2_~arg.offset, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, ~weak$$choice2~0, ~x~0, P1Thread1of1ForFork2_#res.base, ~y$w_buff1_used~0] [2022-12-13 00:37:14,247 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:37:14,248 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3226 [2022-12-13 00:37:14,248 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 216 flow [2022-12-13 00:37:14,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:14,248 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:14,248 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:14,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:37:14,249 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:37:14,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:14,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1639722333, now seen corresponding path program 1 times [2022-12-13 00:37:14,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:14,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960683225] [2022-12-13 00:37:14,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:14,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:37:14,298 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:37:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:37:14,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:37:14,364 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:37:14,366 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 00:37:14,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 00:37:14,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 00:37:14,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 00:37:14,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 00:37:14,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 00:37:14,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 00:37:14,371 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:14,375 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:37:14,376 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:37:14,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:37:14 BasicIcfg [2022-12-13 00:37:14,432 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:37:14,433 INFO L158 Benchmark]: Toolchain (without parser) took 22650.19ms. Allocated memory was 192.9MB in the beginning and 544.2MB in the end (delta: 351.3MB). Free memory was 166.8MB in the beginning and 179.8MB in the end (delta: -13.0MB). Peak memory consumption was 339.0MB. Max. memory is 8.0GB. [2022-12-13 00:37:14,433 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 192.9MB. Free memory is still 169.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:37:14,433 INFO L158 Benchmark]: CACSL2BoogieTranslator took 555.30ms. Allocated memory is still 192.9MB. Free memory was 166.8MB in the beginning and 139.8MB in the end (delta: 27.0MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-13 00:37:14,433 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.16ms. Allocated memory is still 192.9MB. Free memory was 139.8MB in the beginning and 136.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 00:37:14,434 INFO L158 Benchmark]: Boogie Preprocessor took 53.80ms. Allocated memory is still 192.9MB. Free memory was 136.7MB in the beginning and 134.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:37:14,434 INFO L158 Benchmark]: RCFGBuilder took 646.50ms. Allocated memory is still 192.9MB. Free memory was 134.6MB in the beginning and 99.4MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-13 00:37:14,434 INFO L158 Benchmark]: TraceAbstraction took 21300.98ms. Allocated memory was 192.9MB in the beginning and 544.2MB in the end (delta: 351.3MB). Free memory was 98.4MB in the beginning and 179.8MB in the end (delta: -81.4MB). Peak memory consumption was 270.9MB. Max. memory is 8.0GB. [2022-12-13 00:37:14,435 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.13ms. Allocated memory is still 192.9MB. Free memory is still 169.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 555.30ms. Allocated memory is still 192.9MB. Free memory was 166.8MB in the beginning and 139.8MB in the end (delta: 27.0MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 76.16ms. Allocated memory is still 192.9MB. Free memory was 139.8MB in the beginning and 136.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.80ms. Allocated memory is still 192.9MB. Free memory was 136.7MB in the beginning and 134.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 646.50ms. Allocated memory is still 192.9MB. Free memory was 134.6MB in the beginning and 99.4MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 21300.98ms. Allocated memory was 192.9MB in the beginning and 544.2MB in the end (delta: 351.3MB). Free memory was 98.4MB in the beginning and 179.8MB in the end (delta: -81.4MB). Peak memory consumption was 270.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 113 PlacesBefore, 64 PlacesAfterwards, 105 TransitionsBefore, 55 TransitionsAfterwards, 1758 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 39 TrivialYvCompositions, 42 ConcurrentYvCompositions, 4 ChoiceCompositions, 86 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3157, independent: 3040, independent conditional: 3040, independent unconditional: 0, dependent: 117, dependent conditional: 117, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3157, independent: 3040, independent conditional: 0, independent unconditional: 3040, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3157, independent: 3040, independent conditional: 0, independent unconditional: 3040, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3157, independent: 3040, independent conditional: 0, independent unconditional: 3040, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1759, independent: 1713, independent conditional: 0, independent unconditional: 1713, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1759, independent: 1689, independent conditional: 0, independent unconditional: 1689, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 70, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 262, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 214, dependent conditional: 0, dependent unconditional: 214, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3157, independent: 1327, independent conditional: 0, independent unconditional: 1327, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 1759, unknown conditional: 0, unknown unconditional: 1759] , Statistics on independence cache: Total cache size (in pairs): 3359, Positive cache size: 3313, Positive conditional cache size: 0, Positive unconditional cache size: 3313, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46, 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.2s, 40 PlacesBefore, 40 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 536 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 305, independent: 271, independent conditional: 271, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 305, independent: 271, independent conditional: 15, independent unconditional: 256, dependent: 34, dependent conditional: 5, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 305, independent: 271, independent conditional: 15, independent unconditional: 256, dependent: 34, dependent conditional: 5, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 305, independent: 271, independent conditional: 15, independent unconditional: 256, dependent: 34, dependent conditional: 5, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 234, independent: 211, independent conditional: 12, independent unconditional: 199, dependent: 23, dependent conditional: 2, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 234, independent: 174, independent conditional: 0, independent unconditional: 174, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 60, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 23, dependent conditional: 2, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 173, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 141, dependent conditional: 44, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 305, independent: 60, independent conditional: 3, independent unconditional: 57, dependent: 11, dependent conditional: 3, dependent unconditional: 8, unknown: 234, unknown conditional: 14, unknown unconditional: 220] , Statistics on independence cache: Total cache size (in pairs): 234, Positive cache size: 211, Positive conditional cache size: 12, Positive unconditional cache size: 199, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 580 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 169, independent: 156, independent conditional: 156, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 169, independent: 156, independent conditional: 17, independent unconditional: 139, dependent: 13, dependent conditional: 7, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 169, independent: 156, independent conditional: 0, independent unconditional: 156, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 169, independent: 156, independent conditional: 0, independent unconditional: 156, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 10, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 169, independent: 147, independent conditional: 0, independent unconditional: 147, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 244, Positive cache size: 220, Positive conditional cache size: 12, Positive unconditional cache size: 208, Negative cache size: 24, Negative conditional cache size: 2, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 612 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 195, independent: 180, independent conditional: 180, 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: 195, independent: 180, independent conditional: 15, independent unconditional: 165, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 195, independent: 180, independent conditional: 0, independent unconditional: 180, 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: 195, independent: 180, independent conditional: 0, independent unconditional: 180, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 195, independent: 175, independent conditional: 0, independent unconditional: 175, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 249, Positive cache size: 225, Positive conditional cache size: 12, Positive unconditional cache size: 213, Negative cache size: 24, Negative conditional cache size: 2, Negative unconditional cache size: 22, 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.0s, 49 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 662 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 233, independent: 216, independent conditional: 216, 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: 233, independent: 216, independent conditional: 41, independent unconditional: 175, dependent: 17, dependent conditional: 4, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 237, independent: 216, independent conditional: 0, independent unconditional: 216, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 237, independent: 216, independent conditional: 0, independent unconditional: 216, dependent: 21, dependent conditional: 0, dependent unconditional: 21, 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: 237, independent: 216, independent conditional: 0, independent unconditional: 216, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 249, Positive cache size: 225, Positive conditional cache size: 12, Positive unconditional cache size: 213, Negative cache size: 24, Negative conditional cache size: 2, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 49, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 54 PlacesBefore, 54 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 846 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 419, independent: 389, independent conditional: 389, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 419, independent: 389, independent conditional: 140, independent unconditional: 249, dependent: 30, dependent conditional: 2, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 419, independent: 389, independent conditional: 84, independent unconditional: 305, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 419, independent: 389, independent conditional: 84, independent unconditional: 305, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 419, independent: 381, independent conditional: 84, independent unconditional: 297, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 263, Positive cache size: 239, Positive conditional cache size: 12, Positive unconditional cache size: 227, Negative cache size: 24, Negative conditional cache size: 2, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 58, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 740 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 122, independent: 109, independent conditional: 109, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 122, independent: 109, independent conditional: 43, independent unconditional: 66, dependent: 13, dependent conditional: 1, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 122, independent: 109, independent conditional: 27, independent unconditional: 82, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 122, independent: 109, independent conditional: 27, independent unconditional: 82, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 122, independent: 108, independent conditional: 27, independent unconditional: 81, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 265, Positive cache size: 240, Positive conditional cache size: 12, Positive unconditional cache size: 228, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 59 PlacesBefore, 59 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 744 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 385, independent: 347, independent conditional: 347, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 385, independent: 347, independent conditional: 197, independent unconditional: 150, dependent: 38, dependent conditional: 2, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 387, independent: 347, independent conditional: 150, independent unconditional: 197, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 387, independent: 347, independent conditional: 150, independent unconditional: 197, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 387, independent: 346, independent conditional: 149, independent unconditional: 197, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 272, Positive cache size: 247, Positive conditional cache size: 13, Positive unconditional cache size: 234, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 51, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 59 PlacesBefore, 56 PlacesAfterwards, 53 TransitionsBefore, 47 TransitionsAfterwards, 470 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 357, independent: 323, independent conditional: 323, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 357, independent: 323, independent conditional: 223, independent unconditional: 100, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 357, independent: 323, independent conditional: 165, independent unconditional: 158, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 357, independent: 323, independent conditional: 165, independent unconditional: 158, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 39, independent: 39, independent conditional: 36, independent unconditional: 3, 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: 39, independent: 39, independent conditional: 0, independent unconditional: 39, 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: 357, independent: 284, independent conditional: 129, independent unconditional: 155, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 39, unknown conditional: 36, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 340, Positive cache size: 315, Positive conditional cache size: 49, Positive unconditional cache size: 266, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 58, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 430 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 144, independent: 128, independent conditional: 128, 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: 144, independent: 128, independent conditional: 80, independent unconditional: 48, dependent: 16, dependent conditional: 12, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 144, independent: 128, independent conditional: 48, independent unconditional: 80, 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: 144, independent: 128, independent conditional: 48, independent unconditional: 80, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 144, independent: 125, independent conditional: 48, independent unconditional: 77, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 343, Positive cache size: 318, Positive conditional cache size: 49, Positive unconditional cache size: 269, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 44, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 56 PlacesBefore, 53 PlacesAfterwards, 40 TransitionsBefore, 37 TransitionsAfterwards, 156 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 213, independent: 175, independent conditional: 175, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 213, independent: 175, independent conditional: 130, independent unconditional: 45, dependent: 38, dependent conditional: 29, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 329, independent: 175, independent conditional: 63, independent unconditional: 112, dependent: 154, dependent conditional: 0, dependent unconditional: 154, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 329, independent: 175, independent conditional: 63, independent unconditional: 112, dependent: 154, dependent conditional: 0, dependent unconditional: 154, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 329, independent: 173, independent conditional: 63, independent unconditional: 110, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 400, Positive cache size: 373, Positive conditional cache size: 50, Positive unconditional cache size: 323, Negative cache size: 27, Negative conditional cache size: 2, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 212, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 41 PlacesBefore, 38 PlacesAfterwards, 35 TransitionsBefore, 33 TransitionsAfterwards, 62 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 109, independent: 109, independent conditional: 109, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 109, independent: 109, independent conditional: 109, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 109, independent: 109, independent conditional: 90, independent unconditional: 19, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 109, independent: 109, independent conditional: 90, independent unconditional: 19, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 3, independent unconditional: 3, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 109, independent: 103, independent conditional: 87, independent unconditional: 16, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 3, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 519, Positive cache size: 492, Positive conditional cache size: 53, Positive unconditional cache size: 439, Negative cache size: 27, Negative conditional cache size: 2, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 19, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L841] 0 pthread_t t500; [L842] FCALL, FORK 0 pthread_create(&t500, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t500, ((void *)0), P0, ((void *)0))=-2, t500={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L843] 0 pthread_t t501; [L844] FCALL, FORK 0 pthread_create(&t501, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t501, ((void *)0), P1, ((void *)0))=-1, t500={5:0}, t501={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] 0 pthread_t t502; [L846] FCALL, FORK 0 pthread_create(&t502, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t502, ((void *)0), P2, ((void *)0))=0, t500={5:0}, t501={6:0}, t502={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 y$w_buff1 = y$w_buff0 [L789] 3 y$w_buff0 = 1 [L790] 3 y$w_buff1_used = y$w_buff0_used [L791] 3 y$w_buff0_used = (_Bool)1 [L792] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L792] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L793] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L794] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L795] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L796] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L797] 3 y$r_buff0_thd3 = (_Bool)1 [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 y$flush_delayed = weak$$choice2 [L803] 3 y$mem_tmp = y [L804] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L805] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L806] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L807] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L808] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L810] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EAX = y [L812] 3 y = y$flush_delayed ? y$mem_tmp : y [L813] 3 y$flush_delayed = (_Bool)0 [L816] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L745] 1 z = 1 [L748] 1 x = 1 [L760] 1 x = 2 [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 y$flush_delayed = weak$$choice2 [L766] 1 y$mem_tmp = y [L767] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L768] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L769] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L770] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L771] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L773] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 1 __unbuffered_p1_EAX = y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L820] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L821] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L822] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L823] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L848] 3 main$tmp_guard0 = __unbuffered_cnt == 3 [L850] CALL 3 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 3 !(!cond) [L850] RET 3 assume_abort_if_not(main$tmp_guard0) [L852] 3 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L853] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L854] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L855] 3 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L856] 3 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L859] 3 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L861] CALL 3 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 3 !expression [L18] 3 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 21.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 446 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 446 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 873 IncrementalHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 14 mSDtfsCounter, 873 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=409occurred in iteration=8, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 152 NumberOfCodeBlocks, 152 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 724 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 00:37:14,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...