/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/weaver/chl-name-comparator-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:52:34,800 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:52:34,801 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:52:34,831 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:52:34,832 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:52:34,834 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:52:34,836 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:52:34,839 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:52:34,842 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:52:34,845 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:52:34,846 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:52:34,847 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:52:34,848 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:52:34,849 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:52:34,850 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:52:34,852 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:52:34,853 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:52:34,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:52:34,855 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:52:34,859 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:52:34,861 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:52:34,862 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:52:34,862 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:52:34,863 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:52:34,868 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:52:34,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:52:34,868 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:52:34,869 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:52:34,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:52:34,870 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:52:34,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:52:34,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:52:34,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:52:34,873 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:52:34,874 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:52:34,874 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:52:34,874 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:52:34,874 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:52:34,874 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:52:34,875 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:52:34,875 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:52:34,879 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:52:34,902 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:52:34,903 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:52:34,904 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:52:34,904 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:52:34,904 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:52:34,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:52:34,905 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:52:34,905 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:52:34,905 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:52:34,905 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:52:34,906 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:52:34,906 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:52:34,906 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:52:34,906 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:52:34,906 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:52:34,907 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:52:34,907 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:52:34,907 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:52:34,907 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:52:34,908 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:52:34,908 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:52:34,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:52:34,912 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:52:34,913 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:52:34,913 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:52:34,913 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:52:34,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:52:34,913 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:52:34,913 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:52:35,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:52:35,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:52:35,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:52:35,244 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:52:35,244 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:52:35,245 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-name-comparator-trans.wvr.c [2022-12-05 23:52:36,249 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:52:36,383 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:52:36,383 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-name-comparator-trans.wvr.c [2022-12-05 23:52:36,388 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8bd3d138/8865f56b3afc4acd8a6be80dbf9e659d/FLAG5c09f1ecf [2022-12-05 23:52:36,399 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8bd3d138/8865f56b3afc4acd8a6be80dbf9e659d [2022-12-05 23:52:36,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:52:36,401 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:52:36,402 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:52:36,402 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:52:36,404 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:52:36,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:52:36" (1/1) ... [2022-12-05 23:52:36,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d00dfbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:52:36, skipping insertion in model container [2022-12-05 23:52:36,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:52:36" (1/1) ... [2022-12-05 23:52:36,409 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:52:36,424 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:52:36,541 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-name-comparator-trans.wvr.c[4788,4801] [2022-12-05 23:52:36,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:52:36,554 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:52:36,572 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-name-comparator-trans.wvr.c[4788,4801] [2022-12-05 23:52:36,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:52:36,584 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:52:36,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:52:36 WrapperNode [2022-12-05 23:52:36,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:52:36,585 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:52:36,585 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:52:36,585 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:52:36,589 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:52:36" (1/1) ... [2022-12-05 23:52:36,596 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:52:36" (1/1) ... [2022-12-05 23:52:36,634 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 297 [2022-12-05 23:52:36,635 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:52:36,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:52:36,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:52:36,635 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:52:36,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:52:36" (1/1) ... [2022-12-05 23:52:36,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:52:36" (1/1) ... [2022-12-05 23:52:36,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:52:36" (1/1) ... [2022-12-05 23:52:36,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:52:36" (1/1) ... [2022-12-05 23:52:36,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:52:36" (1/1) ... [2022-12-05 23:52:36,661 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:52:36" (1/1) ... [2022-12-05 23:52:36,662 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:52:36" (1/1) ... [2022-12-05 23:52:36,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:52:36" (1/1) ... [2022-12-05 23:52:36,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:52:36,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:52:36,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:52:36,686 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:52:36,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:52:36" (1/1) ... [2022-12-05 23:52:36,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:52:36,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:52:36,724 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:52:36,765 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:52:36,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:52:36,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:52:36,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:52:36,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 23:52:36,780 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-05 23:52:36,780 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-05 23:52:36,780 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-05 23:52:36,780 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-05 23:52:36,780 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-05 23:52:36,780 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-05 23:52:36,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:52:36,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-05 23:52:36,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:52:36,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:52:36,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:52:36,782 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:52:36,933 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:52:36,935 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:52:37,305 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:52:37,318 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:52:37,319 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-05 23:52:37,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:52:37 BoogieIcfgContainer [2022-12-05 23:52:37,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:52:37,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:52:37,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:52:37,324 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:52:37,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:52:36" (1/3) ... [2022-12-05 23:52:37,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec32d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:52:37, skipping insertion in model container [2022-12-05 23:52:37,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:52:36" (2/3) ... [2022-12-05 23:52:37,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec32d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:52:37, skipping insertion in model container [2022-12-05 23:52:37,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:52:37" (3/3) ... [2022-12-05 23:52:37,326 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-trans.wvr.c [2022-12-05 23:52:37,350 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:52:37,350 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 23:52:37,350 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:52:37,427 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-05 23:52:37,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 325 places, 341 transitions, 706 flow [2022-12-05 23:52:37,621 INFO L130 PetriNetUnfolder]: 26/338 cut-off events. [2022-12-05 23:52:37,621 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 23:52:37,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 338 events. 26/338 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 791 event pairs, 0 based on Foata normal form. 0/311 useless extension candidates. Maximal degree in co-relation 250. Up to 2 conditions per place. [2022-12-05 23:52:37,630 INFO L82 GeneralOperation]: Start removeDead. Operand has 325 places, 341 transitions, 706 flow [2022-12-05 23:52:37,638 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 312 places, 328 transitions, 674 flow [2022-12-05 23:52:37,640 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:52:37,684 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 312 places, 328 transitions, 674 flow [2022-12-05 23:52:37,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 312 places, 328 transitions, 674 flow [2022-12-05 23:52:37,757 INFO L130 PetriNetUnfolder]: 26/328 cut-off events. [2022-12-05 23:52:37,757 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 23:52:37,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 328 events. 26/328 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 786 event pairs, 0 based on Foata normal form. 0/302 useless extension candidates. Maximal degree in co-relation 250. Up to 2 conditions per place. [2022-12-05 23:52:37,771 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 312 places, 328 transitions, 674 flow [2022-12-05 23:52:37,771 INFO L188 LiptonReduction]: Number of co-enabled transitions 27528 [2022-12-05 23:52:49,801 INFO L203 LiptonReduction]: Total number of compositions: 304 [2022-12-05 23:52:49,812 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:52:49,815 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;@5585e6e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:52:49,816 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-05 23:52:49,819 INFO L130 PetriNetUnfolder]: 4/23 cut-off events. [2022-12-05 23:52:49,820 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 23:52:49,820 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:52:49,820 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:52:49,820 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:52:49,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:52:49,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1174101351, now seen corresponding path program 1 times [2022-12-05 23:52:49,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:52:49,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403537934] [2022-12-05 23:52:49,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:52:49,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:52:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:52:50,192 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:52:50,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:52:50,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403537934] [2022-12-05 23:52:50,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403537934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:52:50,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:52:50,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:52:50,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178937378] [2022-12-05 23:52:50,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:52:50,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:52:50,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:52:50,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:52:50,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:52:50,212 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 23:52:50,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:52:50,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:52:50,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 23:52:50,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:52:50,294 INFO L130 PetriNetUnfolder]: 221/328 cut-off events. [2022-12-05 23:52:50,295 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-12-05 23:52:50,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 328 events. 221/328 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 771 event pairs, 138 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 534. Up to 328 conditions per place. [2022-12-05 23:52:50,297 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 23 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2022-12-05 23:52:50,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 118 flow [2022-12-05 23:52:50,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:52:50,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:52:50,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-05 23:52:50,305 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2022-12-05 23:52:50,306 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 66 flow. Second operand 3 states and 26 transitions. [2022-12-05 23:52:50,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 118 flow [2022-12-05 23:52:50,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 25 transitions, 106 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-05 23:52:50,309 INFO L231 Difference]: Finished difference. Result has 27 places, 25 transitions, 66 flow [2022-12-05 23:52:50,310 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=27, PETRI_TRANSITIONS=25} [2022-12-05 23:52:50,314 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2022-12-05 23:52:50,314 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:52:50,315 INFO L89 Accepts]: Start accepts. Operand has 27 places, 25 transitions, 66 flow [2022-12-05 23:52:50,316 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:52:50,317 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:52:50,317 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 25 transitions, 66 flow [2022-12-05 23:52:50,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 25 transitions, 66 flow [2022-12-05 23:52:50,324 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-05 23:52:50,324 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:52:50,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 25 events. 4/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 28. Up to 4 conditions per place. [2022-12-05 23:52:50,324 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 25 transitions, 66 flow [2022-12-05 23:52:50,324 INFO L188 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-05 23:52:51,653 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:52:51,655 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1341 [2022-12-05 23:52:51,655 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 24 transitions, 62 flow [2022-12-05 23:52:51,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:52:51,655 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:52:51,655 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:52:51,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:52:51,656 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:52:51,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:52:51,656 INFO L85 PathProgramCache]: Analyzing trace with hash 920055315, now seen corresponding path program 1 times [2022-12-05 23:52:51,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:52:51,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392416538] [2022-12-05 23:52:51,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:52:51,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:52:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:52:51,716 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:52:51,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:52:51,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392416538] [2022-12-05 23:52:51,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392416538] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:52:51,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:52:51,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:52:51,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348654526] [2022-12-05 23:52:51,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:52:51,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:52:51,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:52:51,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:52:51,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:52:51,718 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 23:52:51,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 24 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:52:51,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:52:51,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 23:52:51,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:52:51,773 INFO L130 PetriNetUnfolder]: 221/328 cut-off events. [2022-12-05 23:52:51,773 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-05 23:52:51,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 678 conditions, 328 events. 221/328 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 775 event pairs, 138 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 670. Up to 328 conditions per place. [2022-12-05 23:52:51,775 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 23 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2022-12-05 23:52:51,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 25 transitions, 116 flow [2022-12-05 23:52:51,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:52:51,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:52:51,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-05 23:52:51,776 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2022-12-05 23:52:51,776 INFO L175 Difference]: Start difference. First operand has 26 places, 24 transitions, 62 flow. Second operand 3 states and 26 transitions. [2022-12-05 23:52:51,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 25 transitions, 116 flow [2022-12-05 23:52:51,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 25 transitions, 106 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-05 23:52:51,777 INFO L231 Difference]: Finished difference. Result has 27 places, 25 transitions, 66 flow [2022-12-05 23:52:51,777 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=27, PETRI_TRANSITIONS=25} [2022-12-05 23:52:51,778 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2022-12-05 23:52:51,778 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:52:51,778 INFO L89 Accepts]: Start accepts. Operand has 27 places, 25 transitions, 66 flow [2022-12-05 23:52:51,780 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:52:51,780 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:52:51,780 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 25 transitions, 66 flow [2022-12-05 23:52:51,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 25 transitions, 66 flow [2022-12-05 23:52:51,783 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-05 23:52:51,783 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:52:51,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 25 events. 4/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 28. Up to 4 conditions per place. [2022-12-05 23:52:51,784 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 25 transitions, 66 flow [2022-12-05 23:52:51,784 INFO L188 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-05 23:52:53,749 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:52:53,750 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1972 [2022-12-05 23:52:53,751 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 24 transitions, 62 flow [2022-12-05 23:52:53,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:52:53,751 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:52:53,751 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:52:53,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:52:53,751 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:52:53,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:52:53,752 INFO L85 PathProgramCache]: Analyzing trace with hash 511231090, now seen corresponding path program 1 times [2022-12-05 23:52:53,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:52:53,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616907505] [2022-12-05 23:52:53,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:52:53,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:52:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:52:53,856 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:52:53,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:52:53,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616907505] [2022-12-05 23:52:53,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616907505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:52:53,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:52:53,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:52:53,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243949933] [2022-12-05 23:52:53,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:52:53,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:52:53,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:52:53,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:52:53,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:52:53,860 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 23:52:53,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 24 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:52:53,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:52:53,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 23:52:53,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:52:53,926 INFO L130 PetriNetUnfolder]: 221/328 cut-off events. [2022-12-05 23:52:53,926 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-05 23:52:53,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 678 conditions, 328 events. 221/328 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 775 event pairs, 138 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 670. Up to 328 conditions per place. [2022-12-05 23:52:53,927 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 23 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2022-12-05 23:52:53,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 25 transitions, 116 flow [2022-12-05 23:52:53,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:52:53,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:52:53,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-05 23:52:53,929 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2022-12-05 23:52:53,929 INFO L175 Difference]: Start difference. First operand has 26 places, 24 transitions, 62 flow. Second operand 3 states and 26 transitions. [2022-12-05 23:52:53,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 25 transitions, 116 flow [2022-12-05 23:52:53,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 25 transitions, 106 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-05 23:52:53,930 INFO L231 Difference]: Finished difference. Result has 27 places, 25 transitions, 66 flow [2022-12-05 23:52:53,930 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=27, PETRI_TRANSITIONS=25} [2022-12-05 23:52:53,931 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2022-12-05 23:52:53,931 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:52:53,931 INFO L89 Accepts]: Start accepts. Operand has 27 places, 25 transitions, 66 flow [2022-12-05 23:52:53,932 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:52:53,932 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:52:53,932 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 25 transitions, 66 flow [2022-12-05 23:52:53,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 25 transitions, 66 flow [2022-12-05 23:52:53,936 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-05 23:52:53,936 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:52:53,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 25 events. 4/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 28. Up to 4 conditions per place. [2022-12-05 23:52:53,936 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 25 transitions, 66 flow [2022-12-05 23:52:53,936 INFO L188 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-05 23:52:55,889 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:52:55,890 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1959 [2022-12-05 23:52:55,890 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 24 transitions, 62 flow [2022-12-05 23:52:55,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:52:55,891 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:52:55,891 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:52:55,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:52:55,891 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:52:55,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:52:55,891 INFO L85 PathProgramCache]: Analyzing trace with hash 102406865, now seen corresponding path program 1 times [2022-12-05 23:52:55,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:52:55,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195094769] [2022-12-05 23:52:55,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:52:55,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:52:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:52:56,149 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:52:56,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:52:56,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195094769] [2022-12-05 23:52:56,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195094769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:52:56,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:52:56,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:52:56,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499536927] [2022-12-05 23:52:56,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:52:56,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:52:56,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:52:56,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:52:56,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:52:56,151 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 23:52:56,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 24 transitions, 62 flow. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:52:56,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:52:56,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 23:52:56,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:52:56,295 INFO L130 PetriNetUnfolder]: 365/538 cut-off events. [2022-12-05 23:52:56,299 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-05 23:52:56,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1103 conditions, 538 events. 365/538 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1609 event pairs, 138 based on Foata normal form. 1/392 useless extension candidates. Maximal degree in co-relation 1095. Up to 328 conditions per place. [2022-12-05 23:52:56,300 INFO L137 encePairwiseOnDemand]: 20/24 looper letters, 34 selfloop transitions, 2 changer transitions 15/51 dead transitions. [2022-12-05 23:52:56,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 51 transitions, 224 flow [2022-12-05 23:52:56,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:52:56,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:52:56,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-05 23:52:56,302 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2022-12-05 23:52:56,302 INFO L175 Difference]: Start difference. First operand has 26 places, 24 transitions, 62 flow. Second operand 4 states and 52 transitions. [2022-12-05 23:52:56,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 51 transitions, 224 flow [2022-12-05 23:52:56,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 51 transitions, 216 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-05 23:52:56,303 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 68 flow [2022-12-05 23:52:56,303 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2022-12-05 23:52:56,304 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2022-12-05 23:52:56,304 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:52:56,304 INFO L89 Accepts]: Start accepts. Operand has 29 places, 25 transitions, 68 flow [2022-12-05 23:52:56,305 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:52:56,305 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:52:56,305 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 25 transitions, 68 flow [2022-12-05 23:52:56,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 25 transitions, 68 flow [2022-12-05 23:52:56,309 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-05 23:52:56,309 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 23:52:56,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 25 events. 4/25 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 32. Up to 4 conditions per place. [2022-12-05 23:52:56,309 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 25 transitions, 68 flow [2022-12-05 23:52:56,309 INFO L188 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-05 23:52:56,403 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:52:56,409 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-05 23:52:56,409 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 64 flow [2022-12-05 23:52:56,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:52:56,410 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:52:56,410 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:52:56,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:52:56,410 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:52:56,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:52:56,410 INFO L85 PathProgramCache]: Analyzing trace with hash 561499399, now seen corresponding path program 1 times [2022-12-05 23:52:56,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:52:56,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502425910] [2022-12-05 23:52:56,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:52:56,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:52:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:52:56,787 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:52:56,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:52:56,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502425910] [2022-12-05 23:52:56,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502425910] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:52:56,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:52:56,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:52:56,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226931522] [2022-12-05 23:52:56,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:52:56,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:52:56,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:52:56,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:52:56,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:52:56,790 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 23:52:56,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 64 flow. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:52:56,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:52:56,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 23:52:56,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:52:56,981 INFO L130 PetriNetUnfolder]: 381/564 cut-off events. [2022-12-05 23:52:56,981 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2022-12-05 23:52:56,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1363 conditions, 564 events. 381/564 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1746 event pairs, 138 based on Foata normal form. 1/414 useless extension candidates. Maximal degree in co-relation 1355. Up to 327 conditions per place. [2022-12-05 23:52:56,983 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 33 selfloop transitions, 3 changer transitions 17/53 dead transitions. [2022-12-05 23:52:56,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 53 transitions, 251 flow [2022-12-05 23:52:56,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:52:56,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:52:56,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-12-05 23:52:56,984 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-05 23:52:56,984 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 64 flow. Second operand 5 states and 54 transitions. [2022-12-05 23:52:56,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 53 transitions, 251 flow [2022-12-05 23:52:56,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 53 transitions, 225 flow, removed 13 selfloop flow, removed 3 redundant places. [2022-12-05 23:52:56,985 INFO L231 Difference]: Finished difference. Result has 30 places, 25 transitions, 70 flow [2022-12-05 23:52:56,985 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=70, PETRI_PLACES=30, PETRI_TRANSITIONS=25} [2022-12-05 23:52:56,986 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2022-12-05 23:52:56,986 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:52:56,986 INFO L89 Accepts]: Start accepts. Operand has 30 places, 25 transitions, 70 flow [2022-12-05 23:52:56,986 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:52:56,986 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:52:56,986 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 25 transitions, 70 flow [2022-12-05 23:52:56,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 25 transitions, 70 flow [2022-12-05 23:52:56,990 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-05 23:52:56,990 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 23:52:56,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 25 events. 4/25 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 33. Up to 4 conditions per place. [2022-12-05 23:52:56,990 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 25 transitions, 70 flow [2022-12-05 23:52:56,990 INFO L188 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-05 23:52:56,996 ERROR L799 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-05 23:52:56,996 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:52:56,997 ERROR L123 eatedLiptonReduction]: Lipton reduction run adaptation of counterexample failed. [2022-12-05 23:52:56,997 INFO L89 Accepts]: Start accepts. Operand has 29 places, 24 transitions, 65 flow [2022-12-05 23:52:56,997 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:52:56,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:52:56,997 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction! at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-05 23:52:57,000 INFO L158 Benchmark]: Toolchain (without parser) took 20598.42ms. Allocated memory was 127.9MB in the beginning and 339.7MB in the end (delta: 211.8MB). Free memory was 101.6MB in the beginning and 251.2MB in the end (delta: -149.5MB). Peak memory consumption was 61.8MB. Max. memory is 8.0GB. [2022-12-05 23:52:57,000 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory is still 105.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:52:57,000 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.36ms. Allocated memory is still 127.9MB. Free memory was 101.6MB in the beginning and 88.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-05 23:52:57,000 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.93ms. Allocated memory is still 127.9MB. Free memory was 88.5MB in the beginning and 85.6MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 23:52:57,000 INFO L158 Benchmark]: Boogie Preprocessor took 49.84ms. Allocated memory is still 127.9MB. Free memory was 85.6MB in the beginning and 83.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:52:57,000 INFO L158 Benchmark]: RCFGBuilder took 635.26ms. Allocated memory was 127.9MB in the beginning and 186.6MB in the end (delta: 58.7MB). Free memory was 83.5MB in the beginning and 155.9MB in the end (delta: -72.4MB). Peak memory consumption was 20.1MB. Max. memory is 8.0GB. [2022-12-05 23:52:57,001 INFO L158 Benchmark]: TraceAbstraction took 19677.27ms. Allocated memory was 186.6MB in the beginning and 339.7MB in the end (delta: 153.1MB). Free memory was 155.4MB in the beginning and 251.2MB in the end (delta: -95.7MB). Peak memory consumption was 57.4MB. Max. memory is 8.0GB. [2022-12-05 23:52:57,001 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory is still 105.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 182.36ms. Allocated memory is still 127.9MB. Free memory was 101.6MB in the beginning and 88.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.93ms. Allocated memory is still 127.9MB. Free memory was 88.5MB in the beginning and 85.6MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.84ms. Allocated memory is still 127.9MB. Free memory was 85.6MB in the beginning and 83.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 635.26ms. Allocated memory was 127.9MB in the beginning and 186.6MB in the end (delta: 58.7MB). Free memory was 83.5MB in the beginning and 155.9MB in the end (delta: -72.4MB). Peak memory consumption was 20.1MB. Max. memory is 8.0GB. * TraceAbstraction took 19677.27ms. Allocated memory was 186.6MB in the beginning and 339.7MB in the end (delta: 153.1MB). Free memory was 155.4MB in the beginning and 251.2MB in the end (delta: -95.7MB). Peak memory consumption was 57.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.0s, 312 PlacesBefore, 30 PlacesAfterwards, 328 TransitionsBefore, 24 TransitionsAfterwards, 27528 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 111 TrivialYvCompositions, 171 ConcurrentYvCompositions, 22 ChoiceCompositions, 304 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17613, independent: 17605, independent conditional: 17605, 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: 17613, independent: 17605, independent conditional: 0, independent unconditional: 17605, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17613, independent: 17605, independent conditional: 0, independent unconditional: 17605, 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: 17613, independent: 17605, independent conditional: 0, independent unconditional: 17605, 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: 15631, independent: 15623, independent conditional: 0, independent unconditional: 15623, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15631, independent: 15623, independent conditional: 0, independent unconditional: 15623, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17613, independent: 1982, independent conditional: 0, independent unconditional: 1982, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15631, unknown conditional: 0, unknown unconditional: 15631] , Statistics on independence cache: Total cache size (in pairs): 33839, Positive cache size: 33831, Positive conditional cache size: 0, Positive unconditional cache size: 33831, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 27 PlacesBefore, 26 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 144 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 2.0s, 27 PlacesBefore, 26 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 144 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 2.0s, 27 PlacesBefore, 26 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 144 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 28 PlacesBefore, 27 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 166 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 0, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 29 PlacesBefore, 29 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 166 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, independent: 14, independent conditional: 3, independent unconditional: 11, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 14, independent conditional: 3, independent unconditional: 11, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 14, independent conditional: 3, independent unconditional: 11, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15, unknown conditional: 4, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 25, Positive conditional cache size: 3, Positive unconditional cache size: 22, Negative cache size: 1, Negative conditional cache size: 1, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - ExceptionOrErrorResult: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction!: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:132) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-05 23:52:57,015 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...