/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe009_pso.oepc_pso.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:13:02,728 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:13:02,729 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:13:02,774 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:13:02,775 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:13:02,778 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:13:02,781 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:13:02,785 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:13:02,790 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:13:02,795 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:13:02,796 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:13:02,797 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:13:02,797 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:13:02,798 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:13:02,798 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:13:02,799 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:13:02,800 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:13:02,801 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:13:02,802 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:13:02,803 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:13:02,804 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:13:02,810 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:13:02,812 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:13:02,814 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:13:02,823 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:13:02,823 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:13:02,824 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:13:02,825 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:13:02,826 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:13:02,826 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:13:02,826 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:13:02,827 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:13:02,828 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:13:02,828 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:13:02,829 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:13:02,829 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:13:02,829 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:13:02,830 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:13:02,830 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:13:02,830 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:13:02,831 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:13:02,835 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 23:13:02,869 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:13:02,870 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:13:02,871 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:13:02,871 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:13:02,871 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:13:02,872 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:13:02,872 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:13:02,872 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:13:02,872 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:13:02,872 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:13:02,872 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:13:02,872 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:13:02,873 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:13:02,873 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:13:02,873 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:13:02,873 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:13:02,873 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:13:02,873 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:13:02,874 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:13:02,874 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:13:02,874 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:13:02,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:13:02,874 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:13:02,874 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:13:02,875 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:13:02,875 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:13:02,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:13:02,875 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:13:02,875 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-05 23:13:03,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:13:03,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:13:03,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:13:03,215 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:13:03,215 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:13:03,216 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe009_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-05 23:13:04,472 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:13:04,788 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:13:04,788 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe009_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-05 23:13:04,801 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4143cf67/97bf844f19ca48c9b2d161870f626f58/FLAGa064617b4 [2022-12-05 23:13:04,818 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4143cf67/97bf844f19ca48c9b2d161870f626f58 [2022-12-05 23:13:04,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:13:04,821 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:13:04,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:13:04,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:13:04,825 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:13:04,825 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:13:04" (1/1) ... [2022-12-05 23:13:04,826 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f51afe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:13:04, skipping insertion in model container [2022-12-05 23:13:04,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:13:04" (1/1) ... [2022-12-05 23:13:04,832 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:13:04,867 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:13:04,989 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/safe009_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2022-12-05 23:13:05,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:05,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:05,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:05,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:05,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:05,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:05,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:05,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:05,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:05,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:05,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:05,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:05,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:05,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:05,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:05,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:05,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:05,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:05,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:05,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:05,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:05,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:05,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:05,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:05,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:05,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:05,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:05,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:05,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:13:05,163 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:13:05,175 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/safe009_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2022-12-05 23:13:05,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:05,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:05,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:05,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:05,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:05,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:05,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:05,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:05,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:05,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:05,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:05,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:05,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:05,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:05,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:05,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:05,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:05,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:05,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:05,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:05,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:05,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:05,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:05,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:05,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:05,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:05,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:05,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:05,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:13:05,262 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:13:05,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:13:05 WrapperNode [2022-12-05 23:13:05,263 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:13:05,264 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:13:05,264 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:13:05,264 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:13:05,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:13:05" (1/1) ... [2022-12-05 23:13:05,287 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:13:05" (1/1) ... [2022-12-05 23:13:05,303 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2022-12-05 23:13:05,304 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:13:05,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:13:05,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:13:05,305 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:13:05,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:13:05" (1/1) ... [2022-12-05 23:13:05,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:13:05" (1/1) ... [2022-12-05 23:13:05,315 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:13:05" (1/1) ... [2022-12-05 23:13:05,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:13:05" (1/1) ... [2022-12-05 23:13:05,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:13:05" (1/1) ... [2022-12-05 23:13:05,322 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:13:05" (1/1) ... [2022-12-05 23:13:05,323 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:13:05" (1/1) ... [2022-12-05 23:13:05,324 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:13:05" (1/1) ... [2022-12-05 23:13:05,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:13:05,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:13:05,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:13:05,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:13:05,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:13:05" (1/1) ... [2022-12-05 23:13:05,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:13:05,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:13:05,356 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-05 23:13:05,368 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-05 23:13:05,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:13:05,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:13:05,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:13:05,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:13:05,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:13:05,392 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:13:05,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:13:05,392 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:13:05,393 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:13:05,393 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 23:13:05,393 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 23:13:05,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:13:05,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:13:05,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:13:05,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:13:05,394 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:13:05,499 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:13:05,500 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:13:05,659 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:13:05,665 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:13:05,665 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:13:05,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:13:05 BoogieIcfgContainer [2022-12-05 23:13:05,681 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:13:05,683 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:13:05,683 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:13:05,686 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:13:05,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:13:04" (1/3) ... [2022-12-05 23:13:05,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@98cb9bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:13:05, skipping insertion in model container [2022-12-05 23:13:05,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:13:05" (2/3) ... [2022-12-05 23:13:05,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@98cb9bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:13:05, skipping insertion in model container [2022-12-05 23:13:05,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:13:05" (3/3) ... [2022-12-05 23:13:05,688 INFO L112 eAbstractionObserver]: Analyzing ICFG safe009_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-05 23:13:05,718 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:13:05,719 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 23:13:05,719 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:13:05,821 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:13:05,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 83 transitions, 181 flow [2022-12-05 23:13:05,944 INFO L130 PetriNetUnfolder]: 2/80 cut-off events. [2022-12-05 23:13:05,944 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:13:05,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 80 events. 2/80 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2022-12-05 23:13:05,949 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 83 transitions, 181 flow [2022-12-05 23:13:05,954 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 68 transitions, 145 flow [2022-12-05 23:13:05,955 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:13:05,987 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 68 transitions, 145 flow [2022-12-05 23:13:05,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 68 transitions, 145 flow [2022-12-05 23:13:06,025 INFO L130 PetriNetUnfolder]: 1/68 cut-off events. [2022-12-05 23:13:06,025 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:13:06,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 68 events. 1/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 35 event pairs, 0 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-05 23:13:06,029 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 68 transitions, 145 flow [2022-12-05 23:13:06,029 INFO L188 LiptonReduction]: Number of co-enabled transitions 988 [2022-12-05 23:13:08,442 INFO L203 LiptonReduction]: Total number of compositions: 52 [2022-12-05 23:13:08,456 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:13:08,461 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;@1e03af2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:13:08,461 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-05 23:13:08,465 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-05 23:13:08,465 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:13:08,465 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:13:08,465 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:13:08,466 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 23:13:08,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:13:08,470 INFO L85 PathProgramCache]: Analyzing trace with hash -2141580155, now seen corresponding path program 1 times [2022-12-05 23:13:08,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:13:08,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903738908] [2022-12-05 23:13:08,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:13:08,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:13:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:13:08,908 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-05 23:13:08,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:13:08,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903738908] [2022-12-05 23:13:08,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903738908] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:13:08,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:13:08,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:13:08,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858434346] [2022-12-05 23:13:08,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:13:08,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:13:08,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:13:08,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:13:08,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:13:08,945 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-05 23:13:08,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 43 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-05 23:13:08,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:13:08,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-05 23:13:08,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:13:09,071 INFO L130 PetriNetUnfolder]: 283/491 cut-off events. [2022-12-05 23:13:09,071 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-05 23:13:09,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1013 conditions, 491 events. 283/491 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2222 event pairs, 113 based on Foata normal form. 19/510 useless extension candidates. Maximal degree in co-relation 1002. Up to 335 conditions per place. [2022-12-05 23:13:09,079 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 21 selfloop transitions, 5 changer transitions 0/27 dead transitions. [2022-12-05 23:13:09,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 27 transitions, 121 flow [2022-12-05 23:13:09,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:13:09,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:13:09,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-05 23:13:09,089 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-05 23:13:09,091 INFO L175 Difference]: Start difference. First operand has 26 places, 17 transitions, 43 flow. Second operand 3 states and 32 transitions. [2022-12-05 23:13:09,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 27 transitions, 121 flow [2022-12-05 23:13:09,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 27 transitions, 116 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 23:13:09,094 INFO L231 Difference]: Finished difference. Result has 26 places, 19 transitions, 67 flow [2022-12-05 23:13:09,096 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=26, PETRI_TRANSITIONS=19} [2022-12-05 23:13:09,099 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 0 predicate places. [2022-12-05 23:13:09,100 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:13:09,100 INFO L89 Accepts]: Start accepts. Operand has 26 places, 19 transitions, 67 flow [2022-12-05 23:13:09,102 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:13:09,103 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:13:09,103 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 19 transitions, 67 flow [2022-12-05 23:13:09,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 19 transitions, 67 flow [2022-12-05 23:13:09,124 INFO L130 PetriNetUnfolder]: 23/83 cut-off events. [2022-12-05 23:13:09,124 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-05 23:13:09,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 83 events. 23/83 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 11 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 147. Up to 44 conditions per place. [2022-12-05 23:13:09,126 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 19 transitions, 67 flow [2022-12-05 23:13:09,126 INFO L188 LiptonReduction]: Number of co-enabled transitions 116 [2022-12-05 23:13:09,143 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:13:09,146 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-05 23:13:09,146 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 67 flow [2022-12-05 23:13:09,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-05 23:13:09,147 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:13:09,147 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:13:09,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:13:09,151 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 23:13:09,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:13:09,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1964476603, now seen corresponding path program 1 times [2022-12-05 23:13:09,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:13:09,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179316450] [2022-12-05 23:13:09,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:13:09,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:13:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:13:09,315 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-05 23:13:09,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:13:09,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179316450] [2022-12-05 23:13:09,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179316450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:13:09,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:13:09,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:13:09,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029713180] [2022-12-05 23:13:09,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:13:09,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:13:09,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:13:09,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:13:09,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:13:09,318 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-05 23:13:09,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 67 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:13:09,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:13:09,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-05 23:13:09,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:13:09,398 INFO L130 PetriNetUnfolder]: 263/455 cut-off events. [2022-12-05 23:13:09,399 INFO L131 PetriNetUnfolder]: For 118/118 co-relation queries the response was YES. [2022-12-05 23:13:09,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1168 conditions, 455 events. 263/455 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1958 event pairs, 37 based on Foata normal form. 5/459 useless extension candidates. Maximal degree in co-relation 1157. Up to 261 conditions per place. [2022-12-05 23:13:09,402 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 27 selfloop transitions, 7 changer transitions 0/35 dead transitions. [2022-12-05 23:13:09,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 35 transitions, 186 flow [2022-12-05 23:13:09,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:13:09,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:13:09,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-05 23:13:09,404 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-05 23:13:09,404 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 67 flow. Second operand 4 states and 36 transitions. [2022-12-05 23:13:09,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 35 transitions, 186 flow [2022-12-05 23:13:09,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 35 transitions, 178 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:13:09,407 INFO L231 Difference]: Finished difference. Result has 30 places, 23 transitions, 106 flow [2022-12-05 23:13:09,407 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=30, PETRI_TRANSITIONS=23} [2022-12-05 23:13:09,408 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2022-12-05 23:13:09,408 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:13:09,408 INFO L89 Accepts]: Start accepts. Operand has 30 places, 23 transitions, 106 flow [2022-12-05 23:13:09,408 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:13:09,408 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:13:09,409 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 23 transitions, 106 flow [2022-12-05 23:13:09,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 23 transitions, 106 flow [2022-12-05 23:13:09,415 INFO L130 PetriNetUnfolder]: 15/60 cut-off events. [2022-12-05 23:13:09,415 INFO L131 PetriNetUnfolder]: For 19/26 co-relation queries the response was YES. [2022-12-05 23:13:09,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 60 events. 15/60 cut-off events. For 19/26 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 199 event pairs, 3 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 136. Up to 33 conditions per place. [2022-12-05 23:13:09,416 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 23 transitions, 106 flow [2022-12-05 23:13:09,416 INFO L188 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-05 23:13:09,421 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:13:09,422 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-05 23:13:09,423 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 23 transitions, 106 flow [2022-12-05 23:13:09,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:13:09,423 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:13:09,423 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:13:09,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:13:09,423 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 23:13:09,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:13:09,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1964475921, now seen corresponding path program 1 times [2022-12-05 23:13:09,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:13:09,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784478161] [2022-12-05 23:13:09,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:13:09,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:13:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:13:09,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:13:09,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:13:09,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784478161] [2022-12-05 23:13:09,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784478161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:13:09,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:13:09,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:13:09,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189328835] [2022-12-05 23:13:09,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:13:09,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:13:09,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:13:09,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:13:09,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:13:09,531 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 16 [2022-12-05 23:13:09,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:13:09,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:13:09,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 16 [2022-12-05 23:13:09,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:13:09,585 INFO L130 PetriNetUnfolder]: 208/385 cut-off events. [2022-12-05 23:13:09,586 INFO L131 PetriNetUnfolder]: For 213/218 co-relation queries the response was YES. [2022-12-05 23:13:09,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1072 conditions, 385 events. 208/385 cut-off events. For 213/218 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1720 event pairs, 100 based on Foata normal form. 12/387 useless extension candidates. Maximal degree in co-relation 1058. Up to 291 conditions per place. [2022-12-05 23:13:09,588 INFO L137 encePairwiseOnDemand]: 13/16 looper letters, 26 selfloop transitions, 4 changer transitions 0/33 dead transitions. [2022-12-05 23:13:09,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 202 flow [2022-12-05 23:13:09,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:13:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:13:09,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-05 23:13:09,590 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.625 [2022-12-05 23:13:09,590 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 106 flow. Second operand 3 states and 30 transitions. [2022-12-05 23:13:09,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 202 flow [2022-12-05 23:13:09,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 33 transitions, 202 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:13:09,592 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 120 flow [2022-12-05 23:13:09,593 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2022-12-05 23:13:09,593 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2022-12-05 23:13:09,593 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:13:09,593 INFO L89 Accepts]: Start accepts. Operand has 33 places, 23 transitions, 120 flow [2022-12-05 23:13:09,594 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:13:09,594 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:13:09,594 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 23 transitions, 120 flow [2022-12-05 23:13:09,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 120 flow [2022-12-05 23:13:09,600 INFO L130 PetriNetUnfolder]: 10/50 cut-off events. [2022-12-05 23:13:09,600 INFO L131 PetriNetUnfolder]: For 32/36 co-relation queries the response was YES. [2022-12-05 23:13:09,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 50 events. 10/50 cut-off events. For 32/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 159 event pairs, 2 based on Foata normal form. 1/49 useless extension candidates. Maximal degree in co-relation 129. Up to 25 conditions per place. [2022-12-05 23:13:09,601 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 23 transitions, 120 flow [2022-12-05 23:13:09,601 INFO L188 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-05 23:13:09,602 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:13:09,603 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-05 23:13:09,603 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 120 flow [2022-12-05 23:13:09,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:13:09,603 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:13:09,604 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:13:09,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:13:09,604 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 23:13:09,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:13:09,604 INFO L85 PathProgramCache]: Analyzing trace with hash -769233105, now seen corresponding path program 1 times [2022-12-05 23:13:09,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:13:09,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978000883] [2022-12-05 23:13:09,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:13:09,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:13:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:13:09,699 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-05 23:13:09,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:13:09,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978000883] [2022-12-05 23:13:09,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978000883] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:13:09,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:13:09,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:13:09,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026069366] [2022-12-05 23:13:09,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:13:09,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:13:09,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:13:09,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:13:09,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:13:09,701 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-05 23:13:09,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:13:09,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:13:09,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-05 23:13:09,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:13:09,799 INFO L130 PetriNetUnfolder]: 297/534 cut-off events. [2022-12-05 23:13:09,799 INFO L131 PetriNetUnfolder]: For 472/472 co-relation queries the response was YES. [2022-12-05 23:13:09,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1541 conditions, 534 events. 297/534 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2554 event pairs, 73 based on Foata normal form. 16/549 useless extension candidates. Maximal degree in co-relation 1524. Up to 218 conditions per place. [2022-12-05 23:13:09,802 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 27 selfloop transitions, 7 changer transitions 6/41 dead transitions. [2022-12-05 23:13:09,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 41 transitions, 254 flow [2022-12-05 23:13:09,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:13:09,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:13:09,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-05 23:13:09,803 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.525 [2022-12-05 23:13:09,803 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 120 flow. Second operand 5 states and 42 transitions. [2022-12-05 23:13:09,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 41 transitions, 254 flow [2022-12-05 23:13:09,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 244 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:13:09,806 INFO L231 Difference]: Finished difference. Result has 37 places, 23 transitions, 139 flow [2022-12-05 23:13:09,806 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=37, PETRI_TRANSITIONS=23} [2022-12-05 23:13:09,807 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2022-12-05 23:13:09,807 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:13:09,807 INFO L89 Accepts]: Start accepts. Operand has 37 places, 23 transitions, 139 flow [2022-12-05 23:13:09,808 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:13:09,808 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:13:09,809 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 23 transitions, 139 flow [2022-12-05 23:13:09,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 23 transitions, 139 flow [2022-12-05 23:13:09,814 INFO L130 PetriNetUnfolder]: 6/44 cut-off events. [2022-12-05 23:13:09,814 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-12-05 23:13:09,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 44 events. 6/44 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 154 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 120. Up to 19 conditions per place. [2022-12-05 23:13:09,815 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 23 transitions, 139 flow [2022-12-05 23:13:09,815 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-05 23:13:09,816 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:13:09,817 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-05 23:13:09,817 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 23 transitions, 139 flow [2022-12-05 23:13:09,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:13:09,818 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:13:09,818 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:13:09,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:13:09,818 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 23:13:09,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:13:09,819 INFO L85 PathProgramCache]: Analyzing trace with hash -769212645, now seen corresponding path program 2 times [2022-12-05 23:13:09,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:13:09,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111492464] [2022-12-05 23:13:09,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:13:09,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:13:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:13:09,905 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-05 23:13:09,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:13:09,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111492464] [2022-12-05 23:13:09,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111492464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:13:09,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:13:09,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:13:09,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885290982] [2022-12-05 23:13:09,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:13:09,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:13:09,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:13:09,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:13:09,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:13:09,907 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-05 23:13:09,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 23 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-05 23:13:09,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:13:09,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-05 23:13:09,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:13:09,990 INFO L130 PetriNetUnfolder]: 173/316 cut-off events. [2022-12-05 23:13:09,990 INFO L131 PetriNetUnfolder]: For 489/489 co-relation queries the response was YES. [2022-12-05 23:13:09,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 316 events. 173/316 cut-off events. For 489/489 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1309 event pairs, 40 based on Foata normal form. 4/318 useless extension candidates. Maximal degree in co-relation 1002. Up to 190 conditions per place. [2022-12-05 23:13:09,992 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 26 selfloop transitions, 8 changer transitions 0/35 dead transitions. [2022-12-05 23:13:09,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 242 flow [2022-12-05 23:13:09,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:13:09,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:13:09,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-12-05 23:13:09,994 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.546875 [2022-12-05 23:13:09,994 INFO L175 Difference]: Start difference. First operand has 37 places, 23 transitions, 139 flow. Second operand 4 states and 35 transitions. [2022-12-05 23:13:09,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 242 flow [2022-12-05 23:13:09,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 35 transitions, 221 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-12-05 23:13:09,997 INFO L231 Difference]: Finished difference. Result has 37 places, 23 transitions, 141 flow [2022-12-05 23:13:09,997 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=37, PETRI_TRANSITIONS=23} [2022-12-05 23:13:09,997 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2022-12-05 23:13:09,998 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:13:09,998 INFO L89 Accepts]: Start accepts. Operand has 37 places, 23 transitions, 141 flow [2022-12-05 23:13:09,999 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:13:09,999 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:13:09,999 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 23 transitions, 141 flow [2022-12-05 23:13:10,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 23 transitions, 141 flow [2022-12-05 23:13:10,004 INFO L130 PetriNetUnfolder]: 5/41 cut-off events. [2022-12-05 23:13:10,004 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-05 23:13:10,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 41 events. 5/41 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 133 event pairs, 1 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 117. Up to 17 conditions per place. [2022-12-05 23:13:10,005 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 23 transitions, 141 flow [2022-12-05 23:13:10,005 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-05 23:13:10,007 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:13:10,008 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-05 23:13:10,008 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 23 transitions, 141 flow [2022-12-05 23:13:10,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-05 23:13:10,008 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:13:10,008 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:13:10,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:13:10,008 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 23:13:10,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:13:10,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1923802118, now seen corresponding path program 1 times [2022-12-05 23:13:10,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:13:10,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454745755] [2022-12-05 23:13:10,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:13:10,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:13:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:13:10,118 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-05 23:13:10,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:13:10,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454745755] [2022-12-05 23:13:10,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454745755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:13:10,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:13:10,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:13:10,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350706717] [2022-12-05 23:13:10,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:13:10,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:13:10,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:13:10,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:13:10,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:13:10,121 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-05 23:13:10,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 23 transitions, 141 flow. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-05 23:13:10,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:13:10,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-05 23:13:10,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:13:10,193 INFO L130 PetriNetUnfolder]: 235/410 cut-off events. [2022-12-05 23:13:10,193 INFO L131 PetriNetUnfolder]: For 590/590 co-relation queries the response was YES. [2022-12-05 23:13:10,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1268 conditions, 410 events. 235/410 cut-off events. For 590/590 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1580 event pairs, 63 based on Foata normal form. 24/434 useless extension candidates. Maximal degree in co-relation 1250. Up to 164 conditions per place. [2022-12-05 23:13:10,195 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 19 selfloop transitions, 4 changer transitions 16/39 dead transitions. [2022-12-05 23:13:10,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 39 transitions, 280 flow [2022-12-05 23:13:10,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:13:10,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:13:10,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-12-05 23:13:10,196 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.425 [2022-12-05 23:13:10,196 INFO L175 Difference]: Start difference. First operand has 37 places, 23 transitions, 141 flow. Second operand 5 states and 34 transitions. [2022-12-05 23:13:10,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 39 transitions, 280 flow [2022-12-05 23:13:10,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 258 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 23:13:10,200 INFO L231 Difference]: Finished difference. Result has 40 places, 16 transitions, 91 flow [2022-12-05 23:13:10,200 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=40, PETRI_TRANSITIONS=16} [2022-12-05 23:13:10,202 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 14 predicate places. [2022-12-05 23:13:10,202 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:13:10,202 INFO L89 Accepts]: Start accepts. Operand has 40 places, 16 transitions, 91 flow [2022-12-05 23:13:10,203 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:13:10,203 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:13:10,203 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 16 transitions, 91 flow [2022-12-05 23:13:10,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 16 transitions, 91 flow [2022-12-05 23:13:10,206 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-05 23:13:10,206 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-05 23:13:10,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 18 events. 0/18 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 8 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2022-12-05 23:13:10,207 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 16 transitions, 91 flow [2022-12-05 23:13:10,207 INFO L188 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-05 23:13:10,212 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [224] $Ultimate##0-->L754: Formula: (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y~0_19 2) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_19, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~y~0] and [202] $Ultimate##0-->L724: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_~__unbuffered_p0_EAX~0_4 v_~y~0_6) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_6} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_4, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_6, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_~arg.base] [2022-12-05 23:13:10,245 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [180] L739-->L742: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0] and [251] $Ultimate##0-->L724: Formula: (and (= |v_P2Thread1of1ForFork0_#in~arg.base_19| v_P2Thread1of1ForFork0_~arg.base_19) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_19| v_P2Thread1of1ForFork0_~arg.offset_19) (= v_~y~0_70 2) (= v_~y~0_70 v_~__unbuffered_p0_EAX~0_50) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_19|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_19|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_50, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_19, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_19|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_19, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~y~0=v_~y~0_70, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_19|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, P0Thread1of1ForFork1_~arg.offset, ~y~0, P0Thread1of1ForFork1_~arg.base] [2022-12-05 23:13:10,352 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [253] $Ultimate##0-->L727: Formula: (and (= v_~y~0_76 2) (= |v_P2Thread1of1ForFork0_#in~arg.base_23| v_P2Thread1of1ForFork0_~arg.base_23) (= v_~y~0_76 v_~__unbuffered_p0_EAX~0_54) (= v_~x~0_39 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_19) (= |v_P2Thread1of1ForFork0_#in~arg.offset_23| v_P2Thread1of1ForFork0_~arg.offset_23) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_19|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_23|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_23|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_23, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_23|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_23, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~y~0=v_~y~0_76, ~x~0=v_~x~0_39, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_23|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, P0Thread1of1ForFork1_~arg.offset, ~y~0, ~x~0, P0Thread1of1ForFork1_~arg.base] and [211] $Ultimate##0-->L739: Formula: (and (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_~__unbuffered_p1_EAX~0_8 v_~x~0_7) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_7} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~__unbuffered_p1_EAX~0] [2022-12-05 23:13:10,414 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [254] L739-->L727: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= v_~x~0_41 1) (= |v_P2Thread1of1ForFork0_#in~arg.base_25| v_P2Thread1of1ForFork0_~arg.base_25) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= v_~y~0_78 v_~__unbuffered_p0_EAX~0_56) (= |v_P2Thread1of1ForFork0_#in~arg.offset_25| v_P2Thread1of1ForFork0_~arg.offset_25) (= v_~y~0_78 2)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_25|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_25|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_56, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_25, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_25|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_25, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~y~0=v_~y~0_78, ~x~0=v_~x~0_41, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_25|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, P0Thread1of1ForFork1_~arg.offset, ~y~0, ~x~0, P0Thread1of1ForFork1_~arg.base] and [211] $Ultimate##0-->L739: Formula: (and (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_~__unbuffered_p1_EAX~0_8 v_~x~0_7) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_7} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~__unbuffered_p1_EAX~0] [2022-12-05 23:13:10,468 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 23:13:10,468 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 266 [2022-12-05 23:13:10,469 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 13 transitions, 96 flow [2022-12-05 23:13:10,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-05 23:13:10,469 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:13:10,469 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:13:10,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:13:10,469 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 23:13:10,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:13:10,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1964474960, now seen corresponding path program 1 times [2022-12-05 23:13:10,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:13:10,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460524146] [2022-12-05 23:13:10,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:13:10,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:13:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:13:10,544 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-05 23:13:10,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:13:10,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460524146] [2022-12-05 23:13:10,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460524146] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:13:10,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:13:10,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:13:10,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487790814] [2022-12-05 23:13:10,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:13:10,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:13:10,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:13:10,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:13:10,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:13:10,546 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-05 23:13:10,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 13 transitions, 96 flow. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:13:10,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:13:10,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-05 23:13:10,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:13:10,574 INFO L130 PetriNetUnfolder]: 7/28 cut-off events. [2022-12-05 23:13:10,574 INFO L131 PetriNetUnfolder]: For 165/165 co-relation queries the response was YES. [2022-12-05 23:13:10,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 28 events. 7/28 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 43 event pairs, 2 based on Foata normal form. 4/32 useless extension candidates. Maximal degree in co-relation 96. Up to 15 conditions per place. [2022-12-05 23:13:10,575 INFO L137 encePairwiseOnDemand]: 8/13 looper letters, 10 selfloop transitions, 3 changer transitions 6/19 dead transitions. [2022-12-05 23:13:10,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 19 transitions, 139 flow [2022-12-05 23:13:10,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:13:10,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:13:10,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-12-05 23:13:10,576 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3230769230769231 [2022-12-05 23:13:10,576 INFO L175 Difference]: Start difference. First operand has 37 places, 13 transitions, 96 flow. Second operand 5 states and 21 transitions. [2022-12-05 23:13:10,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 19 transitions, 139 flow [2022-12-05 23:13:10,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 19 transitions, 89 flow, removed 7 selfloop flow, removed 13 redundant places. [2022-12-05 23:13:10,577 INFO L231 Difference]: Finished difference. Result has 26 places, 13 transitions, 59 flow [2022-12-05 23:13:10,577 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=11, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=59, PETRI_PLACES=26, PETRI_TRANSITIONS=13} [2022-12-05 23:13:10,578 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 0 predicate places. [2022-12-05 23:13:10,578 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:13:10,578 INFO L89 Accepts]: Start accepts. Operand has 26 places, 13 transitions, 59 flow [2022-12-05 23:13:10,578 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:13:10,579 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:13:10,579 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 13 transitions, 59 flow [2022-12-05 23:13:10,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 13 transitions, 59 flow [2022-12-05 23:13:10,582 INFO L130 PetriNetUnfolder]: 5/21 cut-off events. [2022-12-05 23:13:10,582 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-05 23:13:10,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 21 events. 5/21 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 21 event pairs, 2 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 53. Up to 12 conditions per place. [2022-12-05 23:13:10,582 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 13 transitions, 59 flow [2022-12-05 23:13:10,582 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-05 23:13:10,583 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [255] $Ultimate##0-->L739: Formula: (and (= |v_P1Thread1of1ForFork2_#in~arg.base_19| v_P1Thread1of1ForFork2_~arg.base_19) (= v_P0Thread1of1ForFork1_~arg.offset_23 |v_P0Thread1of1ForFork1_#in~arg.offset_23|) (= v_~x~0_43 1) (= v_~y~0_80 v_~__unbuffered_p0_EAX~0_58) (= v_~x~0_43 v_~__unbuffered_p1_EAX~0_54) (= |v_P0Thread1of1ForFork1_#in~arg.base_23| v_P0Thread1of1ForFork1_~arg.base_23) (= |v_P2Thread1of1ForFork0_#in~arg.base_27| v_P2Thread1of1ForFork0_~arg.base_27) (= |v_P1Thread1of1ForFork2_#in~arg.offset_19| v_P1Thread1of1ForFork2_~arg.offset_19) (= v_~y~0_80 2) (= |v_P2Thread1of1ForFork0_#in~arg.offset_27| v_P2Thread1of1ForFork0_~arg.offset_27)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_19|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_27|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_19|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_27|} OutVars{P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_19, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_27|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_27, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_23, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_19|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_19, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_23, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_19|, ~y~0=v_~y~0_80, ~x~0=v_~x~0_43, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_27|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~__unbuffered_p0_EAX~0, P2Thread1of1ForFork0_~arg.base, ~__unbuffered_p1_EAX~0, P2Thread1of1ForFork0_~arg.offset, P0Thread1of1ForFork1_~arg.offset, ~y~0, ~x~0, P0Thread1of1ForFork1_~arg.base] and [242] L727-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_13| 0) (= |v_P0Thread1of1ForFork1_#res.offset_13| 0) (= (+ v_~__unbuffered_cnt~0_88 1) v_~__unbuffered_cnt~0_87)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_13|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-05 23:13:10,658 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:13:10,659 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-05 23:13:10,659 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 13 transitions, 62 flow [2022-12-05 23:13:10,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:13:10,659 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:13:10,659 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:13:10,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:13:10,659 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 23:13:10,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:13:10,660 INFO L85 PathProgramCache]: Analyzing trace with hash -768196279, now seen corresponding path program 1 times [2022-12-05 23:13:10,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:13:10,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644938534] [2022-12-05 23:13:10,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:13:10,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:13:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:13:10,771 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-05 23:13:10,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:13:10,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644938534] [2022-12-05 23:13:10,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644938534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:13:10,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:13:10,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:13:10,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763696391] [2022-12-05 23:13:10,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:13:10,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:13:10,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:13:10,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:13:10,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:13:10,774 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 12 [2022-12-05 23:13:10,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 13 transitions, 62 flow. Second operand has 5 states, 4 states have (on average 2.5) 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-05 23:13:10,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:13:10,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 12 [2022-12-05 23:13:10,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:13:10,812 INFO L130 PetriNetUnfolder]: 2/17 cut-off events. [2022-12-05 23:13:10,812 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-05 23:13:10,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 17 events. 2/17 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 13 event pairs, 0 based on Foata normal form. 3/20 useless extension candidates. Maximal degree in co-relation 58. Up to 10 conditions per place. [2022-12-05 23:13:10,812 INFO L137 encePairwiseOnDemand]: 6/12 looper letters, 8 selfloop transitions, 5 changer transitions 3/16 dead transitions. [2022-12-05 23:13:10,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 16 transitions, 110 flow [2022-12-05 23:13:10,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:13:10,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:13:10,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-12-05 23:13:10,814 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-05 23:13:10,814 INFO L175 Difference]: Start difference. First operand has 24 places, 13 transitions, 62 flow. Second operand 6 states and 18 transitions. [2022-12-05 23:13:10,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 16 transitions, 110 flow [2022-12-05 23:13:10,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 16 transitions, 92 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-05 23:13:10,815 INFO L231 Difference]: Finished difference. Result has 29 places, 13 transitions, 68 flow [2022-12-05 23:13:10,816 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=12, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=68, PETRI_PLACES=29, PETRI_TRANSITIONS=13} [2022-12-05 23:13:10,817 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 3 predicate places. [2022-12-05 23:13:10,817 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:13:10,817 INFO L89 Accepts]: Start accepts. Operand has 29 places, 13 transitions, 68 flow [2022-12-05 23:13:10,817 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:13:10,817 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:13:10,818 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 13 transitions, 68 flow [2022-12-05 23:13:10,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 13 transitions, 68 flow [2022-12-05 23:13:10,821 INFO L130 PetriNetUnfolder]: 1/13 cut-off events. [2022-12-05 23:13:10,821 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-05 23:13:10,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 13 events. 1/13 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 4 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 34. Up to 6 conditions per place. [2022-12-05 23:13:10,821 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 13 transitions, 68 flow [2022-12-05 23:13:10,821 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-05 23:13:10,905 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:13:10,906 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-05 23:13:10,906 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 12 transitions, 66 flow [2022-12-05 23:13:10,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) 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-05 23:13:10,906 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:13:10,906 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:13:10,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:13:10,907 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 23:13:10,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:13:10,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1964441224, now seen corresponding path program 1 times [2022-12-05 23:13:10,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:13:10,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970983425] [2022-12-05 23:13:10,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:13:10,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:13:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:13:11,045 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-05 23:13:11,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:13:11,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970983425] [2022-12-05 23:13:11,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970983425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:13:11,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:13:11,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:13:11,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829349678] [2022-12-05 23:13:11,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:13:11,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:13:11,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:13:11,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:13:11,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:13:11,047 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 11 [2022-12-05 23:13:11,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 12 transitions, 66 flow. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:13:11,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:13:11,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 11 [2022-12-05 23:13:11,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:13:11,063 INFO L130 PetriNetUnfolder]: 1/11 cut-off events. [2022-12-05 23:13:11,063 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-05 23:13:11,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 11 events. 1/11 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 4 event pairs, 0 based on Foata normal form. 1/12 useless extension candidates. Maximal degree in co-relation 42. Up to 7 conditions per place. [2022-12-05 23:13:11,063 INFO L137 encePairwiseOnDemand]: 6/11 looper letters, 0 selfloop transitions, 0 changer transitions 11/11 dead transitions. [2022-12-05 23:13:11,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 11 transitions, 76 flow [2022-12-05 23:13:11,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:13:11,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:13:11,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2022-12-05 23:13:11,065 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21818181818181817 [2022-12-05 23:13:11,065 INFO L175 Difference]: Start difference. First operand has 26 places, 12 transitions, 66 flow. Second operand 5 states and 12 transitions. [2022-12-05 23:13:11,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 11 transitions, 76 flow [2022-12-05 23:13:11,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 11 transitions, 59 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-05 23:13:11,066 INFO L231 Difference]: Finished difference. Result has 25 places, 0 transitions, 0 flow [2022-12-05 23:13:11,066 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=11, PETRI_DIFFERENCE_MINUEND_FLOW=37, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=11, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=25, PETRI_TRANSITIONS=0} [2022-12-05 23:13:11,067 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2022-12-05 23:13:11,067 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:13:11,067 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 0 transitions, 0 flow [2022-12-05 23:13:11,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-05 23:13:11,068 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-05 23:13:11,068 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:13:11,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-05 23:13:11,068 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-05 23:13:11,068 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-05 23:13:11,068 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:13:11,069 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-05 23:13:11,069 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-05 23:13:11,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:13:11,072 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-05 23:13:11,072 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-05 23:13:11,073 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-05 23:13:11,073 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-05 23:13:11,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:13:11,073 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:13:11,076 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:13:11,076 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:13:11,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:13:11 BasicIcfg [2022-12-05 23:13:11,078 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:13:11,079 INFO L158 Benchmark]: Toolchain (without parser) took 6257.61ms. Allocated memory was 196.1MB in the beginning and 302.0MB in the end (delta: 105.9MB). Free memory was 170.0MB in the beginning and 227.4MB in the end (delta: -57.4MB). Peak memory consumption was 49.2MB. Max. memory is 8.0GB. [2022-12-05 23:13:11,079 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 196.1MB. Free memory is still 172.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:13:11,079 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.88ms. Allocated memory is still 196.1MB. Free memory was 169.7MB in the beginning and 146.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-05 23:13:11,079 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.13ms. Allocated memory is still 196.1MB. Free memory was 146.6MB in the beginning and 144.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:13:11,080 INFO L158 Benchmark]: Boogie Preprocessor took 21.92ms. Allocated memory is still 196.1MB. Free memory was 144.5MB in the beginning and 143.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 23:13:11,080 INFO L158 Benchmark]: RCFGBuilder took 353.43ms. Allocated memory is still 196.1MB. Free memory was 142.9MB in the beginning and 129.8MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-05 23:13:11,081 INFO L158 Benchmark]: TraceAbstraction took 5395.49ms. Allocated memory was 196.1MB in the beginning and 302.0MB in the end (delta: 105.9MB). Free memory was 129.3MB in the beginning and 227.4MB in the end (delta: -98.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-12-05 23:13:11,083 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.11ms. Allocated memory is still 196.1MB. Free memory is still 172.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 440.88ms. Allocated memory is still 196.1MB. Free memory was 169.7MB in the beginning and 146.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.13ms. Allocated memory is still 196.1MB. Free memory was 146.6MB in the beginning and 144.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.92ms. Allocated memory is still 196.1MB. Free memory was 144.5MB in the beginning and 143.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 353.43ms. Allocated memory is still 196.1MB. Free memory was 142.9MB in the beginning and 129.8MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 5395.49ms. Allocated memory was 196.1MB in the beginning and 302.0MB in the end (delta: 105.9MB). Free memory was 129.3MB in the beginning and 227.4MB in the end (delta: -98.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 77 PlacesBefore, 26 PlacesAfterwards, 68 TransitionsBefore, 17 TransitionsAfterwards, 988 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 19 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 52 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 664, independent: 630, independent conditional: 630, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 664, independent: 630, independent conditional: 0, independent unconditional: 630, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 664, independent: 630, independent conditional: 0, independent unconditional: 630, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 664, independent: 630, independent conditional: 0, independent unconditional: 630, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 595, independent: 569, independent conditional: 0, independent unconditional: 569, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 595, independent: 560, independent conditional: 0, independent unconditional: 560, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 35, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 105, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 664, independent: 61, independent conditional: 0, independent unconditional: 61, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 595, unknown conditional: 0, unknown unconditional: 595] , Statistics on independence cache: Total cache size (in pairs): 874, Positive cache size: 848, Positive conditional cache size: 0, Positive unconditional cache size: 848, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, 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.0s, 26 PlacesBefore, 26 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 116 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 33, independent conditional: 33, 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: 38, independent: 33, independent conditional: 3, independent unconditional: 30, 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: 38, independent: 33, independent conditional: 1, independent unconditional: 32, 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: 38, independent: 33, independent conditional: 1, independent unconditional: 32, 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: 34, independent: 30, independent conditional: 1, independent unconditional: 29, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 34, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 34, unknown conditional: 1, unknown unconditional: 33] , Statistics on independence cache: Total cache size (in pairs): 34, Positive cache size: 30, Positive conditional cache size: 1, Positive unconditional cache size: 29, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 30 PlacesBefore, 30 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 59, independent: 50, independent conditional: 50, 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: 59, independent: 50, independent conditional: 8, independent unconditional: 42, 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: 59, independent: 50, independent conditional: 5, independent unconditional: 45, 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: 59, independent: 50, independent conditional: 5, independent unconditional: 45, 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: 11, independent: 10, independent conditional: 3, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 59, independent: 40, independent conditional: 2, independent unconditional: 38, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 11, unknown conditional: 3, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 40, Positive conditional cache size: 4, Positive unconditional cache size: 36, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, independent: 45, independent conditional: 45, 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: 54, independent: 45, independent conditional: 7, independent unconditional: 38, 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: 54, independent: 45, independent conditional: 0, independent unconditional: 45, 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: 54, independent: 45, independent conditional: 0, independent unconditional: 45, 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: 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: 54, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 41, Positive conditional cache size: 4, Positive unconditional cache size: 37, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 71, independent: 62, independent conditional: 62, 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: 71, independent: 62, independent conditional: 10, independent unconditional: 52, 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: 71, independent: 62, independent conditional: 0, independent unconditional: 62, 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: 71, independent: 62, independent conditional: 0, independent unconditional: 62, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 71, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 44, Positive conditional cache size: 4, Positive unconditional cache size: 40, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 59, independent: 51, independent conditional: 51, 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: 59, independent: 51, independent conditional: 7, independent unconditional: 44, 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: 59, independent: 51, independent conditional: 1, independent unconditional: 50, 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: 59, independent: 51, independent conditional: 1, independent unconditional: 50, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 59, independent: 44, independent conditional: 1, independent unconditional: 43, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 56, Positive cache size: 51, Positive conditional cache size: 4, Positive unconditional cache size: 47, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 40 PlacesBefore, 37 PlacesAfterwards, 16 TransitionsBefore, 13 TransitionsAfterwards, 38 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30, independent: 19, independent conditional: 16, independent unconditional: 3, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 30, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 63, Positive conditional cache size: 4, Positive unconditional cache size: 59, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 24 PlacesBefore, 24 PlacesAfterwards, 13 TransitionsBefore, 13 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 63, Positive conditional cache size: 4, Positive unconditional cache size: 59, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 27 PlacesBefore, 26 PlacesAfterwards, 13 TransitionsBefore, 12 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 65, Positive conditional cache size: 4, Positive unconditional cache size: 61, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, 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.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 65, Positive conditional cache size: 4, Positive unconditional cache size: 61, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 105 locations, 4 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: 5.2s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 141 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 141 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 280 IncrementalHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 6 mSDtfsCounter, 280 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred 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.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 339 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-05 23:13:11,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...