/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/mix034_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:13:51,734 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:13:51,736 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:13:51,770 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:13:51,770 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:13:51,773 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:13:51,775 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:13:51,778 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:13:51,782 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:13:51,796 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:13:51,796 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:13:51,797 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:13:51,797 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:13:51,798 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:13:51,798 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:13:51,801 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:13:51,803 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:13:51,803 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:13:51,805 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:13:51,806 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:13:51,807 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:13:51,809 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:13:51,810 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:13:51,810 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:13:51,814 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:13:51,814 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:13:51,815 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:13:51,815 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:13:51,815 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:13:51,816 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:13:51,816 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:13:51,816 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:13:51,817 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:13:51,817 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:13:51,818 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:13:51,818 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:13:51,818 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:13:51,819 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:13:51,819 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:13:51,819 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:13:51,820 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:13:51,825 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:13:51,845 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:13:51,845 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:13:51,846 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:13:51,847 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:13:51,847 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:13:51,847 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:13:51,847 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:13:51,848 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:13:51,848 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:13:51,848 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:13:51,848 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:13:51,848 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:13:51,848 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:13:51,849 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:13:51,849 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:13:51,849 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:13:51,849 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:13:51,849 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:13:51,849 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:13:51,849 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:13:51,849 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:13:51,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:13:51,850 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:13:51,850 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:13:51,850 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:13:51,850 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:13:51,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:13:51,850 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:13:51,850 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:13:52,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:13:52,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:13:52,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:13:52,093 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:13:52,094 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:13:52,095 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_pso.opt_tso.opt.i [2022-12-06 04:13:53,294 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:13:53,617 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:13:53,617 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_pso.opt_tso.opt.i [2022-12-06 04:13:53,630 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0214303e7/a8a8960895ba4edfa3222d8695f0b68d/FLAG73f065ea7 [2022-12-06 04:13:53,641 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0214303e7/a8a8960895ba4edfa3222d8695f0b68d [2022-12-06 04:13:53,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:13:53,643 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:13:53,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:13:53,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:13:53,646 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:13:53,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:13:53" (1/1) ... [2022-12-06 04:13:53,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7de67d00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:53, skipping insertion in model container [2022-12-06 04:13:53,647 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:13:53" (1/1) ... [2022-12-06 04:13:53,652 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:13:53,683 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:13:53,785 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/mix034_pso.opt_tso.opt.i[999,1012] [2022-12-06 04:13:53,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:53,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:53,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:53,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:53,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:53,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:53,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:53,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:53,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:53,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:53,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:53,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:53,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:53,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:53,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:53,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:53,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:53,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:53,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:53,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:53,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:53,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:53,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:53,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:53,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:53,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:53,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:13:53,966 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:13:53,982 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/mix034_pso.opt_tso.opt.i[999,1012] [2022-12-06 04:13:54,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:54,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:54,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:54,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:54,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:54,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:54,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:54,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:54,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:54,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:54,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:54,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:54,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:54,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:54,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:54,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:54,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:54,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:54,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:54,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:54,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:54,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:54,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:54,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:54,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:54,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:54,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:13:54,061 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:13:54,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:54 WrapperNode [2022-12-06 04:13:54,062 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:13:54,063 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:13:54,063 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:13:54,063 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:13:54,068 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:13:54" (1/1) ... [2022-12-06 04:13:54,092 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:13:54" (1/1) ... [2022-12-06 04:13:54,123 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 121 [2022-12-06 04:13:54,123 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:13:54,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:13:54,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:13:54,124 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:13:54,131 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:54" (1/1) ... [2022-12-06 04:13:54,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:54" (1/1) ... [2022-12-06 04:13:54,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:54" (1/1) ... [2022-12-06 04:13:54,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:54" (1/1) ... [2022-12-06 04:13:54,144 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:54" (1/1) ... [2022-12-06 04:13:54,145 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:54" (1/1) ... [2022-12-06 04:13:54,146 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:54" (1/1) ... [2022-12-06 04:13:54,147 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:54" (1/1) ... [2022-12-06 04:13:54,149 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:13:54,156 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:13:54,156 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:13:54,156 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:13:54,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:54" (1/1) ... [2022-12-06 04:13:54,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:13:54,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:13:54,206 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:13:54,254 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:13:54,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:13:54,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:13:54,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:13:54,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:13:54,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:13:54,282 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:13:54,282 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:13:54,282 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:13:54,282 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:13:54,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:13:54,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:13:54,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:13:54,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:13:54,283 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:13:54,369 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:13:54,371 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:13:54,626 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:13:54,717 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:13:54,717 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:13:54,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:13:54 BoogieIcfgContainer [2022-12-06 04:13:54,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:13:54,721 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:13:54,721 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:13:54,723 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:13:54,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:13:53" (1/3) ... [2022-12-06 04:13:54,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fde510e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:13:54, skipping insertion in model container [2022-12-06 04:13:54,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:54" (2/3) ... [2022-12-06 04:13:54,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fde510e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:13:54, skipping insertion in model container [2022-12-06 04:13:54,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:13:54" (3/3) ... [2022-12-06 04:13:54,725 INFO L112 eAbstractionObserver]: Analyzing ICFG mix034_pso.opt_tso.opt.i [2022-12-06 04:13:54,737 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:13:54,737 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:13:54,738 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:13:54,782 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:13:54,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 91 transitions, 192 flow [2022-12-06 04:13:54,859 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2022-12-06 04:13:54,859 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:13:54,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-06 04:13:54,863 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 91 transitions, 192 flow [2022-12-06 04:13:54,868 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 89 transitions, 184 flow [2022-12-06 04:13:54,869 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:13:54,892 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 89 transitions, 184 flow [2022-12-06 04:13:54,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 184 flow [2022-12-06 04:13:54,910 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2022-12-06 04:13:54,910 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:13:54,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-06 04:13:54,912 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 89 transitions, 184 flow [2022-12-06 04:13:54,912 INFO L188 LiptonReduction]: Number of co-enabled transitions 1068 [2022-12-06 04:13:58,211 INFO L203 LiptonReduction]: Total number of compositions: 72 [2022-12-06 04:13:58,223 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:13:58,228 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;@7a05b67e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:13:58,228 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 04:13:58,231 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-06 04:13:58,231 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:13:58,231 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:13:58,232 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 04:13:58,232 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:13:58,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:13:58,236 INFO L85 PathProgramCache]: Analyzing trace with hash 384908072, now seen corresponding path program 1 times [2022-12-06 04:13:58,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:13:58,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668906752] [2022-12-06 04:13:58,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:13:58,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:13:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:13:58,562 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:13:58,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:13:58,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668906752] [2022-12-06 04:13:58,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668906752] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:13:58,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:13:58,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:13:58,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084164496] [2022-12-06 04:13:58,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:13:58,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:13:58,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:13:58,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:13:58,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:13:58,609 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 04:13:58,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:13:58,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:13:58,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 04:13:58,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:13:58,751 INFO L130 PetriNetUnfolder]: 173/326 cut-off events. [2022-12-06 04:13:58,751 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 04:13:58,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 326 events. 173/326 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1285 event pairs, 21 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 632. Up to 249 conditions per place. [2022-12-06 04:13:58,754 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 18 selfloop transitions, 2 changer transitions 4/25 dead transitions. [2022-12-06 04:13:58,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 25 transitions, 104 flow [2022-12-06 04:13:58,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:13:58,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:13:58,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 04:13:58,762 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-06 04:13:58,763 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states and 32 transitions. [2022-12-06 04:13:58,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 25 transitions, 104 flow [2022-12-06 04:13:58,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:13:58,766 INFO L231 Difference]: Finished difference. Result has 24 places, 15 transitions, 38 flow [2022-12-06 04:13:58,767 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=24, PETRI_TRANSITIONS=15} [2022-12-06 04:13:58,769 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, -2 predicate places. [2022-12-06 04:13:58,769 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:13:58,769 INFO L89 Accepts]: Start accepts. Operand has 24 places, 15 transitions, 38 flow [2022-12-06 04:13:58,771 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:13:58,771 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:13:58,771 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 15 transitions, 38 flow [2022-12-06 04:13:58,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 15 transitions, 38 flow [2022-12-06 04:13:58,775 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-06 04:13:58,775 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:13:58,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23 conditions, 15 events. 0/15 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:13:58,775 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 15 transitions, 38 flow [2022-12-06 04:13:58,775 INFO L188 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-06 04:13:58,966 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:13:58,967 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 198 [2022-12-06 04:13:58,967 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 36 flow [2022-12-06 04:13:58,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:13:58,968 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:13:58,968 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:13:58,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:13:58,968 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:13:58,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:13:58,968 INFO L85 PathProgramCache]: Analyzing trace with hash 529482343, now seen corresponding path program 1 times [2022-12-06 04:13:58,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:13:58,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587713280] [2022-12-06 04:13:58,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:13:58,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:13:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:13:59,122 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:13:59,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:13:59,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587713280] [2022-12-06 04:13:59,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587713280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:13:59,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:13:59,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:13:59,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863486721] [2022-12-06 04:13:59,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:13:59,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:13:59,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:13:59,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:13:59,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:13:59,126 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 14 [2022-12-06 04:13:59,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 14 transitions, 36 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:13:59,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:13:59,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 14 [2022-12-06 04:13:59,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:13:59,196 INFO L130 PetriNetUnfolder]: 80/161 cut-off events. [2022-12-06 04:13:59,196 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 04:13:59,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 161 events. 80/161 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 523 event pairs, 20 based on Foata normal form. 4/165 useless extension candidates. Maximal degree in co-relation 326. Up to 117 conditions per place. [2022-12-06 04:13:59,203 INFO L137 encePairwiseOnDemand]: 11/14 looper letters, 16 selfloop transitions, 2 changer transitions 0/19 dead transitions. [2022-12-06 04:13:59,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 19 transitions, 82 flow [2022-12-06 04:13:59,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:13:59,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:13:59,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-12-06 04:13:59,205 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-06 04:13:59,205 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 36 flow. Second operand 3 states and 22 transitions. [2022-12-06 04:13:59,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 19 transitions, 82 flow [2022-12-06 04:13:59,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 19 transitions, 78 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:13:59,207 INFO L231 Difference]: Finished difference. Result has 22 places, 14 transitions, 40 flow [2022-12-06 04:13:59,207 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=22, PETRI_TRANSITIONS=14} [2022-12-06 04:13:59,209 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, -4 predicate places. [2022-12-06 04:13:59,209 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:13:59,209 INFO L89 Accepts]: Start accepts. Operand has 22 places, 14 transitions, 40 flow [2022-12-06 04:13:59,210 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:13:59,210 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:13:59,210 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 22 places, 14 transitions, 40 flow [2022-12-06 04:13:59,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 14 transitions, 40 flow [2022-12-06 04:13:59,215 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2022-12-06 04:13:59,215 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:13:59,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 14 events. 0/14 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:13:59,216 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 14 transitions, 40 flow [2022-12-06 04:13:59,216 INFO L188 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-06 04:13:59,236 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:13:59,237 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-06 04:13:59,238 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 40 flow [2022-12-06 04:13:59,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:13:59,238 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:13:59,239 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:13:59,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:13:59,239 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:13:59,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:13:59,240 INFO L85 PathProgramCache]: Analyzing trace with hash -765915693, now seen corresponding path program 1 times [2022-12-06 04:13:59,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:13:59,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713183937] [2022-12-06 04:13:59,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:13:59,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:13:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:13:59,436 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:13:59,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:13:59,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713183937] [2022-12-06 04:13:59,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713183937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:13:59,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:13:59,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:13:59,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518163681] [2022-12-06 04:13:59,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:13:59,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:13:59,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:13:59,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:13:59,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:13:59,438 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 14 [2022-12-06 04:13:59,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 14 transitions, 40 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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:13:59,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:13:59,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 14 [2022-12-06 04:13:59,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:13:59,517 INFO L130 PetriNetUnfolder]: 49/113 cut-off events. [2022-12-06 04:13:59,517 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 04:13:59,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 113 events. 49/113 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 356 event pairs, 11 based on Foata normal form. 16/129 useless extension candidates. Maximal degree in co-relation 253. Up to 54 conditions per place. [2022-12-06 04:13:59,518 INFO L137 encePairwiseOnDemand]: 9/14 looper letters, 18 selfloop transitions, 3 changer transitions 13/35 dead transitions. [2022-12-06 04:13:59,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 35 transitions, 161 flow [2022-12-06 04:13:59,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:13:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:13:59,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-06 04:13:59,520 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5857142857142857 [2022-12-06 04:13:59,520 INFO L175 Difference]: Start difference. First operand has 22 places, 14 transitions, 40 flow. Second operand 5 states and 41 transitions. [2022-12-06 04:13:59,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 35 transitions, 161 flow [2022-12-06 04:13:59,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 35 transitions, 151 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:13:59,521 INFO L231 Difference]: Finished difference. Result has 27 places, 16 transitions, 63 flow [2022-12-06 04:13:59,521 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=63, PETRI_PLACES=27, PETRI_TRANSITIONS=16} [2022-12-06 04:13:59,522 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 1 predicate places. [2022-12-06 04:13:59,522 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:13:59,522 INFO L89 Accepts]: Start accepts. Operand has 27 places, 16 transitions, 63 flow [2022-12-06 04:13:59,523 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:13:59,523 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:13:59,523 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 16 transitions, 63 flow [2022-12-06 04:13:59,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 16 transitions, 63 flow [2022-12-06 04:13:59,528 INFO L130 PetriNetUnfolder]: 5/26 cut-off events. [2022-12-06 04:13:59,528 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 04:13:59,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 26 events. 5/26 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 44 event pairs, 2 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 55. Up to 12 conditions per place. [2022-12-06 04:13:59,529 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 16 transitions, 63 flow [2022-12-06 04:13:59,529 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-06 04:13:59,530 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:13:59,531 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 04:13:59,531 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 63 flow [2022-12-06 04:13:59,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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:13:59,532 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:13:59,532 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:13:59,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:13:59,532 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:13:59,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:13:59,533 INFO L85 PathProgramCache]: Analyzing trace with hash 2101076021, now seen corresponding path program 1 times [2022-12-06 04:13:59,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:13:59,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423941924] [2022-12-06 04:13:59,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:13:59,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:13:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:13:59,726 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:13:59,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:13:59,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423941924] [2022-12-06 04:13:59,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423941924] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:13:59,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:13:59,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:13:59,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970846956] [2022-12-06 04:13:59,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:13:59,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:13:59,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:13:59,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:13:59,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:13:59,729 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 14 [2022-12-06 04:13:59,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 63 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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:13:59,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:13:59,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 14 [2022-12-06 04:13:59,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:13:59,796 INFO L130 PetriNetUnfolder]: 20/58 cut-off events. [2022-12-06 04:13:59,796 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-06 04:13:59,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 58 events. 20/58 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 127 event pairs, 8 based on Foata normal form. 7/65 useless extension candidates. Maximal degree in co-relation 156. Up to 24 conditions per place. [2022-12-06 04:13:59,797 INFO L137 encePairwiseOnDemand]: 9/14 looper letters, 16 selfloop transitions, 5 changer transitions 7/29 dead transitions. [2022-12-06 04:13:59,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 29 transitions, 159 flow [2022-12-06 04:13:59,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:13:59,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:13:59,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-12-06 04:13:59,799 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2022-12-06 04:13:59,799 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 63 flow. Second operand 6 states and 36 transitions. [2022-12-06 04:13:59,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 29 transitions, 159 flow [2022-12-06 04:13:59,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 29 transitions, 140 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-06 04:13:59,800 INFO L231 Difference]: Finished difference. Result has 30 places, 16 transitions, 70 flow [2022-12-06 04:13:59,801 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=70, PETRI_PLACES=30, PETRI_TRANSITIONS=16} [2022-12-06 04:13:59,801 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2022-12-06 04:13:59,801 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:13:59,802 INFO L89 Accepts]: Start accepts. Operand has 30 places, 16 transitions, 70 flow [2022-12-06 04:13:59,802 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:13:59,803 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:13:59,803 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 16 transitions, 70 flow [2022-12-06 04:13:59,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 16 transitions, 70 flow [2022-12-06 04:13:59,807 INFO L130 PetriNetUnfolder]: 1/16 cut-off events. [2022-12-06 04:13:59,807 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-06 04:13:59,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 16 events. 1/16 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 7 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 32. Up to 6 conditions per place. [2022-12-06 04:13:59,807 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 16 transitions, 70 flow [2022-12-06 04:13:59,807 INFO L188 LiptonReduction]: Number of co-enabled transitions 34 [2022-12-06 04:14:00,269 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:14:00,270 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 469 [2022-12-06 04:14:00,270 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 14 transitions, 66 flow [2022-12-06 04:14:00,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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:14:00,271 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:00,271 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:00,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:14:00,271 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:14:00,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:00,272 INFO L85 PathProgramCache]: Analyzing trace with hash 649455993, now seen corresponding path program 1 times [2022-12-06 04:14:00,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:00,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723973107] [2022-12-06 04:14:00,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:00,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:00,733 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:14:00,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:00,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723973107] [2022-12-06 04:14:00,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723973107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:00,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:00,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:14:00,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695436460] [2022-12-06 04:14:00,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:00,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:14:00,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:00,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:14:00,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:14:00,738 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 12 [2022-12-06 04:14:00,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 14 transitions, 66 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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:14:00,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:00,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 12 [2022-12-06 04:14:00,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:00,875 INFO L130 PetriNetUnfolder]: 23/65 cut-off events. [2022-12-06 04:14:00,875 INFO L131 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2022-12-06 04:14:00,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 65 events. 23/65 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 171 event pairs, 5 based on Foata normal form. 1/66 useless extension candidates. Maximal degree in co-relation 180. Up to 31 conditions per place. [2022-12-06 04:14:00,876 INFO L137 encePairwiseOnDemand]: 5/12 looper letters, 15 selfloop transitions, 9 changer transitions 10/34 dead transitions. [2022-12-06 04:14:00,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 213 flow [2022-12-06 04:14:00,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:14:00,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:14:00,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-12-06 04:14:00,879 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3229166666666667 [2022-12-06 04:14:00,879 INFO L175 Difference]: Start difference. First operand has 26 places, 14 transitions, 66 flow. Second operand 8 states and 31 transitions. [2022-12-06 04:14:00,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 213 flow [2022-12-06 04:14:00,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 34 transitions, 186 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-06 04:14:00,882 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 103 flow [2022-12-06 04:14:00,882 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=12, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=103, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2022-12-06 04:14:00,882 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 6 predicate places. [2022-12-06 04:14:00,883 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:00,883 INFO L89 Accepts]: Start accepts. Operand has 32 places, 21 transitions, 103 flow [2022-12-06 04:14:00,884 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:00,884 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:00,885 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 21 transitions, 103 flow [2022-12-06 04:14:00,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 103 flow [2022-12-06 04:14:00,890 INFO L130 PetriNetUnfolder]: 4/26 cut-off events. [2022-12-06 04:14:00,890 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 04:14:00,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 26 events. 4/26 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 41 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 62. Up to 7 conditions per place. [2022-12-06 04:14:00,890 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 103 flow [2022-12-06 04:14:00,890 INFO L188 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-06 04:14:01,018 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [283] L786-->L789: Formula: (= v_~__unbuffered_p1_EBX~0_1 v_~z~0_2) InVars {~z~0=v_~z~0_2} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_1, ~z~0=v_~z~0_2} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0] and [274] L744-->L760: Formula: (let ((.cse3 (= (mod v_~x$r_buff1_thd1~0_52 256) 0)) (.cse7 (= (mod v_~x$r_buff0_thd1~0_52 256) 0))) (let ((.cse8 (not .cse7)) (.cse5 (and .cse7 (= (mod v_~x$w_buff1_used~0_83 256) 0))) (.cse6 (and .cse7 .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_96 256) 0))) (let ((.cse4 (= (mod v_~x$w_buff1_used~0_82 256) 0)) (.cse1 (= 0 (mod v_~x$w_buff0_used~0_95 256))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0))) (.cse9 (or .cse5 .cse6 .cse11)) (.cse10 (and .cse8 (not .cse11)))) (and (= v_~x$r_buff1_thd1~0_51 (ite .cse0 v_~x$r_buff1_thd1~0_52 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd1~0_51 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse4 .cse2))) v_~x$r_buff1_thd1~0_52 0))) (= v_~x$w_buff1~0_37 v_~x$w_buff1~0_36) (= v_~x$w_buff1_used~0_82 (ite .cse0 v_~x$w_buff1_used~0_83 (ite (or .cse5 .cse1 .cse6) v_~x$w_buff1_used~0_83 0))) (= v_~x~0_68 (ite .cse0 v_~x$mem_tmp~0_24 v_~__unbuffered_p0_EAX~0_14)) (= v_~x$r_buff0_thd1~0_51 (ite .cse0 v_~x$r_buff0_thd1~0_52 (ite (or .cse1 .cse6 (and .cse4 .cse7)) v_~x$r_buff0_thd1~0_52 (ite (and .cse8 (not .cse1)) 0 v_~x$r_buff0_thd1~0_52)))) (= (ite .cse9 v_~x~0_69 (ite .cse10 v_~x$w_buff0~0_46 v_~x$w_buff1~0_37)) v_~__unbuffered_p0_EAX~0_14) (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_7) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_36) (= v_~x$w_buff0~0_46 v_~x$w_buff0~0_45) (= (ite .cse0 v_~x$w_buff0_used~0_96 (ite .cse9 v_~x$w_buff0_used~0_96 (ite .cse10 0 v_~x$w_buff0_used~0_96))) v_~x$w_buff0_used~0_95) (= v_~x~0_69 v_~x$mem_tmp~0_24) (= v_~x$flush_delayed~0_25 0))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_52, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_83, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_52, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_96} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_51, ~x$flush_delayed~0=v_~x$flush_delayed~0_25, ~x$w_buff1~0=v_~x$w_buff1~0_36, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_82, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_51, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_95, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~x~0=v_~x~0_68} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4] [2022-12-06 04:14:01,204 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] $Ultimate##0-->L744: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~z~0_15 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~z~0=v_~z~0_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~z~0, P0Thread1of1ForFork1_~arg.base] and [378] $Ultimate##0-->L786: Formula: (and (= v_~y~0_26 1) (= v_~x$r_buff0_thd2~0_114 1) (= v_~y~0_26 v_~__unbuffered_p1_EAX~0_66) (= v_~x$w_buff0_used~0_251 1) (= v_~x$w_buff0_used~0_252 v_~x$w_buff1_used~0_212) (= v_~x$w_buff0~0_160 v_~x$w_buff1~0_125) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_28| 0)) (= |v_P1Thread1of1ForFork0_~arg#1.base_18| |v_P1Thread1of1ForFork0_#in~arg#1.base_18|) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_28| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_251 256) 0)) (not (= (mod v_~x$w_buff1_used~0_212 256) 0)))) 1 0)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_28| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_28|) (= v_~x$w_buff0~0_159 1) (= v_~x$r_buff0_thd0~0_111 v_~x$r_buff1_thd0~0_115) (= v_~x$r_buff1_thd2~0_86 v_~x$r_buff0_thd2~0_115) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_18| |v_P1Thread1of1ForFork0_~arg#1.offset_18|) (= v_~x$r_buff0_thd1~0_115 v_~x$r_buff1_thd1~0_119)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_160, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_111, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_18|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_115, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_115, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_18|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_252} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_159, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_111, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_28|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_115, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_18|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_18|, ~x$w_buff1~0=v_~x$w_buff1~0_125, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_86, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_212, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_119, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_28|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_114, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_115, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_18|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_251, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_18|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ~y~0=v_~y~0_26} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, ~y~0] [2022-12-06 04:14:01,786 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [383] $Ultimate##0-->L786: Formula: (and (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_37| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_37|) (= v_~x$r_buff0_thd1~0_151 v_~x$r_buff1_thd1~0_157) (= v_~y~0_35 v_~__unbuffered_p1_EAX~0_81) (= v_~x$w_buff0_used~0_314 1) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_268 256) 0)) (not (= (mod v_~x$w_buff0_used~0_314 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_37|) (= v_~z~0_46 1) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_27| |v_P1Thread1of1ForFork0_~arg#1.offset_27|) (= v_~x$w_buff0_used~0_315 v_~x$w_buff1_used~0_268) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_37| 0)) (= |v_P1Thread1of1ForFork0_~arg#1.base_27| |v_P1Thread1of1ForFork0_#in~arg#1.base_27|) (= |v_P0Thread1of1ForFork1_#in~arg.base_13| v_P0Thread1of1ForFork1_~arg.base_13) (= v_~y~0_35 1) (= v_~x$r_buff0_thd2~0_141 v_~x$r_buff1_thd2~0_103) (= v_P0Thread1of1ForFork1_~arg.offset_13 |v_P0Thread1of1ForFork1_#in~arg.offset_13|) (= v_~x$w_buff0~0_210 v_~x$w_buff1~0_169) (= v_~x$w_buff0~0_209 1) (= v_~x$r_buff0_thd2~0_140 1) (= v_~x$r_buff0_thd0~0_136 v_~x$r_buff1_thd0~0_140)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_210, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_136, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_27|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_151, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_141, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_27|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_315} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_209, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_136, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_37|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_151, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_27|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_27|, ~x$w_buff1~0=v_~x$w_buff1~0_169, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_103, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_268, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_157, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_37|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_140, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_140, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_27|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_13, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_314, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_27|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_81, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_13, ~z~0=v_~z~0_46, ~y~0=v_~y~0_35} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P0Thread1of1ForFork1_~arg.offset, ~z~0, ~y~0] and [274] L744-->L760: Formula: (let ((.cse3 (= (mod v_~x$r_buff1_thd1~0_52 256) 0)) (.cse7 (= (mod v_~x$r_buff0_thd1~0_52 256) 0))) (let ((.cse8 (not .cse7)) (.cse5 (and .cse7 (= (mod v_~x$w_buff1_used~0_83 256) 0))) (.cse6 (and .cse7 .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_96 256) 0))) (let ((.cse4 (= (mod v_~x$w_buff1_used~0_82 256) 0)) (.cse1 (= 0 (mod v_~x$w_buff0_used~0_95 256))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0))) (.cse9 (or .cse5 .cse6 .cse11)) (.cse10 (and .cse8 (not .cse11)))) (and (= v_~x$r_buff1_thd1~0_51 (ite .cse0 v_~x$r_buff1_thd1~0_52 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd1~0_51 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse4 .cse2))) v_~x$r_buff1_thd1~0_52 0))) (= v_~x$w_buff1~0_37 v_~x$w_buff1~0_36) (= v_~x$w_buff1_used~0_82 (ite .cse0 v_~x$w_buff1_used~0_83 (ite (or .cse5 .cse1 .cse6) v_~x$w_buff1_used~0_83 0))) (= v_~x~0_68 (ite .cse0 v_~x$mem_tmp~0_24 v_~__unbuffered_p0_EAX~0_14)) (= v_~x$r_buff0_thd1~0_51 (ite .cse0 v_~x$r_buff0_thd1~0_52 (ite (or .cse1 .cse6 (and .cse4 .cse7)) v_~x$r_buff0_thd1~0_52 (ite (and .cse8 (not .cse1)) 0 v_~x$r_buff0_thd1~0_52)))) (= (ite .cse9 v_~x~0_69 (ite .cse10 v_~x$w_buff0~0_46 v_~x$w_buff1~0_37)) v_~__unbuffered_p0_EAX~0_14) (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_7) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_36) (= v_~x$w_buff0~0_46 v_~x$w_buff0~0_45) (= (ite .cse0 v_~x$w_buff0_used~0_96 (ite .cse9 v_~x$w_buff0_used~0_96 (ite .cse10 0 v_~x$w_buff0_used~0_96))) v_~x$w_buff0_used~0_95) (= v_~x~0_69 v_~x$mem_tmp~0_24) (= v_~x$flush_delayed~0_25 0))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_52, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_83, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_52, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_96} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_51, ~x$flush_delayed~0=v_~x$flush_delayed~0_25, ~x$w_buff1~0=v_~x$w_buff1~0_36, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_82, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_51, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_95, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~x~0=v_~x~0_68} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4] [2022-12-06 04:14:02,374 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [386] $Ultimate##0-->L796: Formula: (let ((.cse0 (not (= (mod v_~x$w_buff0_used~0_330 256) 0))) (.cse1 (= (mod v_~x$w_buff0_used~0_332 256) 0)) (.cse2 (not (= (mod v_~x$r_buff0_thd2~0_154 256) 0)))) (and (= v_~x$r_buff0_thd2~0_152 (ite .cse0 0 1)) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_33| |v_P1Thread1of1ForFork0_~arg#1.offset_33|) (= |v_P1Thread1of1ForFork0_~arg#1.base_33| |v_P1Thread1of1ForFork0_#in~arg#1.base_33|) (= v_~y~0_41 1) (= v_~x$w_buff0_used~0_330 0) (= (ite .cse1 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_43|) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_43| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_43|) (= v_~x$r_buff0_thd0~0_142 v_~x$r_buff1_thd0~0_146) (= v_~x$w_buff0~0_225 v_~x~0_251) (= v_~x$r_buff1_thd2~0_109 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_152 256) 0)) .cse0) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_278 256) 0)))) 0 v_~x$r_buff0_thd2~0_154)) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_43| 0)) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_19) (= v_~y~0_41 v_~__unbuffered_p1_EAX~0_87) (= v_~__unbuffered_p1_EBX~0_85 v_~z~0_52) (= v_~x$w_buff0~0_226 v_~x$w_buff1~0_179) (= v_~x$w_buff0~0_225 1) (= v_~x$r_buff0_thd1~0_161 v_~x$r_buff1_thd1~0_167) (= v_~z~0_52 1) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_19|) (= v_~x$w_buff1_used~0_278 (ite (or .cse0 (and (not .cse1) .cse2)) 0 v_~x$w_buff0_used~0_332)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_226, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_142, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_33|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_161, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_154, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_33|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_332} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_225, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_161, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_33|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_167, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_43|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_33|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_33|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_87, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, ~y~0=v_~y~0_41, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_142, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_43|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_33|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_85, ~x$w_buff1~0=v_~x$w_buff1~0_179, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_109, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_278, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_152, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_146, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_330, ~z~0=v_~z~0_52, ~x~0=v_~x~0_251} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P0Thread1of1ForFork1_~arg.offset, ~z~0, ~y~0, ~x~0] and [274] L744-->L760: Formula: (let ((.cse3 (= (mod v_~x$r_buff1_thd1~0_52 256) 0)) (.cse7 (= (mod v_~x$r_buff0_thd1~0_52 256) 0))) (let ((.cse8 (not .cse7)) (.cse5 (and .cse7 (= (mod v_~x$w_buff1_used~0_83 256) 0))) (.cse6 (and .cse7 .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_96 256) 0))) (let ((.cse4 (= (mod v_~x$w_buff1_used~0_82 256) 0)) (.cse1 (= 0 (mod v_~x$w_buff0_used~0_95 256))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0))) (.cse9 (or .cse5 .cse6 .cse11)) (.cse10 (and .cse8 (not .cse11)))) (and (= v_~x$r_buff1_thd1~0_51 (ite .cse0 v_~x$r_buff1_thd1~0_52 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd1~0_51 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse4 .cse2))) v_~x$r_buff1_thd1~0_52 0))) (= v_~x$w_buff1~0_37 v_~x$w_buff1~0_36) (= v_~x$w_buff1_used~0_82 (ite .cse0 v_~x$w_buff1_used~0_83 (ite (or .cse5 .cse1 .cse6) v_~x$w_buff1_used~0_83 0))) (= v_~x~0_68 (ite .cse0 v_~x$mem_tmp~0_24 v_~__unbuffered_p0_EAX~0_14)) (= v_~x$r_buff0_thd1~0_51 (ite .cse0 v_~x$r_buff0_thd1~0_52 (ite (or .cse1 .cse6 (and .cse4 .cse7)) v_~x$r_buff0_thd1~0_52 (ite (and .cse8 (not .cse1)) 0 v_~x$r_buff0_thd1~0_52)))) (= (ite .cse9 v_~x~0_69 (ite .cse10 v_~x$w_buff0~0_46 v_~x$w_buff1~0_37)) v_~__unbuffered_p0_EAX~0_14) (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_7) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_36) (= v_~x$w_buff0~0_46 v_~x$w_buff0~0_45) (= (ite .cse0 v_~x$w_buff0_used~0_96 (ite .cse9 v_~x$w_buff0_used~0_96 (ite .cse10 0 v_~x$w_buff0_used~0_96))) v_~x$w_buff0_used~0_95) (= v_~x~0_69 v_~x$mem_tmp~0_24) (= v_~x$flush_delayed~0_25 0))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_52, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_83, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_52, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_96} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_51, ~x$flush_delayed~0=v_~x$flush_delayed~0_25, ~x$w_buff1~0=v_~x$w_buff1~0_36, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_82, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_51, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_95, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~x~0=v_~x~0_68} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4] [2022-12-06 04:14:02,649 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 04:14:02,650 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1767 [2022-12-06 04:14:02,650 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 17 transitions, 99 flow [2022-12-06 04:14:02,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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:14:02,650 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:02,650 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:02,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:14:02,651 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:14:02,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:02,651 INFO L85 PathProgramCache]: Analyzing trace with hash -824308993, now seen corresponding path program 1 times [2022-12-06 04:14:02,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:02,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799001286] [2022-12-06 04:14:02,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:02,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:02,763 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:14:02,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:02,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799001286] [2022-12-06 04:14:02,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799001286] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:02,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:02,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:14:02,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551257309] [2022-12-06 04:14:02,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:02,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:14:02,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:02,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:14:02,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:14:02,765 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 04:14:02,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 17 transitions, 99 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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:14:02,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:02,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 04:14:02,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:02,813 INFO L130 PetriNetUnfolder]: 15/45 cut-off events. [2022-12-06 04:14:02,814 INFO L131 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2022-12-06 04:14:02,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 45 events. 15/45 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 91 event pairs, 0 based on Foata normal form. 1/46 useless extension candidates. Maximal degree in co-relation 154. Up to 23 conditions per place. [2022-12-06 04:14:02,814 INFO L137 encePairwiseOnDemand]: 6/15 looper letters, 15 selfloop transitions, 5 changer transitions 6/26 dead transitions. [2022-12-06 04:14:02,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 26 transitions, 193 flow [2022-12-06 04:14:02,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:14:02,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:14:02,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2022-12-06 04:14:02,816 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30666666666666664 [2022-12-06 04:14:02,816 INFO L175 Difference]: Start difference. First operand has 27 places, 17 transitions, 99 flow. Second operand 5 states and 23 transitions. [2022-12-06 04:14:02,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 26 transitions, 193 flow [2022-12-06 04:14:02,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 26 transitions, 155 flow, removed 14 selfloop flow, removed 5 redundant places. [2022-12-06 04:14:02,820 INFO L231 Difference]: Finished difference. Result has 28 places, 16 transitions, 79 flow [2022-12-06 04:14:02,820 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=79, PETRI_PLACES=28, PETRI_TRANSITIONS=16} [2022-12-06 04:14:02,822 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2022-12-06 04:14:02,822 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:02,822 INFO L89 Accepts]: Start accepts. Operand has 28 places, 16 transitions, 79 flow [2022-12-06 04:14:02,823 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:02,823 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:02,823 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 16 transitions, 79 flow [2022-12-06 04:14:02,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 16 transitions, 79 flow [2022-12-06 04:14:02,832 INFO L130 PetriNetUnfolder]: 3/26 cut-off events. [2022-12-06 04:14:02,832 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 04:14:02,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 26 events. 3/26 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 41 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 58. Up to 7 conditions per place. [2022-12-06 04:14:02,833 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 16 transitions, 79 flow [2022-12-06 04:14:02,833 INFO L188 LiptonReduction]: Number of co-enabled transitions 16 [2022-12-06 04:14:03,079 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:14:03,080 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 258 [2022-12-06 04:14:03,080 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 16 transitions, 87 flow [2022-12-06 04:14:03,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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:14:03,080 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:03,080 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:03,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:14:03,081 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:14:03,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:03,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1921383479, now seen corresponding path program 2 times [2022-12-06 04:14:03,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:03,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556280263] [2022-12-06 04:14:03,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:03,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:03,207 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:14:03,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:03,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556280263] [2022-12-06 04:14:03,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556280263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:03,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:03,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:14:03,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368039747] [2022-12-06 04:14:03,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:03,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:14:03,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:03,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:14:03,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:14:03,209 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 04:14:03,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 16 transitions, 87 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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:14:03,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:03,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 04:14:03,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:03,248 INFO L130 PetriNetUnfolder]: 13/49 cut-off events. [2022-12-06 04:14:03,249 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2022-12-06 04:14:03,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 49 events. 13/49 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 3 based on Foata normal form. 1/50 useless extension candidates. Maximal degree in co-relation 168. Up to 22 conditions per place. [2022-12-06 04:14:03,249 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 13 selfloop transitions, 1 changer transitions 9/23 dead transitions. [2022-12-06 04:14:03,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 23 transitions, 163 flow [2022-12-06 04:14:03,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:14:03,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:14:03,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-12-06 04:14:03,250 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2022-12-06 04:14:03,250 INFO L175 Difference]: Start difference. First operand has 28 places, 16 transitions, 87 flow. Second operand 4 states and 20 transitions. [2022-12-06 04:14:03,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 23 transitions, 163 flow [2022-12-06 04:14:03,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 23 transitions, 145 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 04:14:03,252 INFO L231 Difference]: Finished difference. Result has 29 places, 12 transitions, 56 flow [2022-12-06 04:14:03,252 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=56, PETRI_PLACES=29, PETRI_TRANSITIONS=12} [2022-12-06 04:14:03,253 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 3 predicate places. [2022-12-06 04:14:03,253 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:03,253 INFO L89 Accepts]: Start accepts. Operand has 29 places, 12 transitions, 56 flow [2022-12-06 04:14:03,254 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:03,254 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:03,254 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 12 transitions, 56 flow [2022-12-06 04:14:03,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 12 transitions, 56 flow [2022-12-06 04:14:03,257 INFO L130 PetriNetUnfolder]: 1/12 cut-off events. [2022-12-06 04:14:03,257 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 04:14:03,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 12 events. 1/12 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 5 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 25. Up to 4 conditions per place. [2022-12-06 04:14:03,257 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 12 transitions, 56 flow [2022-12-06 04:14:03,257 INFO L188 LiptonReduction]: Number of co-enabled transitions 6 [2022-12-06 04:14:03,258 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:14:03,260 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 04:14:03,260 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 12 transitions, 56 flow [2022-12-06 04:14:03,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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:14:03,261 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:03,261 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:03,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:14:03,261 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:14:03,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:03,262 INFO L85 PathProgramCache]: Analyzing trace with hash -734369964, now seen corresponding path program 1 times [2022-12-06 04:14:03,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:03,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855265415] [2022-12-06 04:14:03,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:03,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:03,643 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:14:03,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:03,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855265415] [2022-12-06 04:14:03,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855265415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:03,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:03,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:14:03,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967150892] [2022-12-06 04:14:03,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:03,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:14:03,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:03,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:14:03,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:14:03,644 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 10 [2022-12-06 04:14:03,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 12 transitions, 56 flow. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:14:03,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:03,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 10 [2022-12-06 04:14:03,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:03,698 INFO L130 PetriNetUnfolder]: 4/22 cut-off events. [2022-12-06 04:14:03,698 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-12-06 04:14:03,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 22 events. 4/22 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 32 event pairs, 0 based on Foata normal form. 1/23 useless extension candidates. Maximal degree in co-relation 70. Up to 8 conditions per place. [2022-12-06 04:14:03,698 INFO L137 encePairwiseOnDemand]: 5/10 looper letters, 9 selfloop transitions, 4 changer transitions 5/18 dead transitions. [2022-12-06 04:14:03,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 18 transitions, 124 flow [2022-12-06 04:14:03,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:14:03,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:14:03,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2022-12-06 04:14:03,699 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-06 04:14:03,699 INFO L175 Difference]: Start difference. First operand has 25 places, 12 transitions, 56 flow. Second operand 6 states and 15 transitions. [2022-12-06 04:14:03,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 18 transitions, 124 flow [2022-12-06 04:14:03,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 18 transitions, 118 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 04:14:03,700 INFO L231 Difference]: Finished difference. Result has 28 places, 12 transitions, 63 flow [2022-12-06 04:14:03,700 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=10, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=63, PETRI_PLACES=28, PETRI_TRANSITIONS=12} [2022-12-06 04:14:03,700 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2022-12-06 04:14:03,700 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:03,701 INFO L89 Accepts]: Start accepts. Operand has 28 places, 12 transitions, 63 flow [2022-12-06 04:14:03,701 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:03,701 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:03,701 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 12 transitions, 63 flow [2022-12-06 04:14:03,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 12 transitions, 63 flow [2022-12-06 04:14:03,704 INFO L130 PetriNetUnfolder]: 1/14 cut-off events. [2022-12-06 04:14:03,704 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 04:14:03,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 14 events. 1/14 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 33. Up to 5 conditions per place. [2022-12-06 04:14:03,704 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 12 transitions, 63 flow [2022-12-06 04:14:03,704 INFO L188 LiptonReduction]: Number of co-enabled transitions 2 [2022-12-06 04:14:04,059 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] L789-->P1EXIT: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_130 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_179 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_370 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_371 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff1_used~0_313 256) 0)) .cse3))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_313) v_~x$w_buff1_used~0_312) (= v_~x$r_buff1_thd2~0_129 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_178 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_312 256) 0)))) 0 v_~x$r_buff1_thd2~0_130)) (= (ite .cse4 0 v_~x$w_buff0_used~0_371) v_~x$w_buff0_used~0_370) (= v_~__unbuffered_cnt~0_123 (+ v_~__unbuffered_cnt~0_124 1)) (= v_~x$r_buff0_thd2~0_178 (ite .cse1 0 v_~x$r_buff0_thd2~0_179)) (= |v_P1Thread1of1ForFork0_#res#1.offset_27| 0) (= (ite .cse4 v_~x$w_buff0~0_257 (ite .cse0 v_~x$w_buff1~0_205 v_~x~0_284)) v_~x~0_283) (= |v_P1Thread1of1ForFork0_#res#1.base_27| 0)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_257, ~x$w_buff1~0=v_~x$w_buff1~0_205, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_130, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_313, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_124, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_179, ~x~0=v_~x~0_284, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_371} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_257, ~x$w_buff1~0=v_~x$w_buff1~0_205, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_129, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_312, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123, P1Thread1of1ForFork0_#res#1.base=|v_P1Thread1of1ForFork0_#res#1.base_27|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_178, P1Thread1of1ForFork0_#res#1.offset=|v_P1Thread1of1ForFork0_#res#1.offset_27|, ~x~0=v_~x~0_283, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_370} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res#1.base, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#res#1.offset, ~x~0, ~x$w_buff0_used~0] and [380] L816-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd0~0_137 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_133 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_302 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= 0 (mod v_~x$w_buff0_used~0_303 256))))) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_257 256) 0)) .cse4))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_53| 0)) (= (ite .cse0 0 v_~x$w_buff0_used~0_303) v_~x$w_buff0_used~0_302) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_257) v_~x$w_buff1_used~0_256) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_27| (mod v_~main$tmp_guard0~0_50 256)) (= (mod v_~main$tmp_guard1~0_62 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57|) (= v_~main$tmp_guard0~0_50 (ite (= (ite (= v_~__unbuffered_cnt~0_113 2) 1 0) 0) 0 1)) (= v_~x$r_buff1_thd0~0_136 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_132 256) 0)) .cse3) (and (not (= 0 (mod v_~x$w_buff1_used~0_256 256))) .cse4)) 0 v_~x$r_buff1_thd0~0_137)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_69|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_69| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_53| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_27|) (= v_~x$r_buff0_thd0~0_132 (ite .cse1 0 v_~x$r_buff0_thd0~0_133)) (= (ite .cse0 v_~x$w_buff0~0_201 (ite .cse2 v_~x$w_buff1~0_161 v_~x~0_232)) v_~x~0_231) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_77 0) (= v_~__unbuffered_p0_EAX~0_107 0) (= v_~__unbuffered_p1_EAX~0_79 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_62)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_201, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_133, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_107, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_77, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_79, ~x$w_buff1~0=v_~x$w_buff1~0_161, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_257, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_137, ~x~0=v_~x~0_232, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_303} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_201, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_132, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_69|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_77, ~x$w_buff1~0=v_~x$w_buff1~0_161, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_256, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_62, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_50, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_136, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_302, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_107, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_79, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_53|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_45|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_55|, ~x~0=v_~x~0_231, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_27|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:14:04,381 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:14:04,381 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 681 [2022-12-06 04:14:04,381 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 11 transitions, 74 flow [2022-12-06 04:14:04,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:14:04,382 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:04,382 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:04,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:14:04,382 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:14:04,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:04,382 INFO L85 PathProgramCache]: Analyzing trace with hash 529514893, now seen corresponding path program 1 times [2022-12-06 04:14:04,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:04,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028810114] [2022-12-06 04:14:04,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:04,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:14:04,401 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:14:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:14:04,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:14:04,498 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:14:04,499 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 04:14:04,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-06 04:14:04,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 04:14:04,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 04:14:04,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-06 04:14:04,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:14:04,502 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:04,512 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:14:04,513 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:14:04,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:14:04 BasicIcfg [2022-12-06 04:14:04,576 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:14:04,576 INFO L158 Benchmark]: Toolchain (without parser) took 10932.88ms. Allocated memory was 227.5MB in the beginning and 511.7MB in the end (delta: 284.2MB). Free memory was 202.4MB in the beginning and 473.2MB in the end (delta: -270.8MB). Peak memory consumption was 244.8MB. Max. memory is 8.0GB. [2022-12-06 04:14:04,576 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 227.5MB. Free memory was 203.8MB in the beginning and 203.7MB in the end (delta: 152.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:14:04,577 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.76ms. Allocated memory is still 227.5MB. Free memory was 202.4MB in the beginning and 177.5MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-06 04:14:04,577 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.41ms. Allocated memory is still 227.5MB. Free memory was 177.5MB in the beginning and 174.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:14:04,577 INFO L158 Benchmark]: Boogie Preprocessor took 24.86ms. Allocated memory is still 227.5MB. Free memory was 174.9MB in the beginning and 173.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:14:04,577 INFO L158 Benchmark]: RCFGBuilder took 563.34ms. Allocated memory is still 227.5MB. Free memory was 173.3MB in the beginning and 143.4MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-06 04:14:04,577 INFO L158 Benchmark]: TraceAbstraction took 9855.13ms. Allocated memory was 227.5MB in the beginning and 511.7MB in the end (delta: 284.2MB). Free memory was 142.4MB in the beginning and 473.2MB in the end (delta: -330.8MB). Peak memory consumption was 185.1MB. Max. memory is 8.0GB. [2022-12-06 04:14:04,579 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 227.5MB. Free memory was 203.8MB in the beginning and 203.7MB in the end (delta: 152.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 417.76ms. Allocated memory is still 227.5MB. Free memory was 202.4MB in the beginning and 177.5MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.41ms. Allocated memory is still 227.5MB. Free memory was 177.5MB in the beginning and 174.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.86ms. Allocated memory is still 227.5MB. Free memory was 174.9MB in the beginning and 173.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 563.34ms. Allocated memory is still 227.5MB. Free memory was 173.3MB in the beginning and 143.4MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 9855.13ms. Allocated memory was 227.5MB in the beginning and 511.7MB in the end (delta: 284.2MB). Free memory was 142.4MB in the beginning and 473.2MB in the end (delta: -330.8MB). Peak memory consumption was 185.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 94 PlacesBefore, 26 PlacesAfterwards, 89 TransitionsBefore, 20 TransitionsAfterwards, 1068 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 33 ConcurrentYvCompositions, 1 ChoiceCompositions, 72 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 836, independent: 792, independent conditional: 792, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 836, independent: 792, independent conditional: 0, independent unconditional: 792, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 836, independent: 792, independent conditional: 0, independent unconditional: 792, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 836, independent: 792, independent conditional: 0, independent unconditional: 792, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 701, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 701, independent: 661, independent conditional: 0, independent unconditional: 661, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 40, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 119, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 109, dependent conditional: 0, dependent unconditional: 109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 836, independent: 122, independent conditional: 0, independent unconditional: 122, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 701, unknown conditional: 0, unknown unconditional: 701] , Statistics on independence cache: Total cache size (in pairs): 1088, Positive cache size: 1057, Positive conditional cache size: 0, Positive unconditional cache size: 1057, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 22 PlacesBefore, 21 PlacesAfterwards, 15 TransitionsBefore, 14 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 82, independent: 53, independent conditional: 53, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 82, independent: 53, independent conditional: 3, independent unconditional: 50, dependent: 29, dependent conditional: 3, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 82, independent: 53, independent conditional: 3, independent unconditional: 50, dependent: 29, dependent conditional: 3, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 82, independent: 53, independent conditional: 3, independent unconditional: 50, dependent: 29, dependent conditional: 3, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 39, independent: 28, independent conditional: 2, independent unconditional: 26, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 39, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 70, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 67, dependent conditional: 14, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 82, independent: 25, independent conditional: 1, independent unconditional: 24, dependent: 18, dependent conditional: 1, dependent unconditional: 17, unknown: 39, unknown conditional: 4, unknown unconditional: 35] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 28, Positive conditional cache size: 2, Positive unconditional cache size: 26, Negative cache size: 11, Negative conditional cache size: 2, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 22 PlacesBefore, 22 PlacesAfterwards, 14 TransitionsBefore, 14 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 34, independent: 22, independent conditional: 1, independent unconditional: 21, dependent: 12, dependent conditional: 2, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 29, Positive conditional cache size: 2, Positive unconditional cache size: 27, Negative cache size: 13, Negative conditional cache size: 2, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 25, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 9, dependent conditional: 0, dependent unconditional: 9, 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: 25, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 29, Positive conditional cache size: 2, Positive unconditional cache size: 27, Negative cache size: 13, Negative conditional cache size: 2, Negative unconditional cache size: 11, 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.5s, 28 PlacesBefore, 26 PlacesAfterwards, 16 TransitionsBefore, 14 TransitionsAfterwards, 34 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 46, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 34, Positive conditional cache size: 2, Positive unconditional cache size: 32, Negative cache size: 13, Negative conditional cache size: 2, Negative unconditional cache size: 11, 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: 1.8s, 31 PlacesBefore, 27 PlacesAfterwards, 21 TransitionsBefore, 17 TransitionsAfterwards, 22 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 23, independent: 11, independent conditional: 5, independent unconditional: 6, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23, independent: 11, independent conditional: 2, independent unconditional: 9, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23, independent: 11, independent conditional: 2, independent unconditional: 9, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 23, independent: 10, independent conditional: 2, independent unconditional: 8, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 35, Positive conditional cache size: 2, Positive unconditional cache size: 33, Negative cache size: 13, Negative conditional cache size: 2, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 28 PlacesBefore, 28 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 16 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 42, Positive conditional cache size: 3, Positive unconditional cache size: 39, Negative cache size: 15, Negative conditional cache size: 2, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 12 TransitionsBefore, 12 TransitionsAfterwards, 6 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 42, Positive conditional cache size: 3, Positive unconditional cache size: 39, Negative cache size: 15, Negative conditional cache size: 2, Negative unconditional cache size: 13, 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.7s, 27 PlacesBefore, 26 PlacesAfterwards, 12 TransitionsBefore, 11 TransitionsAfterwards, 2 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 48, Positive conditional cache size: 4, Positive unconditional cache size: 44, Negative cache size: 15, Negative conditional cache size: 2, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L813] 0 pthread_t t903; [L814] FCALL, FORK 0 pthread_create(&t903, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t903, ((void *)0), P0, ((void *)0))=-1, t903={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L815] 0 pthread_t t904; [L816] FCALL, FORK 0 pthread_create(&t904, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t904, ((void *)0), P1, ((void *)0))=0, t903={5:0}, t904={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 [L782] 2 y = 1 [L785] 2 __unbuffered_p1_EAX = y [L788] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L743] 1 z = 1 [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 x$flush_delayed = weak$$choice2 [L749] 1 x$mem_tmp = x [L750] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = x [L758] 1 x = x$flush_delayed ? x$mem_tmp : x [L759] 1 x$flush_delayed = (_Bool)0 [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L818] 2 main$tmp_guard0 = __unbuffered_cnt == 2 [L820] CALL 2 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 2 !(!cond) [L820] RET 2 assume_abort_if_not(main$tmp_guard0) [L822] 2 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L823] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L825] 2 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] 2 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L829] 2 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L831] CALL 2 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 2 !expression [L19] 2 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 110 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 82 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 82 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 387 IncrementalHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 1 mSDtfsCounter, 387 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=5, InterpolantAutomatonStates: 40, 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.7s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 67 ConstructedInterpolants, 0 QuantifiedInterpolants, 351 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:14:04,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...