/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/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:19:16,767 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:19:16,769 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:19:16,808 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:19:16,808 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:19:16,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:19:16,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:19:16,811 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:19:16,814 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:19:16,818 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:19:16,819 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:19:16,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:19:16,821 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:19:16,823 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:19:16,824 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:19:16,825 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:19:16,826 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:19:16,827 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:19:16,830 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:19:16,831 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:19:16,832 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:19:16,833 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:19:16,834 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:19:16,835 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:19:16,842 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:19:16,842 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:19:16,842 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:19:16,843 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:19:16,843 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:19:16,844 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:19:16,844 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:19:16,844 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:19:16,845 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:19:16,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:19:16,846 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:19:16,846 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:19:16,846 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:19:16,847 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:19:16,847 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:19:16,847 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:19:16,848 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:19:16,849 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:19:16,864 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:19:16,864 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:19:16,865 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:19:16,866 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:19:16,866 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:19:16,866 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:19:16,866 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:19:16,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:19:16,866 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:19:16,866 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:19:16,866 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:19:16,867 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:19:16,867 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:19:16,867 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:19:16,867 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:19:16,867 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:19:16,867 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:19:16,867 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:19:16,867 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:19:16,867 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:19:16,867 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:19:16,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:19:16,868 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:19:16,868 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:19:16,868 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:19:16,868 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:19:16,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:19:16,868 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:19:16,868 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:19:17,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:19:17,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:19:17,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:19:17,177 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:19:17,177 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:19:17,178 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2022-12-06 04:19:18,288 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:19:18,456 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:19:18,457 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2022-12-06 04:19:18,475 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/868bcc2fb/4d92752da9fd4e83aecddd7598094a27/FLAGc03571ec0 [2022-12-06 04:19:18,491 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/868bcc2fb/4d92752da9fd4e83aecddd7598094a27 [2022-12-06 04:19:18,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:19:18,494 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:19:18,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:19:18,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:19:18,500 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:19:18,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:19:18" (1/1) ... [2022-12-06 04:19:18,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3416555e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:18, skipping insertion in model container [2022-12-06 04:19:18,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:19:18" (1/1) ... [2022-12-06 04:19:18,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:19:18,542 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:19:18,679 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/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2022-12-06 04:19:18,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:18,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:18,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:18,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:18,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:18,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:18,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:18,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:18,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:18,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:18,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:18,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:18,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:18,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:18,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:18,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:18,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:18,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:18,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:18,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:18,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:18,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:18,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:18,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:18,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:18,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:18,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:18,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:18,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:18,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:18,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:19:18,886 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:19:18,895 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/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2022-12-06 04:19:18,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:18,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:18,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:18,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:18,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:18,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:18,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:18,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:18,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:18,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:18,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:18,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:18,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:18,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:18,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:18,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:18,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:18,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:18,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:18,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:18,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:18,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:18,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:18,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:18,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:18,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:18,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:18,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:18,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:18,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:18,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:19:18,979 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:19:18,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:18 WrapperNode [2022-12-06 04:19:18,980 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:19:18,981 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:19:18,981 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:19:18,981 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:19:18,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:18" (1/1) ... [2022-12-06 04:19:19,017 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:18" (1/1) ... [2022-12-06 04:19:19,047 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2022-12-06 04:19:19,048 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:19:19,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:19:19,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:19:19,049 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:19:19,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:18" (1/1) ... [2022-12-06 04:19:19,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:18" (1/1) ... [2022-12-06 04:19:19,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:18" (1/1) ... [2022-12-06 04:19:19,089 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:18" (1/1) ... [2022-12-06 04:19:19,105 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:18" (1/1) ... [2022-12-06 04:19:19,106 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:18" (1/1) ... [2022-12-06 04:19:19,108 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:18" (1/1) ... [2022-12-06 04:19:19,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:18" (1/1) ... [2022-12-06 04:19:19,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:19:19,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:19:19,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:19:19,111 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:19:19,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:18" (1/1) ... [2022-12-06 04:19:19,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:19:19,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:19:19,202 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:19:19,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:19:19,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:19:19,237 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:19:19,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:19:19,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:19:19,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:19:19,237 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:19:19,238 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:19:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:19:19,238 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:19:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:19:19,239 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:19:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:19:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:19:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:19:19,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:19:19,240 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:19:19,352 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:19:19,354 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:19:19,651 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:19:19,760 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:19:19,760 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:19:19,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:19:19 BoogieIcfgContainer [2022-12-06 04:19:19,763 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:19:19,764 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:19:19,765 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:19:19,767 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:19:19,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:19:18" (1/3) ... [2022-12-06 04:19:19,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ae11177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:19:19, skipping insertion in model container [2022-12-06 04:19:19,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:18" (2/3) ... [2022-12-06 04:19:19,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ae11177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:19:19, skipping insertion in model container [2022-12-06 04:19:19,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:19:19" (3/3) ... [2022-12-06 04:19:19,769 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2022-12-06 04:19:19,781 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:19:19,781 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:19:19,781 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:19:19,824 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:19:19,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2022-12-06 04:19:19,902 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-06 04:19:19,902 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:19:19,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 04:19:19,907 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2022-12-06 04:19:19,910 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2022-12-06 04:19:19,911 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:19,927 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-06 04:19:19,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2022-12-06 04:19:19,970 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-06 04:19:19,970 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:19:19,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 04:19:19,973 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-06 04:19:19,974 INFO L188 LiptonReduction]: Number of co-enabled transitions 1920 [2022-12-06 04:19:24,392 INFO L203 LiptonReduction]: Total number of compositions: 82 [2022-12-06 04:19:24,402 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:19:24,406 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;@56ae99fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:19:24,406 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 04:19:24,407 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-06 04:19:24,408 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:19:24,408 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:24,408 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 04:19:24,408 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:19:24,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:24,411 INFO L85 PathProgramCache]: Analyzing trace with hash 473468, now seen corresponding path program 1 times [2022-12-06 04:19:24,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:24,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901622404] [2022-12-06 04:19:24,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:24,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:19:24,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:24,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901622404] [2022-12-06 04:19:24,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901622404] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:24,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:24,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:19:24,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040966488] [2022-12-06 04:19:24,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:24,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:19:24,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:24,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:19:24,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:19:24,688 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 04:19:24,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:24,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:24,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 04:19:24,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:24,935 INFO L130 PetriNetUnfolder]: 1106/1719 cut-off events. [2022-12-06 04:19:24,936 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 04:19:24,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3413 conditions, 1719 events. 1106/1719 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 8396 event pairs, 308 based on Foata normal form. 0/1538 useless extension candidates. Maximal degree in co-relation 3402. Up to 1336 conditions per place. [2022-12-06 04:19:24,951 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 31 selfloop transitions, 2 changer transitions 8/43 dead transitions. [2022-12-06 04:19:24,951 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 183 flow [2022-12-06 04:19:24,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:19:24,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:19:24,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-06 04:19:24,959 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2022-12-06 04:19:24,960 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 65 flow. Second operand 3 states and 52 transitions. [2022-12-06 04:19:24,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 43 transitions, 183 flow [2022-12-06 04:19:24,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 43 transitions, 178 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:19:24,964 INFO L231 Difference]: Finished difference. Result has 34 places, 21 transitions, 52 flow [2022-12-06 04:19:24,965 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=34, PETRI_TRANSITIONS=21} [2022-12-06 04:19:24,969 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2022-12-06 04:19:24,969 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:24,970 INFO L89 Accepts]: Start accepts. Operand has 34 places, 21 transitions, 52 flow [2022-12-06 04:19:24,972 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:24,972 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:24,972 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 21 transitions, 52 flow [2022-12-06 04:19:24,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 21 transitions, 52 flow [2022-12-06 04:19:24,978 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 04:19:24,978 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:19:24,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:19:24,979 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 21 transitions, 52 flow [2022-12-06 04:19:24,979 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-06 04:19:25,101 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:19:25,104 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-06 04:19:25,104 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 52 flow [2022-12-06 04:19:25,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:25,104 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:25,104 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:25,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:19:25,107 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:19:25,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:25,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1038675174, now seen corresponding path program 1 times [2022-12-06 04:19:25,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:25,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528595621] [2022-12-06 04:19:25,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:25,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:25,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:19:25,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:25,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528595621] [2022-12-06 04:19:25,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528595621] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:25,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:25,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:19:25,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471962704] [2022-12-06 04:19:25,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:25,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:19:25,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:25,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:19:25,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:19:25,276 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 04:19:25,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:25,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:25,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 04:19:25,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:25,408 INFO L130 PetriNetUnfolder]: 883/1409 cut-off events. [2022-12-06 04:19:25,408 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-06 04:19:25,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2874 conditions, 1409 events. 883/1409 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6619 event pairs, 241 based on Foata normal form. 10/1419 useless extension candidates. Maximal degree in co-relation 2864. Up to 1252 conditions per place. [2022-12-06 04:19:25,414 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 30 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2022-12-06 04:19:25,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 34 transitions, 150 flow [2022-12-06 04:19:25,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:19:25,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:19:25,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 04:19:25,415 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5873015873015873 [2022-12-06 04:19:25,415 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 52 flow. Second operand 3 states and 37 transitions. [2022-12-06 04:19:25,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 34 transitions, 150 flow [2022-12-06 04:19:25,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 34 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:19:25,416 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 67 flow [2022-12-06 04:19:25,416 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2022-12-06 04:19:25,417 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -6 predicate places. [2022-12-06 04:19:25,417 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:25,418 INFO L89 Accepts]: Start accepts. Operand has 31 places, 23 transitions, 67 flow [2022-12-06 04:19:25,418 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:25,418 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:25,418 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 23 transitions, 67 flow [2022-12-06 04:19:25,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 23 transitions, 67 flow [2022-12-06 04:19:25,422 INFO L130 PetriNetUnfolder]: 3/33 cut-off events. [2022-12-06 04:19:25,422 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:19:25,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 33 events. 3/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 69 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 46. Up to 10 conditions per place. [2022-12-06 04:19:25,423 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 23 transitions, 67 flow [2022-12-06 04:19:25,423 INFO L188 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-06 04:19:25,489 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:19:25,491 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 04:19:25,491 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 67 flow [2022-12-06 04:19:25,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:25,492 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:25,492 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:25,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:19:25,492 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:19:25,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:25,492 INFO L85 PathProgramCache]: Analyzing trace with hash 2134159305, now seen corresponding path program 1 times [2022-12-06 04:19:25,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:25,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9841651] [2022-12-06 04:19:25,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:25,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:25,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:19:25,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:25,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9841651] [2022-12-06 04:19:25,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9841651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:25,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:25,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:19:25,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851989959] [2022-12-06 04:19:25,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:25,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:19:25,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:25,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:19:25,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:19:25,686 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 04:19:25,686 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 67 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:25,686 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:25,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 04:19:25,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:25,838 INFO L130 PetriNetUnfolder]: 592/990 cut-off events. [2022-12-06 04:19:25,838 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2022-12-06 04:19:25,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2189 conditions, 990 events. 592/990 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4702 event pairs, 169 based on Foata normal form. 95/1080 useless extension candidates. Maximal degree in co-relation 2178. Up to 399 conditions per place. [2022-12-06 04:19:25,842 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 42 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2022-12-06 04:19:25,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 50 transitions, 229 flow [2022-12-06 04:19:25,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:19:25,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:19:25,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-12-06 04:19:25,844 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2022-12-06 04:19:25,845 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 67 flow. Second operand 4 states and 54 transitions. [2022-12-06 04:19:25,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 50 transitions, 229 flow [2022-12-06 04:19:25,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 50 transitions, 224 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:19:25,846 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 102 flow [2022-12-06 04:19:25,846 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2022-12-06 04:19:25,847 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2022-12-06 04:19:25,847 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:25,847 INFO L89 Accepts]: Start accepts. Operand has 35 places, 27 transitions, 102 flow [2022-12-06 04:19:25,849 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:25,849 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:25,849 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 27 transitions, 102 flow [2022-12-06 04:19:25,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 27 transitions, 102 flow [2022-12-06 04:19:25,858 INFO L130 PetriNetUnfolder]: 34/103 cut-off events. [2022-12-06 04:19:25,858 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-06 04:19:25,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 103 events. 34/103 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 422 event pairs, 14 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 208. Up to 55 conditions per place. [2022-12-06 04:19:25,859 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 27 transitions, 102 flow [2022-12-06 04:19:25,859 INFO L188 LiptonReduction]: Number of co-enabled transitions 296 [2022-12-06 04:19:26,006 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:19:26,006 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-06 04:19:26,006 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 104 flow [2022-12-06 04:19:26,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:26,007 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:26,007 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:26,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:19:26,007 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:19:26,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:26,007 INFO L85 PathProgramCache]: Analyzing trace with hash -950318393, now seen corresponding path program 1 times [2022-12-06 04:19:26,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:26,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729555913] [2022-12-06 04:19:26,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:26,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:26,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:19:26,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:26,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729555913] [2022-12-06 04:19:26,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729555913] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:26,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:26,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:19:26,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230502669] [2022-12-06 04:19:26,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:26,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:19:26,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:26,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:19:26,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:19:26,146 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 04:19:26,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 104 flow. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:26,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:26,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 04:19:26,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:26,324 INFO L130 PetriNetUnfolder]: 852/1416 cut-off events. [2022-12-06 04:19:26,325 INFO L131 PetriNetUnfolder]: For 583/583 co-relation queries the response was YES. [2022-12-06 04:19:26,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3942 conditions, 1416 events. 852/1416 cut-off events. For 583/583 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6615 event pairs, 260 based on Foata normal form. 43/1459 useless extension candidates. Maximal degree in co-relation 3928. Up to 916 conditions per place. [2022-12-06 04:19:26,331 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 39 selfloop transitions, 7 changer transitions 0/46 dead transitions. [2022-12-06 04:19:26,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 46 transitions, 263 flow [2022-12-06 04:19:26,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:19:26,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:19:26,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-06 04:19:26,333 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2022-12-06 04:19:26,333 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 104 flow. Second operand 3 states and 38 transitions. [2022-12-06 04:19:26,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 46 transitions, 263 flow [2022-12-06 04:19:26,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 248 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 04:19:26,336 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 146 flow [2022-12-06 04:19:26,336 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2022-12-06 04:19:26,336 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 0 predicate places. [2022-12-06 04:19:26,337 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:26,337 INFO L89 Accepts]: Start accepts. Operand has 37 places, 31 transitions, 146 flow [2022-12-06 04:19:26,337 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:26,337 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:26,337 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 31 transitions, 146 flow [2022-12-06 04:19:26,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 146 flow [2022-12-06 04:19:26,354 INFO L130 PetriNetUnfolder]: 67/207 cut-off events. [2022-12-06 04:19:26,354 INFO L131 PetriNetUnfolder]: For 44/64 co-relation queries the response was YES. [2022-12-06 04:19:26,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 207 events. 67/207 cut-off events. For 44/64 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1130 event pairs, 24 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 439. Up to 107 conditions per place. [2022-12-06 04:19:26,355 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 31 transitions, 146 flow [2022-12-06 04:19:26,356 INFO L188 LiptonReduction]: Number of co-enabled transitions 316 [2022-12-06 04:19:26,359 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:19:26,360 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-06 04:19:26,360 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 146 flow [2022-12-06 04:19:26,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:26,360 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:26,360 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:26,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:19:26,361 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:19:26,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:26,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1156703050, now seen corresponding path program 1 times [2022-12-06 04:19:26,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:26,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309778599] [2022-12-06 04:19:26,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:26,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:26,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:19:26,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:26,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309778599] [2022-12-06 04:19:26,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309778599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:26,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:26,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:19:26,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606585179] [2022-12-06 04:19:26,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:26,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:19:26,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:26,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:19:26,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:19:26,489 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 04:19:26,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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-06 04:19:26,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:26,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 04:19:26,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:26,663 INFO L130 PetriNetUnfolder]: 456/835 cut-off events. [2022-12-06 04:19:26,663 INFO L131 PetriNetUnfolder]: For 515/530 co-relation queries the response was YES. [2022-12-06 04:19:26,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2352 conditions, 835 events. 456/835 cut-off events. For 515/530 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4180 event pairs, 96 based on Foata normal form. 91/905 useless extension candidates. Maximal degree in co-relation 2336. Up to 358 conditions per place. [2022-12-06 04:19:26,667 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 59 selfloop transitions, 8 changer transitions 0/72 dead transitions. [2022-12-06 04:19:26,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 72 transitions, 433 flow [2022-12-06 04:19:26,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:19:26,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:19:26,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-06 04:19:26,668 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6476190476190476 [2022-12-06 04:19:26,668 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 146 flow. Second operand 5 states and 68 transitions. [2022-12-06 04:19:26,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 72 transitions, 433 flow [2022-12-06 04:19:26,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 72 transitions, 407 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:19:26,678 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 185 flow [2022-12-06 04:19:26,679 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=185, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2022-12-06 04:19:26,680 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2022-12-06 04:19:26,680 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:26,680 INFO L89 Accepts]: Start accepts. Operand has 41 places, 35 transitions, 185 flow [2022-12-06 04:19:26,681 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:26,681 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:26,681 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 35 transitions, 185 flow [2022-12-06 04:19:26,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 185 flow [2022-12-06 04:19:26,695 INFO L130 PetriNetUnfolder]: 48/176 cut-off events. [2022-12-06 04:19:26,695 INFO L131 PetriNetUnfolder]: For 200/215 co-relation queries the response was YES. [2022-12-06 04:19:26,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 176 events. 48/176 cut-off events. For 200/215 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 951 event pairs, 6 based on Foata normal form. 8/174 useless extension candidates. Maximal degree in co-relation 523. Up to 92 conditions per place. [2022-12-06 04:19:26,697 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 35 transitions, 185 flow [2022-12-06 04:19:26,697 INFO L188 LiptonReduction]: Number of co-enabled transitions 336 [2022-12-06 04:19:26,860 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:19:26,861 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 04:19:26,861 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 189 flow [2022-12-06 04:19:26,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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-06 04:19:26,862 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:26,862 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:26,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:19:26,862 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:19:26,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:26,862 INFO L85 PathProgramCache]: Analyzing trace with hash 281482259, now seen corresponding path program 1 times [2022-12-06 04:19:26,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:26,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467353901] [2022-12-06 04:19:26,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:26,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:27,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:19:27,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:27,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467353901] [2022-12-06 04:19:27,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467353901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:27,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:27,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:19:27,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752277605] [2022-12-06 04:19:27,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:27,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:19:27,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:27,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:19:27,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:19:27,039 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2022-12-06 04:19:27,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 189 flow. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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-06 04:19:27,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:27,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2022-12-06 04:19:27,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:27,159 INFO L130 PetriNetUnfolder]: 297/551 cut-off events. [2022-12-06 04:19:27,159 INFO L131 PetriNetUnfolder]: For 684/694 co-relation queries the response was YES. [2022-12-06 04:19:27,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1798 conditions, 551 events. 297/551 cut-off events. For 684/694 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2571 event pairs, 93 based on Foata normal form. 25/558 useless extension candidates. Maximal degree in co-relation 1780. Up to 208 conditions per place. [2022-12-06 04:19:27,162 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 43 selfloop transitions, 11 changer transitions 1/60 dead transitions. [2022-12-06 04:19:27,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 60 transitions, 380 flow [2022-12-06 04:19:27,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:19:27,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:19:27,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-12-06 04:19:27,163 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2022-12-06 04:19:27,163 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 189 flow. Second operand 6 states and 60 transitions. [2022-12-06 04:19:27,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 60 transitions, 380 flow [2022-12-06 04:19:27,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 353 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-06 04:19:27,166 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 197 flow [2022-12-06 04:19:27,166 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=197, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2022-12-06 04:19:27,167 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 7 predicate places. [2022-12-06 04:19:27,167 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:27,167 INFO L89 Accepts]: Start accepts. Operand has 44 places, 35 transitions, 197 flow [2022-12-06 04:19:27,168 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:27,168 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:27,168 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 35 transitions, 197 flow [2022-12-06 04:19:27,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 197 flow [2022-12-06 04:19:27,204 INFO L130 PetriNetUnfolder]: 28/111 cut-off events. [2022-12-06 04:19:27,204 INFO L131 PetriNetUnfolder]: For 164/168 co-relation queries the response was YES. [2022-12-06 04:19:27,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 111 events. 28/111 cut-off events. For 164/168 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 466 event pairs, 2 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 329. Up to 37 conditions per place. [2022-12-06 04:19:27,205 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 197 flow [2022-12-06 04:19:27,205 INFO L188 LiptonReduction]: Number of co-enabled transitions 262 [2022-12-06 04:19:27,817 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [442] L763-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_78 1) v_~__unbuffered_cnt~0_77) (= |v_P0Thread1of1ForFork2_#res#1.base_13| 0) (= |v_P0Thread1of1ForFork2_#res#1.offset_13| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P0Thread1of1ForFork2_#res#1.offset=|v_P0Thread1of1ForFork2_#res#1.offset_13|, P0Thread1of1ForFork2_#res#1.base=|v_P0Thread1of1ForFork2_#res#1.base_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res#1.offset, P0Thread1of1ForFork2_#res#1.base, ~__unbuffered_cnt~0] and [455] L838-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (not (= 0 (mod v_~z$w_buff0_used~0_501 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_205 256) 0))) (.cse0 (not (= (mod v_~z$r_buff1_thd0~0_201 256) 0)))) (let ((.cse2 (and (not (= (mod v_~z$w_buff1_used~0_441 256) 0)) .cse0)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_502 256) 0)) .cse5)) (.cse3 (and .cse5 .cse1))) (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_155 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_102) (= (mod v_~main$tmp_guard1~0_56 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43|) (= v_~z$r_buff1_thd0~0_200 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_440 256) 0)) .cse0) (and .cse1 (not (= (mod v_~z$r_buff0_thd0~0_204 256) 0)))) 0 v_~z$r_buff1_thd0~0_201)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_93| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= v_~z$w_buff1_used~0_440 (ite (or .cse2 .cse3) 0 v_~z$w_buff1_used~0_441)) (= (ite .cse4 v_~z$w_buff0~0_305 (ite .cse2 v_~z$w_buff1~0_258 v_~z~0_385)) v_~z~0_384) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47| 0) (= (mod v_~main$tmp_guard0~0_102 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_93| 0)) (= v_~main$tmp_guard1~0_56 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_78 0) (= v_~x~0_70 2) (= v_~__unbuffered_p1_EAX~0_55 0))) 1 0) 0) 0 1)) (= (ite .cse4 0 v_~z$w_buff0_used~0_502) v_~z$w_buff0_used~0_501) (= v_~z$r_buff0_thd0~0_204 (ite .cse3 0 v_~z$r_buff0_thd0~0_205))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_205, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_502, ~z$w_buff0~0=v_~z$w_buff0~0_305, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_201, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_441, ~z$w_buff1~0=v_~z$w_buff1~0_258, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_78, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ~z~0=v_~z~0_385, ~x~0=v_~x~0_70} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_47|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_501, ~z$w_buff0~0=v_~z$w_buff0~0_305, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_59|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_440, ~z$w_buff1~0=v_~z$w_buff1~0_258, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_56, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_102, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_204, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_200, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_93|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_78, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ~z~0=v_~z~0_384, ~x~0=v_~x~0_70, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:19:28,089 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [365] L816-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_26 1) v_~__unbuffered_cnt~0_25) (= |v_P2Thread1of1ForFork1_#res.base_7| 0) (= |v_P2Thread1of1ForFork1_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] and [455] L838-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (not (= 0 (mod v_~z$w_buff0_used~0_501 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_205 256) 0))) (.cse0 (not (= (mod v_~z$r_buff1_thd0~0_201 256) 0)))) (let ((.cse2 (and (not (= (mod v_~z$w_buff1_used~0_441 256) 0)) .cse0)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_502 256) 0)) .cse5)) (.cse3 (and .cse5 .cse1))) (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_155 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_102) (= (mod v_~main$tmp_guard1~0_56 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43|) (= v_~z$r_buff1_thd0~0_200 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_440 256) 0)) .cse0) (and .cse1 (not (= (mod v_~z$r_buff0_thd0~0_204 256) 0)))) 0 v_~z$r_buff1_thd0~0_201)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_93| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= v_~z$w_buff1_used~0_440 (ite (or .cse2 .cse3) 0 v_~z$w_buff1_used~0_441)) (= (ite .cse4 v_~z$w_buff0~0_305 (ite .cse2 v_~z$w_buff1~0_258 v_~z~0_385)) v_~z~0_384) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47| 0) (= (mod v_~main$tmp_guard0~0_102 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_93| 0)) (= v_~main$tmp_guard1~0_56 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_78 0) (= v_~x~0_70 2) (= v_~__unbuffered_p1_EAX~0_55 0))) 1 0) 0) 0 1)) (= (ite .cse4 0 v_~z$w_buff0_used~0_502) v_~z$w_buff0_used~0_501) (= v_~z$r_buff0_thd0~0_204 (ite .cse3 0 v_~z$r_buff0_thd0~0_205))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_205, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_502, ~z$w_buff0~0=v_~z$w_buff0~0_305, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_201, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_441, ~z$w_buff1~0=v_~z$w_buff1~0_258, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_78, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ~z~0=v_~z~0_385, ~x~0=v_~x~0_70} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_47|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_501, ~z$w_buff0~0=v_~z$w_buff0~0_305, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_59|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_440, ~z$w_buff1~0=v_~z$w_buff1~0_258, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_56, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_102, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_204, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_200, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_93|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_78, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ~z~0=v_~z~0_384, ~x~0=v_~x~0_70, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:19:28,322 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [386] L783-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#res.offset_9| 0) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P1Thread1of1ForFork0_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_9|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_9|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] and [455] L838-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (not (= 0 (mod v_~z$w_buff0_used~0_501 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_205 256) 0))) (.cse0 (not (= (mod v_~z$r_buff1_thd0~0_201 256) 0)))) (let ((.cse2 (and (not (= (mod v_~z$w_buff1_used~0_441 256) 0)) .cse0)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_502 256) 0)) .cse5)) (.cse3 (and .cse5 .cse1))) (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_155 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_102) (= (mod v_~main$tmp_guard1~0_56 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43|) (= v_~z$r_buff1_thd0~0_200 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_440 256) 0)) .cse0) (and .cse1 (not (= (mod v_~z$r_buff0_thd0~0_204 256) 0)))) 0 v_~z$r_buff1_thd0~0_201)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_93| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= v_~z$w_buff1_used~0_440 (ite (or .cse2 .cse3) 0 v_~z$w_buff1_used~0_441)) (= (ite .cse4 v_~z$w_buff0~0_305 (ite .cse2 v_~z$w_buff1~0_258 v_~z~0_385)) v_~z~0_384) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47| 0) (= (mod v_~main$tmp_guard0~0_102 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_93| 0)) (= v_~main$tmp_guard1~0_56 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_78 0) (= v_~x~0_70 2) (= v_~__unbuffered_p1_EAX~0_55 0))) 1 0) 0) 0 1)) (= (ite .cse4 0 v_~z$w_buff0_used~0_502) v_~z$w_buff0_used~0_501) (= v_~z$r_buff0_thd0~0_204 (ite .cse3 0 v_~z$r_buff0_thd0~0_205))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_205, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_502, ~z$w_buff0~0=v_~z$w_buff0~0_305, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_201, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_441, ~z$w_buff1~0=v_~z$w_buff1~0_258, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_78, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ~z~0=v_~z~0_385, ~x~0=v_~x~0_70} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_47|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_501, ~z$w_buff0~0=v_~z$w_buff0~0_305, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_59|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_440, ~z$w_buff1~0=v_~z$w_buff1~0_258, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_56, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_102, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_204, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_200, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_93|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_78, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ~z~0=v_~z~0_384, ~x~0=v_~x~0_70, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:19:28,601 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:19:28,602 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1435 [2022-12-06 04:19:28,602 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 203 flow [2022-12-06 04:19:28,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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-06 04:19:28,602 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:28,602 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:28,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:19:28,603 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:19:28,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:28,603 INFO L85 PathProgramCache]: Analyzing trace with hash -2142224883, now seen corresponding path program 1 times [2022-12-06 04:19:28,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:28,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387166506] [2022-12-06 04:19:28,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:28,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:29,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:19:29,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:29,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387166506] [2022-12-06 04:19:29,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387166506] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:29,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:29,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:19:29,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533188289] [2022-12-06 04:19:29,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:29,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:19:29,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:29,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:19:29,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:19:29,179 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2022-12-06 04:19:29,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 203 flow. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:29,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:29,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2022-12-06 04:19:29,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:29,376 INFO L130 PetriNetUnfolder]: 307/593 cut-off events. [2022-12-06 04:19:29,377 INFO L131 PetriNetUnfolder]: For 866/866 co-relation queries the response was YES. [2022-12-06 04:19:29,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1951 conditions, 593 events. 307/593 cut-off events. For 866/866 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3051 event pairs, 23 based on Foata normal form. 3/587 useless extension candidates. Maximal degree in co-relation 1932. Up to 290 conditions per place. [2022-12-06 04:19:29,379 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 44 selfloop transitions, 6 changer transitions 15/70 dead transitions. [2022-12-06 04:19:29,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 70 transitions, 518 flow [2022-12-06 04:19:29,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:19:29,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:19:29,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-12-06 04:19:29,381 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2022-12-06 04:19:29,381 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 203 flow. Second operand 6 states and 62 transitions. [2022-12-06 04:19:29,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 70 transitions, 518 flow [2022-12-06 04:19:29,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 70 transitions, 408 flow, removed 9 selfloop flow, removed 8 redundant places. [2022-12-06 04:19:29,384 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 156 flow [2022-12-06 04:19:29,384 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=156, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2022-12-06 04:19:29,385 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2022-12-06 04:19:29,385 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:29,385 INFO L89 Accepts]: Start accepts. Operand has 39 places, 31 transitions, 156 flow [2022-12-06 04:19:29,385 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:29,385 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:29,385 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 156 flow [2022-12-06 04:19:29,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 156 flow [2022-12-06 04:19:29,393 INFO L130 PetriNetUnfolder]: 22/90 cut-off events. [2022-12-06 04:19:29,394 INFO L131 PetriNetUnfolder]: For 47/51 co-relation queries the response was YES. [2022-12-06 04:19:29,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 90 events. 22/90 cut-off events. For 47/51 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 381 event pairs, 2 based on Foata normal form. 1/86 useless extension candidates. Maximal degree in co-relation 195. Up to 23 conditions per place. [2022-12-06 04:19:29,394 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 31 transitions, 156 flow [2022-12-06 04:19:29,394 INFO L188 LiptonReduction]: Number of co-enabled transitions 222 [2022-12-06 04:19:29,961 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:19:29,962 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 577 [2022-12-06 04:19:29,962 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 158 flow [2022-12-06 04:19:29,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:29,962 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:29,962 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:29,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:19:29,963 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:19:29,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:29,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1458932930, now seen corresponding path program 1 times [2022-12-06 04:19:29,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:29,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624255777] [2022-12-06 04:19:29,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:29,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:30,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:19:30,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:30,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624255777] [2022-12-06 04:19:30,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624255777] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:30,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:30,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:19:30,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219501390] [2022-12-06 04:19:30,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:30,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:19:30,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:30,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:19:30,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:19:30,080 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 04:19:30,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:30,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:30,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 04:19:30,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:30,203 INFO L130 PetriNetUnfolder]: 275/519 cut-off events. [2022-12-06 04:19:30,204 INFO L131 PetriNetUnfolder]: For 762/774 co-relation queries the response was YES. [2022-12-06 04:19:30,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1611 conditions, 519 events. 275/519 cut-off events. For 762/774 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2436 event pairs, 86 based on Foata normal form. 7/519 useless extension candidates. Maximal degree in co-relation 1595. Up to 210 conditions per place. [2022-12-06 04:19:30,206 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 27 selfloop transitions, 1 changer transitions 21/51 dead transitions. [2022-12-06 04:19:30,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 352 flow [2022-12-06 04:19:30,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:19:30,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:19:30,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-06 04:19:30,208 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 04:19:30,208 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 158 flow. Second operand 4 states and 42 transitions. [2022-12-06 04:19:30,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 352 flow [2022-12-06 04:19:30,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 51 transitions, 334 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:19:30,209 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 143 flow [2022-12-06 04:19:30,210 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2022-12-06 04:19:30,211 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2022-12-06 04:19:30,211 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:30,211 INFO L89 Accepts]: Start accepts. Operand has 39 places, 27 transitions, 143 flow [2022-12-06 04:19:30,212 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:30,212 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:30,212 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 27 transitions, 143 flow [2022-12-06 04:19:30,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 27 transitions, 143 flow [2022-12-06 04:19:30,221 INFO L130 PetriNetUnfolder]: 16/77 cut-off events. [2022-12-06 04:19:30,221 INFO L131 PetriNetUnfolder]: For 71/74 co-relation queries the response was YES. [2022-12-06 04:19:30,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 77 events. 16/77 cut-off events. For 71/74 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 315 event pairs, 0 based on Foata normal form. 1/73 useless extension candidates. Maximal degree in co-relation 185. Up to 22 conditions per place. [2022-12-06 04:19:30,222 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 27 transitions, 143 flow [2022-12-06 04:19:30,222 INFO L188 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-06 04:19:30,656 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:19:30,657 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 446 [2022-12-06 04:19:30,657 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 144 flow [2022-12-06 04:19:30,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:30,657 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:30,657 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:30,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:19:30,657 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:19:30,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:30,658 INFO L85 PathProgramCache]: Analyzing trace with hash -534090503, now seen corresponding path program 1 times [2022-12-06 04:19:30,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:30,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435600744] [2022-12-06 04:19:30,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:30,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:19:30,691 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:19:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:19:30,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:19:30,737 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:19:30,737 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 04:19:30,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 04:19:30,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 04:19:30,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 04:19:30,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 04:19:30,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 04:19:30,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:19:30,739 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:30,743 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:19:30,743 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:19:30,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:19:30 BasicIcfg [2022-12-06 04:19:30,798 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:19:30,798 INFO L158 Benchmark]: Toolchain (without parser) took 12303.82ms. Allocated memory was 212.9MB in the beginning and 413.1MB in the end (delta: 200.3MB). Free memory was 168.7MB in the beginning and 282.8MB in the end (delta: -114.1MB). Peak memory consumption was 87.2MB. Max. memory is 8.0GB. [2022-12-06 04:19:30,798 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 212.9MB. Free memory was 189.3MB in the beginning and 189.2MB in the end (delta: 75.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:19:30,799 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.38ms. Allocated memory is still 212.9MB. Free memory was 168.1MB in the beginning and 142.4MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-06 04:19:30,799 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.40ms. Allocated memory is still 212.9MB. Free memory was 141.9MB in the beginning and 139.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:19:30,799 INFO L158 Benchmark]: Boogie Preprocessor took 61.45ms. Allocated memory is still 212.9MB. Free memory was 139.8MB in the beginning and 137.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:19:30,799 INFO L158 Benchmark]: RCFGBuilder took 651.42ms. Allocated memory is still 212.9MB. Free memory was 137.7MB in the beginning and 102.6MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-06 04:19:30,799 INFO L158 Benchmark]: TraceAbstraction took 11033.47ms. Allocated memory was 212.9MB in the beginning and 413.1MB in the end (delta: 200.3MB). Free memory was 101.5MB in the beginning and 282.8MB in the end (delta: -181.3MB). Peak memory consumption was 20.1MB. Max. memory is 8.0GB. [2022-12-06 04:19:30,800 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.10ms. Allocated memory is still 212.9MB. Free memory was 189.3MB in the beginning and 189.2MB in the end (delta: 75.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 482.38ms. Allocated memory is still 212.9MB. Free memory was 168.1MB in the beginning and 142.4MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 67.40ms. Allocated memory is still 212.9MB. Free memory was 141.9MB in the beginning and 139.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 61.45ms. Allocated memory is still 212.9MB. Free memory was 139.8MB in the beginning and 137.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 651.42ms. Allocated memory is still 212.9MB. Free memory was 137.7MB in the beginning and 102.6MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 11033.47ms. Allocated memory was 212.9MB in the beginning and 413.1MB in the end (delta: 200.3MB). Free memory was 101.5MB in the beginning and 282.8MB in the end (delta: -181.3MB). Peak memory consumption was 20.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 113 PlacesBefore, 37 PlacesAfterwards, 105 TransitionsBefore, 28 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 38 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 82 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1531, independent: 1478, independent conditional: 1478, independent unconditional: 0, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1531, independent: 1478, independent conditional: 0, independent unconditional: 1478, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1531, independent: 1478, independent conditional: 0, independent unconditional: 1478, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1531, independent: 1478, independent conditional: 0, independent unconditional: 1478, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1177, independent: 1139, independent conditional: 0, independent unconditional: 1139, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1177, independent: 1131, independent conditional: 0, independent unconditional: 1131, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 46, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 314, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 308, dependent conditional: 0, dependent unconditional: 308, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1531, independent: 339, independent conditional: 0, independent unconditional: 339, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 1177, unknown conditional: 0, unknown unconditional: 1177] , Statistics on independence cache: Total cache size (in pairs): 1810, Positive cache size: 1772, Positive conditional cache size: 0, Positive unconditional cache size: 1772, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 30 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 104, independent: 82, independent conditional: 82, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 104, independent: 82, independent conditional: 15, independent unconditional: 67, dependent: 22, dependent conditional: 5, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 104, independent: 82, independent conditional: 15, independent unconditional: 67, dependent: 22, dependent conditional: 5, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 104, independent: 82, independent conditional: 15, independent unconditional: 67, dependent: 22, dependent conditional: 5, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 93, independent: 75, independent conditional: 14, independent unconditional: 61, dependent: 18, dependent conditional: 4, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 93, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 22, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 18, dependent conditional: 4, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 117, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 113, dependent conditional: 36, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 104, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 93, unknown conditional: 18, unknown unconditional: 75] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 75, Positive conditional cache size: 14, Positive unconditional cache size: 61, Negative cache size: 18, Negative conditional cache size: 4, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 31 PlacesBefore, 31 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 100, independent: 81, independent conditional: 81, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 100, independent: 81, independent conditional: 8, independent unconditional: 73, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 100, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 100, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 23, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 100, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 23, unknown conditional: 0, unknown unconditional: 23] , Statistics on independence cache: Total cache size (in pairs): 116, Positive cache size: 90, Positive conditional cache size: 14, Positive unconditional cache size: 76, Negative cache size: 26, Negative conditional cache size: 4, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 35 PlacesBefore, 35 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 296 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 195, independent: 159, independent conditional: 159, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 195, independent: 159, independent conditional: 46, independent unconditional: 113, dependent: 36, dependent conditional: 4, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 195, independent: 159, independent conditional: 4, independent unconditional: 155, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 195, independent: 159, independent conditional: 4, independent unconditional: 155, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 195, independent: 152, independent conditional: 4, independent unconditional: 148, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 124, Positive cache size: 97, Positive conditional cache size: 14, Positive unconditional cache size: 83, Negative cache size: 27, Negative conditional cache size: 4, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 46, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 316 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 125, independent: 107, independent conditional: 107, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 125, independent: 107, independent conditional: 50, independent unconditional: 57, dependent: 18, dependent conditional: 4, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 125, independent: 107, independent conditional: 2, independent unconditional: 105, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 125, independent: 107, independent conditional: 2, independent unconditional: 105, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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] ], Cache Queries: [ total: 125, independent: 102, independent conditional: 2, independent unconditional: 100, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 130, Positive cache size: 102, Positive conditional cache size: 14, Positive unconditional cache size: 88, Negative cache size: 28, Negative conditional cache size: 4, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 52, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 41 PlacesBefore, 41 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 336 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 90, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 90, independent: 48, independent conditional: 28, independent unconditional: 20, dependent: 42, dependent conditional: 4, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 94, independent: 48, independent conditional: 4, independent unconditional: 44, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 94, independent: 48, independent conditional: 4, independent unconditional: 44, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 94, independent: 48, independent conditional: 4, independent unconditional: 44, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 103, Positive conditional cache size: 14, Positive unconditional cache size: 89, Negative cache size: 33, Negative conditional cache size: 4, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 32, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 44 PlacesBefore, 41 PlacesAfterwards, 35 TransitionsBefore, 32 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 182, independent: 144, independent conditional: 144, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 182, independent: 144, independent conditional: 30, independent unconditional: 114, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 182, independent: 144, independent conditional: 4, independent unconditional: 140, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 182, independent: 144, independent conditional: 4, independent unconditional: 140, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 182, independent: 144, independent conditional: 4, independent unconditional: 140, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 110, Positive conditional cache size: 14, Positive unconditional cache size: 96, Negative cache size: 33, Negative conditional cache size: 4, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 38 PlacesBefore, 37 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 222 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 178, independent: 146, independent conditional: 146, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 178, independent: 146, independent conditional: 146, independent unconditional: 0, dependent: 32, dependent conditional: 28, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 178, independent: 146, independent conditional: 138, independent unconditional: 8, dependent: 32, dependent conditional: 28, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 178, independent: 146, independent conditional: 138, independent unconditional: 8, dependent: 32, dependent conditional: 28, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 70, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 178, independent: 135, independent conditional: 127, independent unconditional: 8, dependent: 28, dependent conditional: 24, dependent unconditional: 4, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 179, Positive cache size: 142, Positive conditional cache size: 25, Positive unconditional cache size: 117, Negative cache size: 37, Negative conditional cache size: 8, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 38 PlacesBefore, 37 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 78, independent: 54, independent conditional: 54, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 78, independent: 54, independent conditional: 26, independent unconditional: 28, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 78, independent: 54, independent conditional: 18, independent unconditional: 36, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 78, independent: 54, independent conditional: 18, independent unconditional: 36, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 78, independent: 51, independent conditional: 16, independent unconditional: 35, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 187, Positive cache size: 149, Positive conditional cache size: 27, Positive unconditional cache size: 122, Negative cache size: 38, Negative conditional cache size: 8, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1385; [L834] FCALL, FORK 0 pthread_create(&t1385, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1385, ((void *)0), P0, ((void *)0))=-1, t1385={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 1 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L835] 0 pthread_t t1386; [L836] FCALL, FORK 0 pthread_create(&t1386, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1386, ((void *)0), P1, ((void *)0))=0, t1385={5:0}, t1386={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L837] 0 pthread_t t1387; [L772] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L838] FCALL, FORK 0 pthread_create(&t1387, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1387, ((void *)0), P2, ((void *)0))=1, t1385={5:0}, t1386={6:0}, t1387={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L792] 3 y = 1 [L795] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 3 z$flush_delayed = weak$$choice2 [L798] 3 z$mem_tmp = z [L799] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L800] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L801] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L802] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L803] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L805] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] 3 __unbuffered_p2_EAX = z [L807] 3 z = z$flush_delayed ? z$mem_tmp : z [L808] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L812] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L813] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L814] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L815] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L840] 1 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 1 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 1 !(!cond) [L842] RET 1 assume_abort_if_not(main$tmp_guard0) [L844] 1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L845] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L846] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L847] 1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L848] 1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L853] CALL 1 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 1 !expression [L18] 1 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 838]: 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: 834]: 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: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 135 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.9s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 255 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 255 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 544 IncrementalHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 5 mSDtfsCounter, 544 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=203occurred in iteration=6, InterpolantAutomatonStates: 34, 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.4s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 501 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-06 04:19:30,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...