/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi010.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:31:06,801 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:31:06,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:31:06,833 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:31:06,835 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:31:06,836 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:31:06,837 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:31:06,838 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:31:06,839 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:31:06,840 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:31:06,841 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:31:06,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:31:06,842 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:31:06,842 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:31:06,843 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:31:06,870 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:31:06,871 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:31:06,874 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:31:06,877 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:31:06,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:31:06,886 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:31:06,887 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:31:06,888 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:31:06,889 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:31:06,893 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:31:06,894 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:31:06,894 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:31:06,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:31:06,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:31:06,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:31:06,896 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:31:06,901 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:31:06,902 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:31:06,903 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:31:06,903 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:31:06,903 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:31:06,904 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:31:06,904 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:31:06,904 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:31:06,904 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:31:06,905 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:31:06,908 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 09:31:06,932 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:31:06,933 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:31:06,935 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:31:06,935 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:31:06,935 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:31:06,936 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:31:06,936 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:31:06,936 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:31:06,936 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:31:06,936 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:31:06,937 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:31:06,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:31:06,937 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:31:06,937 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:31:06,937 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:31:06,937 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:31:06,937 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:31:06,937 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:31:06,938 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:31:06,938 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:31:06,938 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:31:06,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:31:06,938 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:31:06,938 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:31:06,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:31:06,938 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:31:06,938 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:31:06,939 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:31:06,939 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:31:06,939 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 09:31:07,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:31:07,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:31:07,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:31:07,210 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:31:07,211 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:31:07,212 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi010.i [2022-12-13 09:31:08,196 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:31:08,422 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:31:08,423 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi010.i [2022-12-13 09:31:08,438 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b84f981b7/f54debce692246d5b786551d70ea89ab/FLAG8d1cdace4 [2022-12-13 09:31:08,448 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b84f981b7/f54debce692246d5b786551d70ea89ab [2022-12-13 09:31:08,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:31:08,450 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:31:08,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:31:08,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:31:08,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:31:08,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:31:08" (1/1) ... [2022-12-13 09:31:08,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23818b05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:08, skipping insertion in model container [2022-12-13 09:31:08,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:31:08" (1/1) ... [2022-12-13 09:31:08,459 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:31:08,504 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:31:08,608 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/rfi010.i[983,996] [2022-12-13 09:31:08,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:08,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:08,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:08,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:08,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:08,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:08,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:08,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:08,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:08,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:08,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:08,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:08,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:08,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:08,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:08,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:08,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:08,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:08,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:08,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:08,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:08,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:08,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:08,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:08,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:08,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:08,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:31:08,784 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:31:08,793 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/rfi010.i[983,996] [2022-12-13 09:31:08,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:08,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:08,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:08,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:08,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:08,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:08,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:08,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:08,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:08,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:08,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:08,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:08,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:08,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:08,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:08,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:08,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:08,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:08,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:08,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:08,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:08,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:08,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:08,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:08,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:08,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:08,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:31:08,860 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:31:08,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:08 WrapperNode [2022-12-13 09:31:08,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:31:08,862 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:31:08,862 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:31:08,863 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:31:08,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:08" (1/1) ... [2022-12-13 09:31:08,892 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:08" (1/1) ... [2022-12-13 09:31:08,911 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2022-12-13 09:31:08,912 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:31:08,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:31:08,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:31:08,912 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:31:08,918 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:08" (1/1) ... [2022-12-13 09:31:08,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:08" (1/1) ... [2022-12-13 09:31:08,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:08" (1/1) ... [2022-12-13 09:31:08,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:08" (1/1) ... [2022-12-13 09:31:08,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:08" (1/1) ... [2022-12-13 09:31:08,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:08" (1/1) ... [2022-12-13 09:31:08,932 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:08" (1/1) ... [2022-12-13 09:31:08,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:08" (1/1) ... [2022-12-13 09:31:08,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:31:08,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:31:08,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:31:08,936 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:31:08,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:08" (1/1) ... [2022-12-13 09:31:08,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:31:08,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:31:08,959 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 09:31:08,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 09:31:08,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:31:08,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:31:08,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:31:08,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:31:08,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:31:08,994 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:31:08,994 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:31:08,994 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:31:08,994 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:31:08,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:31:08,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:31:08,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:31:08,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:31:08,996 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 09:31:09,124 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:31:09,126 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:31:09,395 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:31:09,514 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:31:09,514 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:31:09,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:31:09 BoogieIcfgContainer [2022-12-13 09:31:09,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:31:09,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:31:09,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:31:09,521 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:31:09,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:31:08" (1/3) ... [2022-12-13 09:31:09,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1e664d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:31:09, skipping insertion in model container [2022-12-13 09:31:09,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:08" (2/3) ... [2022-12-13 09:31:09,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1e664d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:31:09, skipping insertion in model container [2022-12-13 09:31:09,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:31:09" (3/3) ... [2022-12-13 09:31:09,525 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi010.i [2022-12-13 09:31:09,538 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:31:09,538 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 09:31:09,539 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:31:09,577 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:31:09,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 188 flow [2022-12-13 09:31:09,650 INFO L130 PetriNetUnfolder]: 2/87 cut-off events. [2022-12-13 09:31:09,650 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:31:09,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-13 09:31:09,653 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 89 transitions, 188 flow [2022-12-13 09:31:09,656 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 87 transitions, 180 flow [2022-12-13 09:31:09,658 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:09,669 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 87 transitions, 180 flow [2022-12-13 09:31:09,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 87 transitions, 180 flow [2022-12-13 09:31:09,687 INFO L130 PetriNetUnfolder]: 2/87 cut-off events. [2022-12-13 09:31:09,688 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:31:09,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-13 09:31:09,691 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 87 transitions, 180 flow [2022-12-13 09:31:09,691 INFO L226 LiptonReduction]: Number of co-enabled transitions 1002 [2022-12-13 09:31:13,051 INFO L241 LiptonReduction]: Total number of compositions: 73 [2022-12-13 09:31:13,062 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:31:13,066 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;@56833e81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:31:13,067 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 09:31:13,069 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2022-12-13 09:31:13,070 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:31:13,070 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:13,070 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 09:31:13,070 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:31:13,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:13,074 INFO L85 PathProgramCache]: Analyzing trace with hash 419834465, now seen corresponding path program 1 times [2022-12-13 09:31:13,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:13,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802375600] [2022-12-13 09:31:13,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:13,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:13,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:13,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:13,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802375600] [2022-12-13 09:31:13,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802375600] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:13,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:13,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:31:13,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671163178] [2022-12-13 09:31:13,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:13,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:31:13,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:13,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:31:13,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:31:13,385 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2022-12-13 09:31:13,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:13,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:13,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2022-12-13 09:31:13,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:13,675 INFO L130 PetriNetUnfolder]: 1106/2050 cut-off events. [2022-12-13 09:31:13,675 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 09:31:13,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3873 conditions, 2050 events. 1106/2050 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 12949 event pairs, 96 based on Foata normal form. 0/1225 useless extension candidates. Maximal degree in co-relation 3863. Up to 1586 conditions per place. [2022-12-13 09:31:13,691 INFO L137 encePairwiseOnDemand]: 40/45 looper letters, 21 selfloop transitions, 2 changer transitions 38/68 dead transitions. [2022-12-13 09:31:13,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 68 transitions, 264 flow [2022-12-13 09:31:13,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:13,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:31:13,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-12-13 09:31:13,700 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2022-12-13 09:31:13,702 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 96 flow. Second operand 3 states and 87 transitions. [2022-12-13 09:31:13,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 68 transitions, 264 flow [2022-12-13 09:31:13,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 68 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:31:13,705 INFO L231 Difference]: Finished difference. Result has 49 places, 23 transitions, 54 flow [2022-12-13 09:31:13,707 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=49, PETRI_TRANSITIONS=23} [2022-12-13 09:31:13,710 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2022-12-13 09:31:13,710 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:13,711 INFO L89 Accepts]: Start accepts. Operand has 49 places, 23 transitions, 54 flow [2022-12-13 09:31:13,712 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:13,713 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:13,713 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 23 transitions, 54 flow [2022-12-13 09:31:13,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 23 transitions, 54 flow [2022-12-13 09:31:13,717 INFO L130 PetriNetUnfolder]: 0/23 cut-off events. [2022-12-13 09:31:13,717 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:31:13,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 45 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 09:31:13,719 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 23 transitions, 54 flow [2022-12-13 09:31:13,720 INFO L226 LiptonReduction]: Number of co-enabled transitions 260 [2022-12-13 09:31:13,863 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:31:13,865 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 155 [2022-12-13 09:31:13,865 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 23 transitions, 54 flow [2022-12-13 09:31:13,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:13,865 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:13,865 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:13,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:31:13,866 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:31:13,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:13,866 INFO L85 PathProgramCache]: Analyzing trace with hash -265951295, now seen corresponding path program 1 times [2022-12-13 09:31:13,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:13,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669554716] [2022-12-13 09:31:13,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:13,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:13,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:14,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:14,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:14,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669554716] [2022-12-13 09:31:14,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669554716] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:14,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:14,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:31:14,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281558241] [2022-12-13 09:31:14,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:14,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:31:14,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:14,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:31:14,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:31:14,024 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2022-12-13 09:31:14,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:14,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:14,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2022-12-13 09:31:14,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:14,092 INFO L130 PetriNetUnfolder]: 256/473 cut-off events. [2022-12-13 09:31:14,093 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-13 09:31:14,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 950 conditions, 473 events. 256/473 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1987 event pairs, 92 based on Foata normal form. 0/380 useless extension candidates. Maximal degree in co-relation 940. Up to 403 conditions per place. [2022-12-13 09:31:14,096 INFO L137 encePairwiseOnDemand]: 19/23 looper letters, 22 selfloop transitions, 3 changer transitions 2/32 dead transitions. [2022-12-13 09:31:14,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 32 transitions, 130 flow [2022-12-13 09:31:14,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:14,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:31:14,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-13 09:31:14,098 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6231884057971014 [2022-12-13 09:31:14,098 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 54 flow. Second operand 3 states and 43 transitions. [2022-12-13 09:31:14,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 32 transitions, 130 flow [2022-12-13 09:31:14,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 32 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:31:14,099 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 67 flow [2022-12-13 09:31:14,099 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2022-12-13 09:31:14,100 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -20 predicate places. [2022-12-13 09:31:14,100 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:14,100 INFO L89 Accepts]: Start accepts. Operand has 31 places, 24 transitions, 67 flow [2022-12-13 09:31:14,100 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:14,100 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:14,100 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 24 transitions, 67 flow [2022-12-13 09:31:14,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 24 transitions, 67 flow [2022-12-13 09:31:14,108 INFO L130 PetriNetUnfolder]: 3/38 cut-off events. [2022-12-13 09:31:14,108 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:31:14,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 38 events. 3/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 95 event pairs, 1 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 49. Up to 10 conditions per place. [2022-12-13 09:31:14,109 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 24 transitions, 67 flow [2022-12-13 09:31:14,109 INFO L226 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-13 09:31:14,140 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:31:14,141 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-13 09:31:14,142 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 67 flow [2022-12-13 09:31:14,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:14,142 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:14,142 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:14,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:31:14,143 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:31:14,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:14,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1360456926, now seen corresponding path program 1 times [2022-12-13 09:31:14,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:14,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688471586] [2022-12-13 09:31:14,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:14,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:14,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:14,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:14,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688471586] [2022-12-13 09:31:14,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688471586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:14,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:14,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:31:14,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980135176] [2022-12-13 09:31:14,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:14,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:31:14,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:14,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:31:14,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:31:14,300 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2022-12-13 09:31:14,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 67 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:14,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:14,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2022-12-13 09:31:14,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:14,363 INFO L130 PetriNetUnfolder]: 188/352 cut-off events. [2022-12-13 09:31:14,364 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2022-12-13 09:31:14,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 780 conditions, 352 events. 188/352 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1333 event pairs, 58 based on Foata normal form. 6/310 useless extension candidates. Maximal degree in co-relation 769. Up to 251 conditions per place. [2022-12-13 09:31:14,392 INFO L137 encePairwiseOnDemand]: 19/22 looper letters, 21 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2022-12-13 09:31:14,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 125 flow [2022-12-13 09:31:14,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:14,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:31:14,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-13 09:31:14,398 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2022-12-13 09:31:14,398 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 67 flow. Second operand 3 states and 39 transitions. [2022-12-13 09:31:14,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 125 flow [2022-12-13 09:31:14,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 122 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:31:14,400 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 75 flow [2022-12-13 09:31:14,400 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2022-12-13 09:31:14,401 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -19 predicate places. [2022-12-13 09:31:14,401 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:14,401 INFO L89 Accepts]: Start accepts. Operand has 32 places, 24 transitions, 75 flow [2022-12-13 09:31:14,401 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:14,401 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:14,402 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 24 transitions, 75 flow [2022-12-13 09:31:14,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 24 transitions, 75 flow [2022-12-13 09:31:14,408 INFO L130 PetriNetUnfolder]: 2/31 cut-off events. [2022-12-13 09:31:14,408 INFO L131 PetriNetUnfolder]: For 3/4 co-relation queries the response was YES. [2022-12-13 09:31:14,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 31 events. 2/31 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 80 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 44. Up to 8 conditions per place. [2022-12-13 09:31:14,409 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 24 transitions, 75 flow [2022-12-13 09:31:14,409 INFO L226 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-13 09:31:14,439 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:31:14,443 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-13 09:31:14,443 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 75 flow [2022-12-13 09:31:14,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:14,443 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:14,443 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:14,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:31:14,444 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:31:14,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:14,444 INFO L85 PathProgramCache]: Analyzing trace with hash 2080253662, now seen corresponding path program 1 times [2022-12-13 09:31:14,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:14,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479587061] [2022-12-13 09:31:14,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:14,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:14,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:14,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:14,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479587061] [2022-12-13 09:31:14,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479587061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:14,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:14,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:31:14,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320536676] [2022-12-13 09:31:14,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:14,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:31:14,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:14,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:31:14,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:31:14,627 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 22 [2022-12-13 09:31:14,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:14,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:14,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 22 [2022-12-13 09:31:14,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:14,736 INFO L130 PetriNetUnfolder]: 174/363 cut-off events. [2022-12-13 09:31:14,736 INFO L131 PetriNetUnfolder]: For 109/109 co-relation queries the response was YES. [2022-12-13 09:31:14,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 866 conditions, 363 events. 174/363 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1631 event pairs, 35 based on Foata normal form. 42/311 useless extension candidates. Maximal degree in co-relation 853. Up to 244 conditions per place. [2022-12-13 09:31:14,738 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 26 selfloop transitions, 7 changer transitions 25/62 dead transitions. [2022-12-13 09:31:14,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 62 transitions, 297 flow [2022-12-13 09:31:14,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:31:14,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:31:14,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-12-13 09:31:14,739 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6909090909090909 [2022-12-13 09:31:14,739 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 75 flow. Second operand 5 states and 76 transitions. [2022-12-13 09:31:14,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 62 transitions, 297 flow [2022-12-13 09:31:14,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 62 transitions, 283 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:31:14,741 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 132 flow [2022-12-13 09:31:14,741 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2022-12-13 09:31:14,742 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -14 predicate places. [2022-12-13 09:31:14,742 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:14,742 INFO L89 Accepts]: Start accepts. Operand has 37 places, 30 transitions, 132 flow [2022-12-13 09:31:14,743 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:14,743 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:14,743 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 132 flow [2022-12-13 09:31:14,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 30 transitions, 132 flow [2022-12-13 09:31:14,752 INFO L130 PetriNetUnfolder]: 49/137 cut-off events. [2022-12-13 09:31:14,752 INFO L131 PetriNetUnfolder]: For 54/72 co-relation queries the response was YES. [2022-12-13 09:31:14,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 137 events. 49/137 cut-off events. For 54/72 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 642 event pairs, 18 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 362. Up to 82 conditions per place. [2022-12-13 09:31:14,753 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 30 transitions, 132 flow [2022-12-13 09:31:14,753 INFO L226 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-13 09:31:14,754 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:31:14,755 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 09:31:14,755 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 132 flow [2022-12-13 09:31:14,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:14,755 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:14,755 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:14,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:31:14,756 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:31:14,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:14,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1189835218, now seen corresponding path program 1 times [2022-12-13 09:31:14,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:14,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921096092] [2022-12-13 09:31:14,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:14,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:14,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:14,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:14,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921096092] [2022-12-13 09:31:14,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921096092] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:14,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:14,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:31:14,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839618449] [2022-12-13 09:31:14,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:14,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:31:14,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:14,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:31:14,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:31:14,923 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 22 [2022-12-13 09:31:14,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:14,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:14,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 22 [2022-12-13 09:31:14,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:15,011 INFO L130 PetriNetUnfolder]: 64/184 cut-off events. [2022-12-13 09:31:15,012 INFO L131 PetriNetUnfolder]: For 78/78 co-relation queries the response was YES. [2022-12-13 09:31:15,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 606 conditions, 184 events. 64/184 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 763 event pairs, 8 based on Foata normal form. 30/170 useless extension candidates. Maximal degree in co-relation 590. Up to 94 conditions per place. [2022-12-13 09:31:15,013 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 20 selfloop transitions, 13 changer transitions 13/49 dead transitions. [2022-12-13 09:31:15,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 298 flow [2022-12-13 09:31:15,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:15,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:31:15,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-12-13 09:31:15,014 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2022-12-13 09:31:15,014 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 132 flow. Second operand 6 states and 69 transitions. [2022-12-13 09:31:15,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 49 transitions, 298 flow [2022-12-13 09:31:15,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 256 flow, removed 15 selfloop flow, removed 3 redundant places. [2022-12-13 09:31:15,016 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 146 flow [2022-12-13 09:31:15,016 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2022-12-13 09:31:15,017 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2022-12-13 09:31:15,017 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:15,017 INFO L89 Accepts]: Start accepts. Operand has 40 places, 29 transitions, 146 flow [2022-12-13 09:31:15,017 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:15,018 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:15,018 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 29 transitions, 146 flow [2022-12-13 09:31:15,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 29 transitions, 146 flow [2022-12-13 09:31:15,024 INFO L130 PetriNetUnfolder]: 10/70 cut-off events. [2022-12-13 09:31:15,024 INFO L131 PetriNetUnfolder]: For 39/45 co-relation queries the response was YES. [2022-12-13 09:31:15,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 70 events. 10/70 cut-off events. For 39/45 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 245 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 191. Up to 37 conditions per place. [2022-12-13 09:31:15,024 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 29 transitions, 146 flow [2022-12-13 09:31:15,025 INFO L226 LiptonReduction]: Number of co-enabled transitions 122 [2022-12-13 09:31:15,381 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:31:15,381 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 364 [2022-12-13 09:31:15,382 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 142 flow [2022-12-13 09:31:15,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:15,382 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:15,382 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:15,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:31:15,382 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:31:15,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:15,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1765905186, now seen corresponding path program 1 times [2022-12-13 09:31:15,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:15,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101774117] [2022-12-13 09:31:15,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:15,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:15,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:15,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:15,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101774117] [2022-12-13 09:31:15,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101774117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:15,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:15,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:31:15,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327509349] [2022-12-13 09:31:15,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:15,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:31:15,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:15,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:31:15,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:31:15,531 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2022-12-13 09:31:15,531 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:15,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:15,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2022-12-13 09:31:15,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:15,588 INFO L130 PetriNetUnfolder]: 50/142 cut-off events. [2022-12-13 09:31:15,588 INFO L131 PetriNetUnfolder]: For 248/255 co-relation queries the response was YES. [2022-12-13 09:31:15,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 142 events. 50/142 cut-off events. For 248/255 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 566 event pairs, 2 based on Foata normal form. 16/132 useless extension candidates. Maximal degree in co-relation 512. Up to 83 conditions per place. [2022-12-13 09:31:15,589 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 25 selfloop transitions, 7 changer transitions 12/49 dead transitions. [2022-12-13 09:31:15,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 330 flow [2022-12-13 09:31:15,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:31:15,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:31:15,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-13 09:31:15,590 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2022-12-13 09:31:15,590 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 142 flow. Second operand 5 states and 55 transitions. [2022-12-13 09:31:15,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 330 flow [2022-12-13 09:31:15,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 49 transitions, 280 flow, removed 13 selfloop flow, removed 5 redundant places. [2022-12-13 09:31:15,592 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 140 flow [2022-12-13 09:31:15,592 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=140, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2022-12-13 09:31:15,592 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -15 predicate places. [2022-12-13 09:31:15,593 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:15,593 INFO L89 Accepts]: Start accepts. Operand has 36 places, 28 transitions, 140 flow [2022-12-13 09:31:15,593 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:15,593 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:15,593 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 28 transitions, 140 flow [2022-12-13 09:31:15,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 28 transitions, 140 flow [2022-12-13 09:31:15,600 INFO L130 PetriNetUnfolder]: 20/80 cut-off events. [2022-12-13 09:31:15,600 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 09:31:15,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 80 events. 20/80 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 315 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 193. Up to 46 conditions per place. [2022-12-13 09:31:15,601 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 28 transitions, 140 flow [2022-12-13 09:31:15,601 INFO L226 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-13 09:31:16,580 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 09:31:16,583 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 990 [2022-12-13 09:31:16,583 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 142 flow [2022-12-13 09:31:16,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:16,583 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:16,584 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:16,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:31:16,584 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:31:16,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:16,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1484750278, now seen corresponding path program 1 times [2022-12-13 09:31:16,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:16,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697873721] [2022-12-13 09:31:16,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:16,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:16,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:16,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:16,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697873721] [2022-12-13 09:31:16,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697873721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:16,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:16,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:31:16,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166119768] [2022-12-13 09:31:16,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:16,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:31:16,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:16,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:31:16,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:31:16,718 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2022-12-13 09:31:16,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:16,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:16,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2022-12-13 09:31:16,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:16,772 INFO L130 PetriNetUnfolder]: 47/140 cut-off events. [2022-12-13 09:31:16,772 INFO L131 PetriNetUnfolder]: For 163/167 co-relation queries the response was YES. [2022-12-13 09:31:16,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 140 events. 47/140 cut-off events. For 163/167 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 663 event pairs, 7 based on Foata normal form. 12/121 useless extension candidates. Maximal degree in co-relation 448. Up to 64 conditions per place. [2022-12-13 09:31:16,773 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 19 selfloop transitions, 1 changer transitions 16/41 dead transitions. [2022-12-13 09:31:16,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 41 transitions, 276 flow [2022-12-13 09:31:16,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:31:16,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:31:16,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-13 09:31:16,774 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-13 09:31:16,774 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 142 flow. Second operand 4 states and 40 transitions. [2022-12-13 09:31:16,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 41 transitions, 276 flow [2022-12-13 09:31:16,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 265 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 09:31:16,776 INFO L231 Difference]: Finished difference. Result has 36 places, 22 transitions, 108 flow [2022-12-13 09:31:16,776 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=36, PETRI_TRANSITIONS=22} [2022-12-13 09:31:16,776 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -15 predicate places. [2022-12-13 09:31:16,776 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:16,776 INFO L89 Accepts]: Start accepts. Operand has 36 places, 22 transitions, 108 flow [2022-12-13 09:31:16,777 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:16,777 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:16,777 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 22 transitions, 108 flow [2022-12-13 09:31:16,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 22 transitions, 108 flow [2022-12-13 09:31:16,781 INFO L130 PetriNetUnfolder]: 9/42 cut-off events. [2022-12-13 09:31:16,782 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2022-12-13 09:31:16,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 42 events. 9/42 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 125 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 114. Up to 28 conditions per place. [2022-12-13 09:31:16,782 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 108 flow [2022-12-13 09:31:16,782 INFO L226 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-13 09:31:17,124 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:31:17,125 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 349 [2022-12-13 09:31:17,125 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 106 flow [2022-12-13 09:31:17,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:17,125 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:17,126 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:17,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:31:17,126 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:31:17,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:17,126 INFO L85 PathProgramCache]: Analyzing trace with hash -2020051367, now seen corresponding path program 1 times [2022-12-13 09:31:17,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:17,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499136197] [2022-12-13 09:31:17,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:17,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:17,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:17,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:17,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499136197] [2022-12-13 09:31:17,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499136197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:17,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:17,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:31:17,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461229791] [2022-12-13 09:31:17,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:17,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:31:17,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:17,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:31:17,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:31:17,807 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 15 [2022-12-13 09:31:17,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 106 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:17,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:17,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 15 [2022-12-13 09:31:17,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:17,893 INFO L130 PetriNetUnfolder]: 22/75 cut-off events. [2022-12-13 09:31:17,893 INFO L131 PetriNetUnfolder]: For 181/185 co-relation queries the response was YES. [2022-12-13 09:31:17,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 75 events. 22/75 cut-off events. For 181/185 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 287 event pairs, 2 based on Foata normal form. 13/70 useless extension candidates. Maximal degree in co-relation 253. Up to 46 conditions per place. [2022-12-13 09:31:17,894 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 13 selfloop transitions, 3 changer transitions 12/33 dead transitions. [2022-12-13 09:31:17,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 226 flow [2022-12-13 09:31:17,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:17,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:31:17,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-12-13 09:31:17,895 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-13 09:31:17,895 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 106 flow. Second operand 6 states and 39 transitions. [2022-12-13 09:31:17,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 226 flow [2022-12-13 09:31:17,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 210 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-13 09:31:17,896 INFO L231 Difference]: Finished difference. Result has 35 places, 21 transitions, 107 flow [2022-12-13 09:31:17,897 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=107, PETRI_PLACES=35, PETRI_TRANSITIONS=21} [2022-12-13 09:31:17,897 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -16 predicate places. [2022-12-13 09:31:17,897 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:17,897 INFO L89 Accepts]: Start accepts. Operand has 35 places, 21 transitions, 107 flow [2022-12-13 09:31:17,897 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:17,897 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:17,898 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 21 transitions, 107 flow [2022-12-13 09:31:17,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 21 transitions, 107 flow [2022-12-13 09:31:17,902 INFO L130 PetriNetUnfolder]: 9/41 cut-off events. [2022-12-13 09:31:17,902 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2022-12-13 09:31:17,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 41 events. 9/41 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 153 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 114. Up to 28 conditions per place. [2022-12-13 09:31:17,903 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 21 transitions, 107 flow [2022-12-13 09:31:17,903 INFO L226 LiptonReduction]: Number of co-enabled transitions 36 [2022-12-13 09:31:19,149 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [430] $Ultimate##0-->L799: Formula: (let ((.cse1 (= (mod v_~y$w_buff0_used~0_458 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_161 256) 0)))) (and (= v_~y$flush_delayed~0_135 0) (= |v_P1Thread1of1ForFork0_#t~nondet5#1_70| v_~weak$$choice0~0_113) (= v_~__unbuffered_p1_EBX~0_80 v_~x~0_28) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_33| |v_P1Thread1of1ForFork0_~arg#1.offset_33|) (= v_~y$r_buff0_thd0~0_146 v_~y$r_buff1_thd0~0_159) (= v_~y$w_buff1~0_283 v_~y$w_buff0~0_317) (= v_~weak$$choice2~0_161 |v_P1Thread1of1ForFork0_#t~nondet6#1_70|) (= |v_P1Thread1of1ForFork0_~arg#1.base_33| |v_P1Thread1of1ForFork0_#in~arg#1.base_33|) (= v_~y~0_376 v_~y$mem_tmp~0_121) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_35| 0)) (= (ite (= (mod v_~y$w_buff0_used~0_459 256) 0) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_35|) (= v_~y$r_buff0_thd2~0_244 (ite .cse0 1 (ite .cse1 1 (ite (not .cse1) 0 1)))) (= (ite .cse0 v_~y$w_buff0_used~0_459 (ite .cse1 v_~y$w_buff0_used~0_459 0)) v_~y$w_buff1_used~0_421) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_35| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_35|) (= v_~y$r_buff1_thd2~0_213 (ite .cse0 v_~y$r_buff0_thd2~0_245 (ite (let ((.cse2 (= (mod v_~y$r_buff0_thd2~0_244 256) 0))) (or (and .cse2 (= (mod v_~y$w_buff1_used~0_421 256) 0)) (and .cse2 (= (mod v_~y$r_buff0_thd2~0_245 256) 0)) .cse1)) v_~y$r_buff0_thd2~0_245 0))) (= v_~__unbuffered_p1_EAX~0_104 v_~y$w_buff0~0_316) (= v_~y$r_buff0_thd1~0_176 v_~y$r_buff1_thd1~0_183) (= v_~y$w_buff0~0_316 1) (= (ite .cse0 v_~y$mem_tmp~0_121 v_~y$w_buff0~0_316) v_~y~0_375) (= v_~y$w_buff0_used~0_458 (ite .cse0 1 0)))) InVars {P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_33|, P1Thread1of1ForFork0_#t~nondet5#1=|v_P1Thread1of1ForFork0_#t~nondet5#1_70|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_459, ~y$w_buff0~0=v_~y$w_buff0~0_317, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_146, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_245, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_176, P1Thread1of1ForFork0_#t~nondet6#1=|v_P1Thread1of1ForFork0_#t~nondet6#1_70|, ~y~0=v_~y~0_376, ~x~0=v_~x~0_28, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_33|} OutVars{P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_33|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_458, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_35|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_33|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_183, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_33|, ~y$mem_tmp~0=v_~y$mem_tmp~0_121, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_104, ~y$w_buff0~0=v_~y$w_buff0~0_316, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_176, ~y$flush_delayed~0=v_~y$flush_delayed~0_135, ~y~0=v_~y~0_375, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_35|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_33|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_80, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_213, ~weak$$choice0~0=v_~weak$$choice0~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_283, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_146, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_244, ~weak$$choice2~0=v_~weak$$choice2~0_161, ~x~0=v_~x~0_28, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_159, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_421} AuxVars[] AssignedVars[P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork0_#t~nondet5#1, ~y$w_buff0_used~0, P1Thread1of1ForFork0_#t~nondet6#1, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [431] $Ultimate##0-->L760: Formula: (let ((.cse4 (= (mod v_~y$r_buff1_thd1~0_186 256) 0)) (.cse8 (= (mod v_~y$r_buff0_thd1~0_179 256) 0))) (let ((.cse9 (not .cse8)) (.cse12 (= (mod v_~y$w_buff0_used~0_463 256) 0)) (.cse6 (and (= (mod v_~y$w_buff1_used~0_424 256) 0) .cse8)) (.cse7 (and .cse4 .cse8))) (let ((.cse10 (or .cse12 .cse6 .cse7)) (.cse11 (and .cse9 (not .cse12)))) (let ((.cse2 (= (mod v_~y$w_buff1_used~0_423 256) 0)) (.cse5 (= (mod v_~y$w_buff0_used~0_462 256) 0)) (.cse1 (ite .cse10 v_~y~0_380 (ite .cse11 v_~y$w_buff0~0_321 v_~y$w_buff1~0_286))) (.cse0 (not (= (mod v_~weak$$choice2~0_163 256) 0)))) (and (= v_~x~0_30 1) (= v_~y$flush_delayed~0_137 0) (= v_~weak$$choice2~0_163 |v_P0Thread1of1ForFork1_#t~nondet4_96|) (= v_~y~0_380 v_~y$mem_tmp~0_123) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= v_~y~0_379 (ite .cse0 v_~y$mem_tmp~0_123 .cse1)) (= v_~y$r_buff1_thd1~0_185 (ite .cse0 v_~y$r_buff1_thd1~0_186 (ite (let ((.cse3 (= (mod v_~y$r_buff0_thd1~0_178 256) 0))) (or (and .cse2 .cse3) (and .cse4 .cse3) .cse5)) v_~y$r_buff1_thd1~0_186 0))) (= v_~y$w_buff1_used~0_423 (ite .cse0 v_~y$w_buff1_used~0_424 (ite (or .cse6 .cse7 .cse5) v_~y$w_buff1_used~0_424 0))) (= |v_P0Thread1of1ForFork1_#t~nondet3_96| v_~weak$$choice0~0_115) (= v_~y$w_buff1~0_286 v_~y$w_buff1~0_285) (= v_~y$r_buff0_thd1~0_178 (ite .cse0 v_~y$r_buff0_thd1~0_179 (ite (or .cse7 (and .cse2 .cse8) .cse5) v_~y$r_buff0_thd1~0_179 (ite (and .cse9 (not .cse5)) 0 v_~y$r_buff0_thd1~0_179)))) (= v_~y$w_buff0~0_321 v_~y$w_buff0~0_320) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15) (= .cse1 v_~__unbuffered_p0_EAX~0_125) (= v_~y$w_buff0_used~0_462 (ite .cse0 v_~y$w_buff0_used~0_463 (ite .cse10 v_~y$w_buff0_used~0_463 (ite .cse11 0 v_~y$w_buff0_used~0_463))))))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_186, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_463, ~y$w_buff1~0=v_~y$w_buff1~0_286, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, ~y$w_buff0~0=v_~y$w_buff0~0_321, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_179, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_96|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~y~0=v_~y~0_380, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_96|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_424} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_462, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_185, ~weak$$choice0~0=v_~weak$$choice0~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_123, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_125, ~y$w_buff1~0=v_~y$w_buff1~0_285, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, ~y$w_buff0~0=v_~y$w_buff0~0_320, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_178, ~y$flush_delayed~0=v_~y$flush_delayed~0_137, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, ~y~0=v_~y~0_379, ~weak$$choice2~0=v_~weak$$choice2~0_163, ~x~0=v_~x~0_30, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_423} AuxVars[] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork1_~arg.base, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_#t~nondet3, ~y~0, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4, ~y$w_buff1_used~0] [2022-12-13 09:31:19,563 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [430] $Ultimate##0-->L799: Formula: (let ((.cse1 (= (mod v_~y$w_buff0_used~0_458 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_161 256) 0)))) (and (= v_~y$flush_delayed~0_135 0) (= |v_P1Thread1of1ForFork0_#t~nondet5#1_70| v_~weak$$choice0~0_113) (= v_~__unbuffered_p1_EBX~0_80 v_~x~0_28) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_33| |v_P1Thread1of1ForFork0_~arg#1.offset_33|) (= v_~y$r_buff0_thd0~0_146 v_~y$r_buff1_thd0~0_159) (= v_~y$w_buff1~0_283 v_~y$w_buff0~0_317) (= v_~weak$$choice2~0_161 |v_P1Thread1of1ForFork0_#t~nondet6#1_70|) (= |v_P1Thread1of1ForFork0_~arg#1.base_33| |v_P1Thread1of1ForFork0_#in~arg#1.base_33|) (= v_~y~0_376 v_~y$mem_tmp~0_121) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_35| 0)) (= (ite (= (mod v_~y$w_buff0_used~0_459 256) 0) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_35|) (= v_~y$r_buff0_thd2~0_244 (ite .cse0 1 (ite .cse1 1 (ite (not .cse1) 0 1)))) (= (ite .cse0 v_~y$w_buff0_used~0_459 (ite .cse1 v_~y$w_buff0_used~0_459 0)) v_~y$w_buff1_used~0_421) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_35| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_35|) (= v_~y$r_buff1_thd2~0_213 (ite .cse0 v_~y$r_buff0_thd2~0_245 (ite (let ((.cse2 (= (mod v_~y$r_buff0_thd2~0_244 256) 0))) (or (and .cse2 (= (mod v_~y$w_buff1_used~0_421 256) 0)) (and .cse2 (= (mod v_~y$r_buff0_thd2~0_245 256) 0)) .cse1)) v_~y$r_buff0_thd2~0_245 0))) (= v_~__unbuffered_p1_EAX~0_104 v_~y$w_buff0~0_316) (= v_~y$r_buff0_thd1~0_176 v_~y$r_buff1_thd1~0_183) (= v_~y$w_buff0~0_316 1) (= (ite .cse0 v_~y$mem_tmp~0_121 v_~y$w_buff0~0_316) v_~y~0_375) (= v_~y$w_buff0_used~0_458 (ite .cse0 1 0)))) InVars {P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_33|, P1Thread1of1ForFork0_#t~nondet5#1=|v_P1Thread1of1ForFork0_#t~nondet5#1_70|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_459, ~y$w_buff0~0=v_~y$w_buff0~0_317, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_146, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_245, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_176, P1Thread1of1ForFork0_#t~nondet6#1=|v_P1Thread1of1ForFork0_#t~nondet6#1_70|, ~y~0=v_~y~0_376, ~x~0=v_~x~0_28, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_33|} OutVars{P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_33|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_458, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_35|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_33|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_183, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_33|, ~y$mem_tmp~0=v_~y$mem_tmp~0_121, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_104, ~y$w_buff0~0=v_~y$w_buff0~0_316, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_176, ~y$flush_delayed~0=v_~y$flush_delayed~0_135, ~y~0=v_~y~0_375, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_35|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_33|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_80, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_213, ~weak$$choice0~0=v_~weak$$choice0~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_283, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_146, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_244, ~weak$$choice2~0=v_~weak$$choice2~0_161, ~x~0=v_~x~0_28, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_159, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_421} AuxVars[] AssignedVars[P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork0_#t~nondet5#1, ~y$w_buff0_used~0, P1Thread1of1ForFork0_#t~nondet6#1, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [438] $Ultimate##0-->L765: Formula: (let ((.cse4 (= (mod v_~y$r_buff1_thd1~0_198 256) 0)) (.cse8 (= (mod v_~y$r_buff0_thd1~0_191 256) 0))) (let ((.cse9 (not .cse8)) (.cse6 (and .cse4 .cse8)) (.cse7 (and .cse8 (= (mod v_~y$w_buff1_used~0_464 256) 0))) (.cse12 (= (mod v_~y$w_buff0_used~0_503 256) 0))) (let ((.cse10 (or .cse6 .cse7 .cse12)) (.cse11 (and (not .cse12) .cse9))) (let ((.cse1 (ite .cse10 v_~y~0_420 (ite .cse11 v_~y$w_buff0~0_345 v_~y$w_buff1~0_310))) (.cse3 (= (mod v_~y$w_buff1_used~0_463 256) 0)) (.cse5 (= 0 (mod v_~y$w_buff0_used~0_502 256))) (.cse0 (not (= (mod v_~weak$$choice2~0_169 256) 0)))) (and (= v_~y~0_419 (ite .cse0 v_~y$mem_tmp~0_129 .cse1)) (= v_~y$w_buff0~0_345 v_~y$w_buff0~0_344) (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= v_~weak$$choice2~0_169 |v_P0Thread1of1ForFork1_#t~nondet4_108|) (= (ite .cse0 v_~y$r_buff1_thd1~0_198 (ite (let ((.cse2 (= (mod v_~y$r_buff0_thd1~0_190 256) 0))) (or (and .cse2 .cse3) (and .cse4 .cse2) .cse5)) v_~y$r_buff1_thd1~0_198 0)) v_~y$r_buff1_thd1~0_197) (= v_~y$w_buff1_used~0_463 (ite .cse0 v_~y$w_buff1_used~0_464 (ite (or .cse6 .cse7 .cse5) v_~y$w_buff1_used~0_464 0))) (= v_~__unbuffered_p0_EAX~0_131 .cse1) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= v_~y$r_buff0_thd1~0_190 (ite .cse0 v_~y$r_buff0_thd1~0_191 (ite (or .cse6 (and .cse8 .cse3) .cse5) v_~y$r_buff0_thd1~0_191 (ite (and (not .cse5) .cse9) 0 v_~y$r_buff0_thd1~0_191)))) (= v_~y~0_420 v_~y$mem_tmp~0_129) (= v_~y$w_buff1~0_309 v_~y$w_buff1~0_310) (= v_~__unbuffered_cnt~0_327 (+ v_~__unbuffered_cnt~0_328 1)) (= v_~weak$$choice0~0_121 |v_P0Thread1of1ForFork1_#t~nondet3_108|) (= (ite .cse0 v_~y$w_buff0_used~0_503 (ite .cse10 v_~y$w_buff0_used~0_503 (ite .cse11 0 v_~y$w_buff0_used~0_503))) v_~y$w_buff0_used~0_502) (= v_~y$flush_delayed~0_143 0) (= v_~x~0_36 1)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_198, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_503, ~y$w_buff1~0=v_~y$w_buff1~0_310, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~y$w_buff0~0=v_~y$w_buff0~0_345, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_191, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_328, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_108|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~y~0=v_~y~0_420, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_108|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_464} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_502, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_197, ~weak$$choice0~0=v_~weak$$choice0~0_121, ~y$mem_tmp~0=v_~y$mem_tmp~0_129, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_131, ~y$w_buff1~0=v_~y$w_buff1~0_309, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~y$w_buff0~0=v_~y$w_buff0~0_344, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_190, ~y$flush_delayed~0=v_~y$flush_delayed~0_143, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_327, ~y~0=v_~y~0_419, ~weak$$choice2~0=v_~weak$$choice2~0_169, ~x~0=v_~x~0_36, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_463} AuxVars[] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork1_~arg.base, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_#t~nondet3, ~y~0, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4, ~y$w_buff1_used~0] [2022-12-13 09:31:20,000 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [430] $Ultimate##0-->L799: Formula: (let ((.cse1 (= (mod v_~y$w_buff0_used~0_458 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_161 256) 0)))) (and (= v_~y$flush_delayed~0_135 0) (= |v_P1Thread1of1ForFork0_#t~nondet5#1_70| v_~weak$$choice0~0_113) (= v_~__unbuffered_p1_EBX~0_80 v_~x~0_28) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_33| |v_P1Thread1of1ForFork0_~arg#1.offset_33|) (= v_~y$r_buff0_thd0~0_146 v_~y$r_buff1_thd0~0_159) (= v_~y$w_buff1~0_283 v_~y$w_buff0~0_317) (= v_~weak$$choice2~0_161 |v_P1Thread1of1ForFork0_#t~nondet6#1_70|) (= |v_P1Thread1of1ForFork0_~arg#1.base_33| |v_P1Thread1of1ForFork0_#in~arg#1.base_33|) (= v_~y~0_376 v_~y$mem_tmp~0_121) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_35| 0)) (= (ite (= (mod v_~y$w_buff0_used~0_459 256) 0) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_35|) (= v_~y$r_buff0_thd2~0_244 (ite .cse0 1 (ite .cse1 1 (ite (not .cse1) 0 1)))) (= (ite .cse0 v_~y$w_buff0_used~0_459 (ite .cse1 v_~y$w_buff0_used~0_459 0)) v_~y$w_buff1_used~0_421) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_35| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_35|) (= v_~y$r_buff1_thd2~0_213 (ite .cse0 v_~y$r_buff0_thd2~0_245 (ite (let ((.cse2 (= (mod v_~y$r_buff0_thd2~0_244 256) 0))) (or (and .cse2 (= (mod v_~y$w_buff1_used~0_421 256) 0)) (and .cse2 (= (mod v_~y$r_buff0_thd2~0_245 256) 0)) .cse1)) v_~y$r_buff0_thd2~0_245 0))) (= v_~__unbuffered_p1_EAX~0_104 v_~y$w_buff0~0_316) (= v_~y$r_buff0_thd1~0_176 v_~y$r_buff1_thd1~0_183) (= v_~y$w_buff0~0_316 1) (= (ite .cse0 v_~y$mem_tmp~0_121 v_~y$w_buff0~0_316) v_~y~0_375) (= v_~y$w_buff0_used~0_458 (ite .cse0 1 0)))) InVars {P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_33|, P1Thread1of1ForFork0_#t~nondet5#1=|v_P1Thread1of1ForFork0_#t~nondet5#1_70|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_459, ~y$w_buff0~0=v_~y$w_buff0~0_317, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_146, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_245, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_176, P1Thread1of1ForFork0_#t~nondet6#1=|v_P1Thread1of1ForFork0_#t~nondet6#1_70|, ~y~0=v_~y~0_376, ~x~0=v_~x~0_28, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_33|} OutVars{P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_33|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_458, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_35|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_33|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_183, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_33|, ~y$mem_tmp~0=v_~y$mem_tmp~0_121, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_104, ~y$w_buff0~0=v_~y$w_buff0~0_316, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_176, ~y$flush_delayed~0=v_~y$flush_delayed~0_135, ~y~0=v_~y~0_375, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_35|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_33|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_80, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_213, ~weak$$choice0~0=v_~weak$$choice0~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_283, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_146, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_244, ~weak$$choice2~0=v_~weak$$choice2~0_161, ~x~0=v_~x~0_28, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_159, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_421} AuxVars[] AssignedVars[P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork0_#t~nondet5#1, ~y$w_buff0_used~0, P1Thread1of1ForFork0_#t~nondet6#1, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [439] $Ultimate##0-->P0FINAL: Formula: (let ((.cse3 (= (mod v_~y$r_buff1_thd1~0_202 256) 0)) (.cse9 (= (mod v_~y$r_buff0_thd1~0_195 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (and (= (mod v_~y$w_buff1_used~0_468 256) 0) .cse9)) (.cse8 (and .cse3 .cse9)) (.cse12 (= (mod v_~y$w_buff0_used~0_507 256) 0))) (let ((.cse6 (or .cse11 .cse8 .cse12)) (.cse7 (and .cse10 (not .cse12)))) (let ((.cse4 (= (mod v_~y$w_buff1_used~0_467 256) 0)) (.cse1 (= (mod v_~y$w_buff0_used~0_506 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_171 256) 0))) (.cse5 (ite .cse6 v_~y~0_424 (ite .cse7 v_~y$w_buff0~0_349 v_~y$w_buff1~0_314)))) (and (= v_~y$w_buff0~0_348 v_~y$w_buff0~0_349) (= (ite .cse0 v_~y$r_buff1_thd1~0_202 (ite (let ((.cse2 (= (mod v_~y$r_buff0_thd1~0_194 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse2 .cse4))) v_~y$r_buff1_thd1~0_202 0)) v_~y$r_buff1_thd1~0_201) (= v_~__unbuffered_p0_EAX~0_133 .cse5) (= v_~weak$$choice0~0_123 |v_P0Thread1of1ForFork1_#t~nondet3_112|) (= v_P0Thread1of1ForFork1_~arg.offset_23 |v_P0Thread1of1ForFork1_#in~arg.offset_23|) (= v_~x~0_38 1) (= v_~y$w_buff0_used~0_506 (ite .cse0 v_~y$w_buff0_used~0_507 (ite .cse6 v_~y$w_buff0_used~0_507 (ite .cse7 0 v_~y$w_buff0_used~0_507)))) (= v_~__unbuffered_cnt~0_331 (+ v_~__unbuffered_cnt~0_332 1)) (= |v_P0Thread1of1ForFork1_#res.offset_57| 0) (= v_~weak$$choice2~0_171 |v_P0Thread1of1ForFork1_#t~nondet4_112|) (= |v_P0Thread1of1ForFork1_#res.base_57| 0) (= |v_P0Thread1of1ForFork1_#in~arg.base_23| v_P0Thread1of1ForFork1_~arg.base_23) (= v_~y$flush_delayed~0_145 0) (= v_~y$r_buff0_thd1~0_194 (ite .cse0 v_~y$r_buff0_thd1~0_195 (ite (or .cse1 .cse8 (and .cse4 .cse9)) v_~y$r_buff0_thd1~0_195 (ite (and .cse10 (not .cse1)) 0 v_~y$r_buff0_thd1~0_195)))) (= v_~y$w_buff1~0_314 v_~y$w_buff1~0_313) (= v_~y~0_424 v_~y$mem_tmp~0_131) (= v_~y$w_buff1_used~0_467 (ite .cse0 v_~y$w_buff1_used~0_468 (ite (or .cse11 .cse1 .cse8) v_~y$w_buff1_used~0_468 0))) (= v_~y~0_423 (ite .cse0 v_~y$mem_tmp~0_131 .cse5))))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_202, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_507, ~y$w_buff1~0=v_~y$w_buff1~0_314, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, ~y$w_buff0~0=v_~y$w_buff0~0_349, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_195, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_332, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_112|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|, ~y~0=v_~y~0_424, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_112|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_468} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_506, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_57|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_57|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_23, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_201, ~weak$$choice0~0=v_~weak$$choice0~0_123, ~y$mem_tmp~0=v_~y$mem_tmp~0_131, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_133, ~y$w_buff1~0=v_~y$w_buff1~0_313, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, ~y$w_buff0~0=v_~y$w_buff0~0_348, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_194, ~y$flush_delayed~0=v_~y$flush_delayed~0_145, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_23, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_331, ~y~0=v_~y~0_423, ~weak$$choice2~0=v_~weak$$choice2~0_171, ~x~0=v_~x~0_38, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_467} AuxVars[] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.base, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_#t~nondet3, ~y~0, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4, ~y$w_buff1_used~0] [2022-12-13 09:31:20,411 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [430] $Ultimate##0-->L799: Formula: (let ((.cse1 (= (mod v_~y$w_buff0_used~0_458 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_161 256) 0)))) (and (= v_~y$flush_delayed~0_135 0) (= |v_P1Thread1of1ForFork0_#t~nondet5#1_70| v_~weak$$choice0~0_113) (= v_~__unbuffered_p1_EBX~0_80 v_~x~0_28) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_33| |v_P1Thread1of1ForFork0_~arg#1.offset_33|) (= v_~y$r_buff0_thd0~0_146 v_~y$r_buff1_thd0~0_159) (= v_~y$w_buff1~0_283 v_~y$w_buff0~0_317) (= v_~weak$$choice2~0_161 |v_P1Thread1of1ForFork0_#t~nondet6#1_70|) (= |v_P1Thread1of1ForFork0_~arg#1.base_33| |v_P1Thread1of1ForFork0_#in~arg#1.base_33|) (= v_~y~0_376 v_~y$mem_tmp~0_121) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_35| 0)) (= (ite (= (mod v_~y$w_buff0_used~0_459 256) 0) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_35|) (= v_~y$r_buff0_thd2~0_244 (ite .cse0 1 (ite .cse1 1 (ite (not .cse1) 0 1)))) (= (ite .cse0 v_~y$w_buff0_used~0_459 (ite .cse1 v_~y$w_buff0_used~0_459 0)) v_~y$w_buff1_used~0_421) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_35| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_35|) (= v_~y$r_buff1_thd2~0_213 (ite .cse0 v_~y$r_buff0_thd2~0_245 (ite (let ((.cse2 (= (mod v_~y$r_buff0_thd2~0_244 256) 0))) (or (and .cse2 (= (mod v_~y$w_buff1_used~0_421 256) 0)) (and .cse2 (= (mod v_~y$r_buff0_thd2~0_245 256) 0)) .cse1)) v_~y$r_buff0_thd2~0_245 0))) (= v_~__unbuffered_p1_EAX~0_104 v_~y$w_buff0~0_316) (= v_~y$r_buff0_thd1~0_176 v_~y$r_buff1_thd1~0_183) (= v_~y$w_buff0~0_316 1) (= (ite .cse0 v_~y$mem_tmp~0_121 v_~y$w_buff0~0_316) v_~y~0_375) (= v_~y$w_buff0_used~0_458 (ite .cse0 1 0)))) InVars {P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_33|, P1Thread1of1ForFork0_#t~nondet5#1=|v_P1Thread1of1ForFork0_#t~nondet5#1_70|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_459, ~y$w_buff0~0=v_~y$w_buff0~0_317, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_146, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_245, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_176, P1Thread1of1ForFork0_#t~nondet6#1=|v_P1Thread1of1ForFork0_#t~nondet6#1_70|, ~y~0=v_~y~0_376, ~x~0=v_~x~0_28, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_33|} OutVars{P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_33|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_458, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_35|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_33|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_183, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_33|, ~y$mem_tmp~0=v_~y$mem_tmp~0_121, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_104, ~y$w_buff0~0=v_~y$w_buff0~0_316, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_176, ~y$flush_delayed~0=v_~y$flush_delayed~0_135, ~y~0=v_~y~0_375, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_35|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_33|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_80, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_213, ~weak$$choice0~0=v_~weak$$choice0~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_283, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_146, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_244, ~weak$$choice2~0=v_~weak$$choice2~0_161, ~x~0=v_~x~0_28, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_159, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_421} AuxVars[] AssignedVars[P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork0_#t~nondet5#1, ~y$w_buff0_used~0, P1Thread1of1ForFork0_#t~nondet6#1, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [440] $Ultimate##0-->P0EXIT: Formula: (let ((.cse8 (= (mod v_~y$r_buff1_thd1~0_206 256) 0)) (.cse4 (= (mod v_~y$r_buff0_thd1~0_199 256) 0))) (let ((.cse5 (not .cse4)) (.cse11 (and (= (mod v_~y$w_buff1_used~0_472 256) 0) .cse4)) (.cse1 (and .cse8 .cse4)) (.cse12 (= (mod v_~y$w_buff0_used~0_511 256) 0))) (let ((.cse9 (or .cse11 .cse1 .cse12)) (.cse10 (and .cse5 (not .cse12)))) (let ((.cse6 (ite .cse9 v_~y~0_428 (ite .cse10 v_~y$w_buff0~0_353 v_~y$w_buff1~0_318))) (.cse3 (= (mod v_~y$w_buff1_used~0_471 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_173 256) 0))) (.cse2 (= (mod v_~y$w_buff0_used~0_510 256) 0))) (and (= v_~__unbuffered_cnt~0_335 (+ v_~__unbuffered_cnt~0_336 1)) (= v_~y$w_buff0~0_353 v_~y$w_buff0~0_352) (= |v_P0Thread1of1ForFork1_#in~arg.base_25| v_P0Thread1of1ForFork1_~arg.base_25) (= v_~y$r_buff0_thd1~0_198 (ite .cse0 v_~y$r_buff0_thd1~0_199 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~y$r_buff0_thd1~0_199 (ite (and .cse5 (not .cse2)) 0 v_~y$r_buff0_thd1~0_199)))) (= |v_P0Thread1of1ForFork1_#res.offset_59| 0) (= v_~y$w_buff1~0_318 v_~y$w_buff1~0_317) (= .cse6 v_~__unbuffered_p0_EAX~0_135) (= v_~weak$$choice2~0_173 |v_P0Thread1of1ForFork1_#t~nondet4_116|) (= v_~weak$$choice0~0_125 |v_P0Thread1of1ForFork1_#t~nondet3_116|) (= v_~y$flush_delayed~0_147 0) (= v_P0Thread1of1ForFork1_~arg.offset_25 |v_P0Thread1of1ForFork1_#in~arg.offset_25|) (= v_~y~0_427 (ite .cse0 v_~y$mem_tmp~0_133 .cse6)) (= |v_P0Thread1of1ForFork1_#res.base_59| 0) (= v_~y~0_428 v_~y$mem_tmp~0_133) (= v_~x~0_40 1) (= v_~y$r_buff1_thd1~0_205 (ite .cse0 v_~y$r_buff1_thd1~0_206 (ite (let ((.cse7 (= (mod v_~y$r_buff0_thd1~0_198 256) 0))) (or (and .cse3 .cse7) .cse2 (and .cse7 .cse8))) v_~y$r_buff1_thd1~0_206 0))) (= (ite .cse0 v_~y$w_buff0_used~0_511 (ite .cse9 v_~y$w_buff0_used~0_511 (ite .cse10 0 v_~y$w_buff0_used~0_511))) v_~y$w_buff0_used~0_510) (= (ite .cse0 v_~y$w_buff1_used~0_472 (ite (or .cse11 .cse1 .cse2) v_~y$w_buff1_used~0_472 0)) v_~y$w_buff1_used~0_471)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_206, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_511, ~y$w_buff1~0=v_~y$w_buff1~0_318, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, ~y$w_buff0~0=v_~y$w_buff0~0_353, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_199, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_336, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_116|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|, ~y~0=v_~y~0_428, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_116|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_472} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_510, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_59|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_59|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_25, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_205, ~weak$$choice0~0=v_~weak$$choice0~0_125, ~y$mem_tmp~0=v_~y$mem_tmp~0_133, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_317, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, ~y$w_buff0~0=v_~y$w_buff0~0_352, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_198, ~y$flush_delayed~0=v_~y$flush_delayed~0_147, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_25, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_335, ~y~0=v_~y~0_427, ~weak$$choice2~0=v_~weak$$choice2~0_173, ~x~0=v_~x~0_40, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_471} AuxVars[] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.base, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_#t~nondet3, ~y~0, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4, ~y$w_buff1_used~0] [2022-12-13 09:31:20,835 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 09:31:20,836 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2939 [2022-12-13 09:31:20,836 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 19 transitions, 135 flow [2022-12-13 09:31:20,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:20,836 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:20,836 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:20,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:31:20,836 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:31:20,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:20,836 INFO L85 PathProgramCache]: Analyzing trace with hash 346949427, now seen corresponding path program 1 times [2022-12-13 09:31:20,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:20,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019852048] [2022-12-13 09:31:20,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:20,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:31:20,856 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 09:31:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:31:20,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 09:31:20,889 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 09:31:20,890 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 09:31:20,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-13 09:31:20,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 09:31:20,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 09:31:20,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-13 09:31:20,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:31:20,892 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:20,896 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:31:20,896 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:31:20,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:31:20 BasicIcfg [2022-12-13 09:31:20,921 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:31:20,921 INFO L158 Benchmark]: Toolchain (without parser) took 12470.61ms. Allocated memory was 219.2MB in the beginning and 468.7MB in the end (delta: 249.6MB). Free memory was 194.6MB in the beginning and 189.0MB in the end (delta: 5.5MB). Peak memory consumption was 256.1MB. Max. memory is 8.0GB. [2022-12-13 09:31:20,921 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 219.2MB. Free memory is still 196.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:31:20,921 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.03ms. Allocated memory is still 219.2MB. Free memory was 194.1MB in the beginning and 168.4MB in the end (delta: 25.8MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 09:31:20,921 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.52ms. Allocated memory is still 219.2MB. Free memory was 167.9MB in the beginning and 165.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:31:20,921 INFO L158 Benchmark]: Boogie Preprocessor took 23.34ms. Allocated memory is still 219.2MB. Free memory was 165.7MB in the beginning and 163.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:31:20,922 INFO L158 Benchmark]: RCFGBuilder took 580.21ms. Allocated memory is still 219.2MB. Free memory was 163.7MB in the beginning and 127.9MB in the end (delta: 35.8MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-13 09:31:20,922 INFO L158 Benchmark]: TraceAbstraction took 11402.44ms. Allocated memory was 219.2MB in the beginning and 468.7MB in the end (delta: 249.6MB). Free memory was 126.4MB in the beginning and 189.0MB in the end (delta: -62.6MB). Peak memory consumption was 187.9MB. Max. memory is 8.0GB. [2022-12-13 09:31:20,923 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.09ms. Allocated memory is still 219.2MB. Free memory is still 196.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 410.03ms. Allocated memory is still 219.2MB. Free memory was 194.1MB in the beginning and 168.4MB in the end (delta: 25.8MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.52ms. Allocated memory is still 219.2MB. Free memory was 167.9MB in the beginning and 165.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.34ms. Allocated memory is still 219.2MB. Free memory was 165.7MB in the beginning and 163.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 580.21ms. Allocated memory is still 219.2MB. Free memory was 163.7MB in the beginning and 127.9MB in the end (delta: 35.8MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 11402.44ms. Allocated memory was 219.2MB in the beginning and 468.7MB in the end (delta: 249.6MB). Free memory was 126.4MB in the beginning and 189.0MB in the end (delta: -62.6MB). Peak memory consumption was 187.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 92 PlacesBefore, 51 PlacesAfterwards, 87 TransitionsBefore, 45 TransitionsAfterwards, 1002 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 36 TrivialYvCompositions, 32 ConcurrentYvCompositions, 4 ChoiceCompositions, 73 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1766, independent: 1671, independent conditional: 1671, independent unconditional: 0, dependent: 95, dependent conditional: 95, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1162, independent: 1132, independent conditional: 0, independent unconditional: 1132, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1162, independent: 1132, independent conditional: 0, independent unconditional: 1132, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1162, independent: 1110, independent conditional: 0, independent unconditional: 1110, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 52, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 223, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 188, dependent conditional: 0, dependent unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1766, independent: 539, independent conditional: 539, independent unconditional: 0, dependent: 65, dependent conditional: 65, dependent unconditional: 0, unknown: 1162, unknown conditional: 1162, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1167, Positive cache size: 1137, Positive conditional cache size: 1137, Positive unconditional cache size: 0, Negative cache size: 30, Negative conditional cache size: 30, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 30 PlacesBefore, 30 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 260 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 144, independent: 118, independent conditional: 118, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 117, independent: 98, independent conditional: 5, independent unconditional: 93, dependent: 19, dependent conditional: 1, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 117, independent: 98, independent conditional: 5, independent unconditional: 93, dependent: 19, dependent conditional: 1, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 117, independent: 83, independent conditional: 0, independent unconditional: 83, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 34, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 19, dependent conditional: 1, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 138, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 127, dependent conditional: 5, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 144, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 117, unknown conditional: 117, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 98, Positive conditional cache size: 98, Positive unconditional cache size: 0, Negative cache size: 19, Negative conditional cache size: 19, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 61, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 11, independent conditional: 2, independent unconditional: 9, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 11, independent conditional: 2, independent unconditional: 9, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 29, dependent conditional: 25, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 61, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 109, Positive conditional cache size: 109, Positive unconditional cache size: 0, Negative cache size: 22, Negative conditional cache size: 22, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 64, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 8, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 64, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 142, Positive cache size: 117, Positive conditional cache size: 117, Positive unconditional cache size: 0, Negative cache size: 25, Negative conditional cache size: 25, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 47, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 47, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 119, Positive conditional cache size: 119, Positive unconditional cache size: 0, Negative cache size: 25, Negative conditional cache size: 25, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 37 PlacesBefore, 35 PlacesAfterwards, 29 TransitionsBefore, 27 TransitionsAfterwards, 122 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 74, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 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: 74, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 122, Positive conditional cache size: 122, Positive unconditional cache size: 0, Negative cache size: 25, Negative conditional cache size: 25, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 35 PlacesBefore, 34 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 86 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 36, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 6, independent unconditional: 1, 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: 9, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 36, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 129, Positive conditional cache size: 129, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 33 PlacesBefore, 32 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 64, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 3, independent unconditional: 7, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 3, independent unconditional: 7, 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: 12, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 64, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 139, Positive conditional cache size: 139, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 33 PlacesBefore, 31 PlacesAfterwards, 21 TransitionsBefore, 19 TransitionsAfterwards, 36 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 31, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 5, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 5, independent unconditional: 1, 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: 31, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 174, Positive cache size: 145, Positive conditional cache size: 145, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: 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_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_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_buff1_thd0; [L728] 0 _Bool y$r_buff1_thd1; [L729] 0 _Bool y$r_buff1_thd2; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1761; [L824] FCALL, FORK 0 pthread_create(&t1761, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1761, ((void *)0), P0, ((void *)0))=-1, t1761={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L825] 0 pthread_t t1762; [L826] FCALL, FORK 0 pthread_create(&t1762, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1762, ((void *)0), P1, ((void *)0))=0, t1761={5:0}, t1762={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L771] 2 y$w_buff1 = y$w_buff0 [L772] 2 y$w_buff0 = 1 [L773] 2 y$w_buff1_used = y$w_buff0_used [L774] 2 y$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L776] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L777] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L778] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L779] 2 y$r_buff0_thd2 = (_Bool)1 [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 y$flush_delayed = weak$$choice2 [L785] 2 y$mem_tmp = y [L786] 2 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) [L787] 2 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)) [L788] 2 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)) [L789] 2 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)) [L790] 2 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)) [L791] 2 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)) [L792] 2 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)) [L793] 2 __unbuffered_p1_EAX = y [L794] 2 y = y$flush_delayed ? y$mem_tmp : y [L795] 2 y$flush_delayed = (_Bool)0 [L798] 2 __unbuffered_p1_EBX = x [L741] 2 x = 1 [L746] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 2 y$flush_delayed = weak$$choice2 [L749] 2 y$mem_tmp = y [L750] 2 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L751] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L752] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L753] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L754] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 2 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L756] 2 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 2 __unbuffered_p0_EAX = y [L758] 2 y = y$flush_delayed ? y$mem_tmp : y [L759] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L801] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L802] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L803] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L804] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L805] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L828] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L830] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L830] RET 0 assume_abort_if_not(main$tmp_guard0) [L832] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 0 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 [L835] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L836] 0 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 [L839] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L841] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] - UnprovableResult [Line: 19]: 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: 826]: 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: 824]: 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 5 procedures, 107 locations, 5 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: 11.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 143 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 143 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 462 IncrementalHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 3 mSDtfsCounter, 462 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=5, InterpolantAutomatonStates: 35, 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.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 68 ConstructedInterpolants, 0 QuantifiedInterpolants, 463 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 09:31:20,941 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...