/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-figure3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:38:10,034 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:38:10,036 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:38:10,054 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:38:10,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:38:10,058 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:38:10,060 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:38:10,063 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:38:10,068 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:38:10,071 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:38:10,072 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:38:10,073 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:38:10,075 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:38:10,078 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:38:10,078 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:38:10,079 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:38:10,080 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:38:10,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:38:10,082 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:38:10,086 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:38:10,086 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:38:10,087 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:38:10,087 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:38:10,088 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:38:10,093 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:38:10,093 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:38:10,093 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:38:10,094 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:38:10,094 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:38:10,095 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:38:10,097 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:38:10,098 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:38:10,098 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:38:10,099 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:38:10,099 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:38:10,099 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:38:10,100 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:38:10,100 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:38:10,100 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:38:10,100 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:38:10,101 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:38:10,105 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:38:10,134 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:38:10,134 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:38:10,135 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:38:10,135 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:38:10,135 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:38:10,136 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:38:10,136 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:38:10,136 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:38:10,136 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:38:10,136 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:38:10,137 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:38:10,137 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:38:10,137 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:38:10,137 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:38:10,137 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:38:10,137 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:38:10,137 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:38:10,138 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:38:10,138 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:38:10,138 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:38:10,138 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:38:10,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:38:10,138 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:38:10,138 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:38:10,138 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:38:10,138 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:38:10,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:38:10,138 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:38:10,138 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 07:38:10,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:38:10,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:38:10,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:38:10,397 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:38:10,399 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:38:10,400 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-figure3.wvr.c [2022-12-06 07:38:11,270 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:38:11,449 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:38:11,449 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-figure3.wvr.c [2022-12-06 07:38:11,453 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f3ebd1cf/0ca291eb7d934c679c7d0ad959376756/FLAG863c8bb8e [2022-12-06 07:38:11,463 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f3ebd1cf/0ca291eb7d934c679c7d0ad959376756 [2022-12-06 07:38:11,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:38:11,465 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:38:11,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:38:11,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:38:11,469 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:38:11,469 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:38:11" (1/1) ... [2022-12-06 07:38:11,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fab25ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:11, skipping insertion in model container [2022-12-06 07:38:11,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:38:11" (1/1) ... [2022-12-06 07:38:11,474 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:38:11,488 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:38:11,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:38:11,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:38:11,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:38:11,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:38:11,587 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/popl20-figure3.wvr.c[2121,2134] [2022-12-06 07:38:11,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:38:11,595 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:38:11,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:38:11,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:38:11,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:38:11,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:38:11,606 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/popl20-figure3.wvr.c[2121,2134] [2022-12-06 07:38:11,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:38:11,616 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:38:11,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:11 WrapperNode [2022-12-06 07:38:11,616 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:38:11,617 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:38:11,617 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:38:11,617 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:38:11,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:11" (1/1) ... [2022-12-06 07:38:11,626 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:11" (1/1) ... [2022-12-06 07:38:11,637 INFO L138 Inliner]: procedures = 21, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 72 [2022-12-06 07:38:11,637 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:38:11,637 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:38:11,637 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:38:11,637 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:38:11,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:11" (1/1) ... [2022-12-06 07:38:11,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:11" (1/1) ... [2022-12-06 07:38:11,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:11" (1/1) ... [2022-12-06 07:38:11,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:11" (1/1) ... [2022-12-06 07:38:11,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:11" (1/1) ... [2022-12-06 07:38:11,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:11" (1/1) ... [2022-12-06 07:38:11,649 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:11" (1/1) ... [2022-12-06 07:38:11,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:11" (1/1) ... [2022-12-06 07:38:11,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:38:11,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:38:11,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:38:11,652 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:38:11,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:11" (1/1) ... [2022-12-06 07:38:11,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:38:11,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:38:11,672 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 07:38:11,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 07:38:11,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:38:11,700 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:38:11,700 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:38:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:38:11,701 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:38:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:38:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:38:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:38:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 07:38:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 07:38:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:38:11,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:38:11,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:38:11,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:38:11,703 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 07:38:11,765 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:38:11,766 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:38:11,919 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:38:11,948 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:38:11,948 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 07:38:11,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:38:11 BoogieIcfgContainer [2022-12-06 07:38:11,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:38:11,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:38:11,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:38:11,953 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:38:11,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:38:11" (1/3) ... [2022-12-06 07:38:11,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@144b77f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:38:11, skipping insertion in model container [2022-12-06 07:38:11,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:11" (2/3) ... [2022-12-06 07:38:11,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@144b77f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:38:11, skipping insertion in model container [2022-12-06 07:38:11,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:38:11" (3/3) ... [2022-12-06 07:38:11,972 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-figure3.wvr.c [2022-12-06 07:38:11,984 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:38:11,984 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:38:11,984 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:38:12,052 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 07:38:12,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 80 transitions, 176 flow [2022-12-06 07:38:12,129 INFO L130 PetriNetUnfolder]: 6/78 cut-off events. [2022-12-06 07:38:12,129 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:38:12,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 78 events. 6/78 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2022-12-06 07:38:12,133 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 80 transitions, 176 flow [2022-12-06 07:38:12,136 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 70 transitions, 152 flow [2022-12-06 07:38:12,137 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:12,148 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 70 transitions, 152 flow [2022-12-06 07:38:12,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 70 transitions, 152 flow [2022-12-06 07:38:12,171 INFO L130 PetriNetUnfolder]: 6/70 cut-off events. [2022-12-06 07:38:12,171 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:38:12,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 70 events. 6/70 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2022-12-06 07:38:12,173 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 70 transitions, 152 flow [2022-12-06 07:38:12,173 INFO L188 LiptonReduction]: Number of co-enabled transitions 500 [2022-12-06 07:38:13,885 INFO L203 LiptonReduction]: Total number of compositions: 55 [2022-12-06 07:38:13,895 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:38:13,899 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;@3d12976b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:38:13,899 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 07:38:13,904 INFO L130 PetriNetUnfolder]: 2/14 cut-off events. [2022-12-06 07:38:13,905 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:38:13,905 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:13,905 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:13,905 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:38:13,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:13,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1374975466, now seen corresponding path program 1 times [2022-12-06 07:38:13,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:13,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160671133] [2022-12-06 07:38:13,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:13,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:14,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:14,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:14,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160671133] [2022-12-06 07:38:14,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160671133] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:14,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:14,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 07:38:14,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500221720] [2022-12-06 07:38:14,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:14,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:38:14,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:14,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:38:14,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:38:14,255 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-06 07:38:14,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:14,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:14,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-06 07:38:14,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:14,323 INFO L130 PetriNetUnfolder]: 49/94 cut-off events. [2022-12-06 07:38:14,323 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 07:38:14,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 94 events. 49/94 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 267 event pairs, 13 based on Foata normal form. 1/69 useless extension candidates. Maximal degree in co-relation 143. Up to 65 conditions per place. [2022-12-06 07:38:14,326 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 16 selfloop transitions, 2 changer transitions 4/24 dead transitions. [2022-12-06 07:38:14,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 24 transitions, 113 flow [2022-12-06 07:38:14,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:38:14,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:38:14,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 07:38:14,334 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-06 07:38:14,335 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 42 flow. Second operand 3 states and 30 transitions. [2022-12-06 07:38:14,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 24 transitions, 113 flow [2022-12-06 07:38:14,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 24 transitions, 99 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 07:38:14,339 INFO L231 Difference]: Finished difference. Result has 19 places, 16 transitions, 48 flow [2022-12-06 07:38:14,340 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=19, PETRI_TRANSITIONS=16} [2022-12-06 07:38:14,345 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, -1 predicate places. [2022-12-06 07:38:14,345 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:14,346 INFO L89 Accepts]: Start accepts. Operand has 19 places, 16 transitions, 48 flow [2022-12-06 07:38:14,348 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:14,349 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:14,349 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 16 transitions, 48 flow [2022-12-06 07:38:14,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 16 transitions, 48 flow [2022-12-06 07:38:14,361 INFO L130 PetriNetUnfolder]: 4/24 cut-off events. [2022-12-06 07:38:14,361 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:38:14,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 24 events. 4/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 31 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 22. Up to 7 conditions per place. [2022-12-06 07:38:14,361 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 19 places, 16 transitions, 48 flow [2022-12-06 07:38:14,362 INFO L188 LiptonReduction]: Number of co-enabled transitions 60 [2022-12-06 07:38:14,362 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:38:14,364 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 07:38:14,364 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 16 transitions, 48 flow [2022-12-06 07:38:14,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:14,365 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:14,365 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:14,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:38:14,369 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:38:14,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:14,369 INFO L85 PathProgramCache]: Analyzing trace with hash -867956374, now seen corresponding path program 1 times [2022-12-06 07:38:14,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:14,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078272611] [2022-12-06 07:38:14,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:14,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:14,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:14,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:14,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078272611] [2022-12-06 07:38:14,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078272611] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:14,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:14,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:38:14,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885980033] [2022-12-06 07:38:14,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:14,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:38:14,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:14,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:38:14,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:38:14,480 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 07:38:14,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 16 transitions, 48 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:14,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:14,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 07:38:14,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:14,560 INFO L130 PetriNetUnfolder]: 72/149 cut-off events. [2022-12-06 07:38:14,561 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-06 07:38:14,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 149 events. 72/149 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 467 event pairs, 24 based on Foata normal form. 6/155 useless extension candidates. Maximal degree in co-relation 177. Up to 78 conditions per place. [2022-12-06 07:38:14,562 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 28 selfloop transitions, 3 changer transitions 6/37 dead transitions. [2022-12-06 07:38:14,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 37 transitions, 178 flow [2022-12-06 07:38:14,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:38:14,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:38:14,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-12-06 07:38:14,563 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2022-12-06 07:38:14,564 INFO L175 Difference]: Start difference. First operand has 19 places, 16 transitions, 48 flow. Second operand 5 states and 37 transitions. [2022-12-06 07:38:14,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 37 transitions, 178 flow [2022-12-06 07:38:14,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 37 transitions, 175 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:38:14,565 INFO L231 Difference]: Finished difference. Result has 25 places, 18 transitions, 74 flow [2022-12-06 07:38:14,565 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=74, PETRI_PLACES=25, PETRI_TRANSITIONS=18} [2022-12-06 07:38:14,566 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 5 predicate places. [2022-12-06 07:38:14,566 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:14,566 INFO L89 Accepts]: Start accepts. Operand has 25 places, 18 transitions, 74 flow [2022-12-06 07:38:14,567 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:14,567 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:14,567 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 18 transitions, 74 flow [2022-12-06 07:38:14,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 18 transitions, 74 flow [2022-12-06 07:38:14,575 INFO L130 PetriNetUnfolder]: 3/27 cut-off events. [2022-12-06 07:38:14,575 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:38:14,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 27 events. 3/27 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 45 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 34. Up to 8 conditions per place. [2022-12-06 07:38:14,576 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 18 transitions, 74 flow [2022-12-06 07:38:14,576 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-06 07:38:14,674 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:14,675 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 109 [2022-12-06 07:38:14,676 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 71 flow [2022-12-06 07:38:14,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:14,676 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:14,676 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:14,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:38:14,676 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:38:14,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:14,678 INFO L85 PathProgramCache]: Analyzing trace with hash 883944601, now seen corresponding path program 1 times [2022-12-06 07:38:14,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:14,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387576947] [2022-12-06 07:38:14,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:14,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:14,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:14,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:14,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:14,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387576947] [2022-12-06 07:38:14,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387576947] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:38:14,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399151371] [2022-12-06 07:38:14,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:14,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:38:14,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:38:14,765 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:38:14,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 07:38:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:14,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 07:38:14,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:38:14,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:14,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:38:14,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:14,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399151371] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 07:38:14,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 07:38:14,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2022-12-06 07:38:14,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554593447] [2022-12-06 07:38:14,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:14,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:38:14,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:14,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:38:14,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:14,913 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-06 07:38:14,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:14,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:14,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-06 07:38:14,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:14,963 INFO L130 PetriNetUnfolder]: 42/87 cut-off events. [2022-12-06 07:38:14,963 INFO L131 PetriNetUnfolder]: For 143/145 co-relation queries the response was YES. [2022-12-06 07:38:14,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 87 events. 42/87 cut-off events. For 143/145 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 214 event pairs, 18 based on Foata normal form. 6/89 useless extension candidates. Maximal degree in co-relation 96. Up to 56 conditions per place. [2022-12-06 07:38:14,964 INFO L137 encePairwiseOnDemand]: 14/16 looper letters, 17 selfloop transitions, 1 changer transitions 5/24 dead transitions. [2022-12-06 07:38:14,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 24 transitions, 134 flow [2022-12-06 07:38:14,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:38:14,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:38:14,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-12-06 07:38:14,965 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-06 07:38:14,965 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 71 flow. Second operand 3 states and 27 transitions. [2022-12-06 07:38:14,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 24 transitions, 134 flow [2022-12-06 07:38:14,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 24 transitions, 119 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:14,966 INFO L231 Difference]: Finished difference. Result has 22 places, 16 transitions, 54 flow [2022-12-06 07:38:14,966 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=22, PETRI_TRANSITIONS=16} [2022-12-06 07:38:14,966 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 2 predicate places. [2022-12-06 07:38:14,966 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:14,967 INFO L89 Accepts]: Start accepts. Operand has 22 places, 16 transitions, 54 flow [2022-12-06 07:38:14,967 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:14,967 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:14,967 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 22 places, 16 transitions, 54 flow [2022-12-06 07:38:14,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 16 transitions, 54 flow [2022-12-06 07:38:14,969 INFO L130 PetriNetUnfolder]: 3/20 cut-off events. [2022-12-06 07:38:14,969 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 07:38:14,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 20 events. 3/20 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 19. Up to 7 conditions per place. [2022-12-06 07:38:14,970 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 16 transitions, 54 flow [2022-12-06 07:38:14,970 INFO L188 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-06 07:38:14,970 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:38:14,971 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 07:38:14,971 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 16 transitions, 54 flow [2022-12-06 07:38:14,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:14,971 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:14,971 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:14,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 07:38:15,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:38:15,175 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:38:15,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:15,175 INFO L85 PathProgramCache]: Analyzing trace with hash -745912205, now seen corresponding path program 1 times [2022-12-06 07:38:15,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:15,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46307434] [2022-12-06 07:38:15,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:15,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:15,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:15,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:15,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46307434] [2022-12-06 07:38:15,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46307434] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:38:15,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734426792] [2022-12-06 07:38:15,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:15,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:38:15,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:38:15,328 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:38:15,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 07:38:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:15,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 07:38:15,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:38:15,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:15,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:38:15,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:15,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734426792] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:38:15,520 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:38:15,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2022-12-06 07:38:15,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514122512] [2022-12-06 07:38:15,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:38:15,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:38:15,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:15,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:38:15,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:38:15,523 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 07:38:15,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 16 transitions, 54 flow. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:15,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:15,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 07:38:15,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:15,629 INFO L130 PetriNetUnfolder]: 76/152 cut-off events. [2022-12-06 07:38:15,629 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-12-06 07:38:15,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 152 events. 76/152 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 448 event pairs, 12 based on Foata normal form. 7/159 useless extension candidates. Maximal degree in co-relation 169. Up to 61 conditions per place. [2022-12-06 07:38:15,632 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 30 selfloop transitions, 8 changer transitions 10/48 dead transitions. [2022-12-06 07:38:15,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 48 transitions, 235 flow [2022-12-06 07:38:15,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:38:15,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:38:15,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2022-12-06 07:38:15,634 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 07:38:15,634 INFO L175 Difference]: Start difference. First operand has 21 places, 16 transitions, 54 flow. Second operand 6 states and 50 transitions. [2022-12-06 07:38:15,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 48 transitions, 235 flow [2022-12-06 07:38:15,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 48 transitions, 226 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 07:38:15,636 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 104 flow [2022-12-06 07:38:15,637 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=104, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2022-12-06 07:38:15,638 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 7 predicate places. [2022-12-06 07:38:15,638 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:15,638 INFO L89 Accepts]: Start accepts. Operand has 27 places, 21 transitions, 104 flow [2022-12-06 07:38:15,639 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:15,639 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:15,639 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 21 transitions, 104 flow [2022-12-06 07:38:15,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 21 transitions, 104 flow [2022-12-06 07:38:15,642 INFO L130 PetriNetUnfolder]: 5/35 cut-off events. [2022-12-06 07:38:15,642 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 07:38:15,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 35 events. 5/35 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 78 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 55. Up to 11 conditions per place. [2022-12-06 07:38:15,643 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 21 transitions, 104 flow [2022-12-06 07:38:15,643 INFO L188 LiptonReduction]: Number of co-enabled transitions 80 [2022-12-06 07:38:15,736 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:38:15,736 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 07:38:15,736 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 20 transitions, 105 flow [2022-12-06 07:38:15,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:15,737 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:15,737 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:15,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 07:38:15,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-12-06 07:38:15,938 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:38:15,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:15,938 INFO L85 PathProgramCache]: Analyzing trace with hash -211566512, now seen corresponding path program 1 times [2022-12-06 07:38:15,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:15,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840999767] [2022-12-06 07:38:15,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:15,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:15,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:15,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:15,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840999767] [2022-12-06 07:38:15,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840999767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:15,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:15,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:15,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368311858] [2022-12-06 07:38:15,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:15,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:15,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:15,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:15,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:15,982 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 07:38:15,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:15,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:15,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 07:38:15,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:16,037 INFO L130 PetriNetUnfolder]: 78/150 cut-off events. [2022-12-06 07:38:16,037 INFO L131 PetriNetUnfolder]: For 137/137 co-relation queries the response was YES. [2022-12-06 07:38:16,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 150 events. 78/150 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 444 event pairs, 28 based on Foata normal form. 6/148 useless extension candidates. Maximal degree in co-relation 296. Up to 77 conditions per place. [2022-12-06 07:38:16,038 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 31 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2022-12-06 07:38:16,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 35 transitions, 221 flow [2022-12-06 07:38:16,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:16,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:16,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-06 07:38:16,039 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2022-12-06 07:38:16,039 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 105 flow. Second operand 4 states and 36 transitions. [2022-12-06 07:38:16,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 35 transitions, 221 flow [2022-12-06 07:38:16,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 35 transitions, 210 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 07:38:16,044 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 116 flow [2022-12-06 07:38:16,044 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2022-12-06 07:38:16,045 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:38:16,046 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:16,046 INFO L89 Accepts]: Start accepts. Operand has 29 places, 21 transitions, 116 flow [2022-12-06 07:38:16,046 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:16,047 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:16,047 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 21 transitions, 116 flow [2022-12-06 07:38:16,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 21 transitions, 116 flow [2022-12-06 07:38:16,053 INFO L130 PetriNetUnfolder]: 6/35 cut-off events. [2022-12-06 07:38:16,053 INFO L131 PetriNetUnfolder]: For 20/22 co-relation queries the response was YES. [2022-12-06 07:38:16,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 35 events. 6/35 cut-off events. For 20/22 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 70 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 56. Up to 11 conditions per place. [2022-12-06 07:38:16,054 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 21 transitions, 116 flow [2022-12-06 07:38:16,054 INFO L188 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-06 07:38:16,062 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:16,062 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 07:38:16,063 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 105 flow [2022-12-06 07:38:16,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:16,063 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:16,063 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:16,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 07:38:16,064 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:38:16,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:16,066 INFO L85 PathProgramCache]: Analyzing trace with hash 659153497, now seen corresponding path program 1 times [2022-12-06 07:38:16,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:16,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355151239] [2022-12-06 07:38:16,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:16,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:16,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:16,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:16,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355151239] [2022-12-06 07:38:16,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355151239] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:38:16,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771745522] [2022-12-06 07:38:16,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:16,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:38:16,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:38:16,145 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:38:16,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 07:38:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:16,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 07:38:16,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:38:16,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:16,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:38:16,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:16,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771745522] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:38:16,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:38:16,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-06 07:38:16,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422407477] [2022-12-06 07:38:16,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:38:16,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:38:16,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:16,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:38:16,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:38:16,276 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 07:38:16,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 105 flow. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:16,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:16,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 07:38:16,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:16,439 INFO L130 PetriNetUnfolder]: 104/223 cut-off events. [2022-12-06 07:38:16,439 INFO L131 PetriNetUnfolder]: For 297/297 co-relation queries the response was YES. [2022-12-06 07:38:16,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 223 events. 104/223 cut-off events. For 297/297 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 846 event pairs, 14 based on Foata normal form. 12/235 useless extension candidates. Maximal degree in co-relation 340. Up to 115 conditions per place. [2022-12-06 07:38:16,440 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 29 selfloop transitions, 6 changer transitions 21/56 dead transitions. [2022-12-06 07:38:16,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 56 transitions, 339 flow [2022-12-06 07:38:16,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:38:16,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:38:16,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-12-06 07:38:16,441 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39705882352941174 [2022-12-06 07:38:16,441 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 105 flow. Second operand 8 states and 54 transitions. [2022-12-06 07:38:16,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 56 transitions, 339 flow [2022-12-06 07:38:16,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 56 transitions, 332 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 07:38:16,443 INFO L231 Difference]: Finished difference. Result has 37 places, 22 transitions, 147 flow [2022-12-06 07:38:16,443 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=147, PETRI_PLACES=37, PETRI_TRANSITIONS=22} [2022-12-06 07:38:16,443 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 17 predicate places. [2022-12-06 07:38:16,443 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:16,443 INFO L89 Accepts]: Start accepts. Operand has 37 places, 22 transitions, 147 flow [2022-12-06 07:38:16,444 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:16,444 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:16,444 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 22 transitions, 147 flow [2022-12-06 07:38:16,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 22 transitions, 147 flow [2022-12-06 07:38:16,448 INFO L130 PetriNetUnfolder]: 6/51 cut-off events. [2022-12-06 07:38:16,448 INFO L131 PetriNetUnfolder]: For 46/46 co-relation queries the response was YES. [2022-12-06 07:38:16,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 51 events. 6/51 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 156 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 119. Up to 14 conditions per place. [2022-12-06 07:38:16,448 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 22 transitions, 147 flow [2022-12-06 07:38:16,448 INFO L188 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-06 07:38:16,449 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:38:16,449 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 07:38:16,449 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 147 flow [2022-12-06 07:38:16,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:16,450 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:16,450 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:16,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 07:38:16,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:38:16,662 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:38:16,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:16,662 INFO L85 PathProgramCache]: Analyzing trace with hash -258139707, now seen corresponding path program 1 times [2022-12-06 07:38:16,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:16,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014065551] [2022-12-06 07:38:16,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:16,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:16,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:16,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:16,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014065551] [2022-12-06 07:38:16,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014065551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:16,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:16,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:38:16,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090478573] [2022-12-06 07:38:16,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:16,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:38:16,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:16,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:38:16,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:38:16,746 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 07:38:16,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:16,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:16,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 07:38:16,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:16,805 INFO L130 PetriNetUnfolder]: 78/159 cut-off events. [2022-12-06 07:38:16,805 INFO L131 PetriNetUnfolder]: For 376/376 co-relation queries the response was YES. [2022-12-06 07:38:16,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 159 events. 78/159 cut-off events. For 376/376 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 484 event pairs, 38 based on Foata normal form. 4/163 useless extension candidates. Maximal degree in co-relation 559. Up to 119 conditions per place. [2022-12-06 07:38:16,806 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 22 selfloop transitions, 4 changer transitions 15/41 dead transitions. [2022-12-06 07:38:16,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 41 transitions, 286 flow [2022-12-06 07:38:16,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:38:16,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:38:16,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-12-06 07:38:16,808 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40625 [2022-12-06 07:38:16,808 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 147 flow. Second operand 6 states and 39 transitions. [2022-12-06 07:38:16,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 41 transitions, 286 flow [2022-12-06 07:38:16,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 260 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-06 07:38:16,811 INFO L231 Difference]: Finished difference. Result has 37 places, 22 transitions, 145 flow [2022-12-06 07:38:16,812 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=145, PETRI_PLACES=37, PETRI_TRANSITIONS=22} [2022-12-06 07:38:16,812 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 17 predicate places. [2022-12-06 07:38:16,812 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:16,812 INFO L89 Accepts]: Start accepts. Operand has 37 places, 22 transitions, 145 flow [2022-12-06 07:38:16,813 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:16,813 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:16,813 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 22 transitions, 145 flow [2022-12-06 07:38:16,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 22 transitions, 145 flow [2022-12-06 07:38:16,817 INFO L130 PetriNetUnfolder]: 8/43 cut-off events. [2022-12-06 07:38:16,817 INFO L131 PetriNetUnfolder]: For 36/37 co-relation queries the response was YES. [2022-12-06 07:38:16,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 43 events. 8/43 cut-off events. For 36/37 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 97 event pairs, 3 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 108. Up to 14 conditions per place. [2022-12-06 07:38:16,818 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 22 transitions, 145 flow [2022-12-06 07:38:16,818 INFO L188 LiptonReduction]: Number of co-enabled transitions 64 [2022-12-06 07:38:16,822 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [296] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_34 1) (< 0 (mod v_~N~0_53 4294967296)) (= v_~counter~0_99 (+ v_~c~0_66 v_~counter~0_100))) InVars {~counter~0=v_~counter~0_100, ~c~0=v_~c~0_66, ~N~0=v_~N~0_53} OutVars{~counter~0=v_~counter~0_99, ~c~0=v_~c~0_66, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_34, ~N~0=v_~N~0_53} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-06 07:38:16,880 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [299] $Ultimate##0-->L51-4: Formula: (and (< 0 (mod v_~N~0_59 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_26| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_26|) (= v_thread1Thread1of1ForFork0_~i~0_50 1) (= (ite (< 0 (mod (+ v_~c~0_72 v_~counter~0_120) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_26|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_26| 0)) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_45|) (= v_~counter~0_120 v_~counter~0_118)) InVars {~counter~0=v_~counter~0_120, ~c~0=v_~c~0_72, ~N~0=v_~N~0_59} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_26|, ~counter~0=v_~counter~0_118, ~c~0=v_~c~0_72, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_40|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_50, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_34|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_26|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_45|, ~N~0=v_~N~0_59} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-06 07:38:16,960 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [299] $Ultimate##0-->L51-4: Formula: (and (< 0 (mod v_~N~0_59 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_26| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_26|) (= v_thread1Thread1of1ForFork0_~i~0_50 1) (= (ite (< 0 (mod (+ v_~c~0_72 v_~counter~0_120) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_26|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_26| 0)) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_45|) (= v_~counter~0_120 v_~counter~0_118)) InVars {~counter~0=v_~counter~0_120, ~c~0=v_~c~0_72, ~N~0=v_~N~0_59} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_26|, ~counter~0=v_~counter~0_118, ~c~0=v_~c~0_72, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_40|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_50, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_34|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_26|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_45|, ~N~0=v_~N~0_59} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [298] L41-4-->L41-4: Formula: (let ((.cse0 (mod v_~N~0_57 4294967296))) (and (< (mod v_thread1Thread1of1ForFork0_~i~0_44 4294967296) .cse0) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_42) 4294967296) .cse0) (= (+ 2 v_thread1Thread1of1ForFork0_~i~0_44) v_thread1Thread1of1ForFork0_~i~0_42) (= (+ v_~counter~0_111 (* v_~c~0_70 2)) v_~counter~0_109))) InVars {~counter~0=v_~counter~0_111, ~c~0=v_~c~0_70, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_44, ~N~0=v_~N~0_57} OutVars{~counter~0=v_~counter~0_109, ~c~0=v_~c~0_70, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_34|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_42, ~N~0=v_~N~0_57} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-06 07:38:17,037 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:38:17,038 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 226 [2022-12-06 07:38:17,038 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 21 transitions, 153 flow [2022-12-06 07:38:17,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:17,038 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:17,038 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:17,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 07:38:17,038 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:38:17,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:17,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1267485190, now seen corresponding path program 1 times [2022-12-06 07:38:17,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:17,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134153041] [2022-12-06 07:38:17,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:17,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:17,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:17,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:17,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134153041] [2022-12-06 07:38:17,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134153041] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:38:17,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081260669] [2022-12-06 07:38:17,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:17,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:38:17,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:38:17,109 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:38:17,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 07:38:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:17,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 07:38:17,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:38:17,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:17,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:38:17,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:17,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081260669] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:38:17,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:38:17,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-12-06 07:38:17,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731360270] [2022-12-06 07:38:17,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:38:17,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:38:17,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:17,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:38:17,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:38:17,208 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 07:38:17,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 21 transitions, 153 flow. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:17,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:17,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 07:38:17,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:17,304 INFO L130 PetriNetUnfolder]: 77/149 cut-off events. [2022-12-06 07:38:17,304 INFO L131 PetriNetUnfolder]: For 391/391 co-relation queries the response was YES. [2022-12-06 07:38:17,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 149 events. 77/149 cut-off events. For 391/391 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 25 based on Foata normal form. 6/155 useless extension candidates. Maximal degree in co-relation 318. Up to 104 conditions per place. [2022-12-06 07:38:17,305 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 31 selfloop transitions, 7 changer transitions 4/42 dead transitions. [2022-12-06 07:38:17,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 324 flow [2022-12-06 07:38:17,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:38:17,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:38:17,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-12-06 07:38:17,306 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4019607843137255 [2022-12-06 07:38:17,306 INFO L175 Difference]: Start difference. First operand has 33 places, 21 transitions, 153 flow. Second operand 6 states and 41 transitions. [2022-12-06 07:38:17,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 324 flow [2022-12-06 07:38:17,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 42 transitions, 289 flow, removed 15 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:17,307 INFO L231 Difference]: Finished difference. Result has 37 places, 23 transitions, 166 flow [2022-12-06 07:38:17,307 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=166, PETRI_PLACES=37, PETRI_TRANSITIONS=23} [2022-12-06 07:38:17,308 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 17 predicate places. [2022-12-06 07:38:17,308 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:17,308 INFO L89 Accepts]: Start accepts. Operand has 37 places, 23 transitions, 166 flow [2022-12-06 07:38:17,308 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:17,309 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:17,309 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 23 transitions, 166 flow [2022-12-06 07:38:17,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 23 transitions, 166 flow [2022-12-06 07:38:17,312 INFO L130 PetriNetUnfolder]: 10/48 cut-off events. [2022-12-06 07:38:17,312 INFO L131 PetriNetUnfolder]: For 43/47 co-relation queries the response was YES. [2022-12-06 07:38:17,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 48 events. 10/48 cut-off events. For 43/47 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 3 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 110. Up to 13 conditions per place. [2022-12-06 07:38:17,313 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 23 transitions, 166 flow [2022-12-06 07:38:17,313 INFO L188 LiptonReduction]: Number of co-enabled transitions 74 [2022-12-06 07:38:17,318 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:17,319 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:17,407 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [300] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (+ v_~c~0_74 v_~counter~0_126))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_28| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_28|) (= (ite (< 0 (mod .cse0 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_28|) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_52) 4294967296) (mod v_~N~0_61 4294967296)) (= v_~counter~0_124 .cse0) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_47|) (= 2 v_thread1Thread1of1ForFork0_~i~0_52) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_28| 0)))) InVars {~counter~0=v_~counter~0_126, ~c~0=v_~c~0_74, ~N~0=v_~N~0_61} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_28|, ~counter~0=v_~counter~0_124, ~c~0=v_~c~0_74, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_42|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_52, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_36|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_28|, ~N~0=v_~N~0_61, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-06 07:38:17,407 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:17,407 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:17,500 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [301] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_56 3) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_49|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_30| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_30|) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_56) 4294967296) (mod v_~N~0_63 4294967296)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_30| 0)) (= v_~counter~0_130 (+ v_~counter~0_132 (* v_~c~0_76 2))) (= (ite (< 0 (mod (+ v_~c~0_76 v_~counter~0_132) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_30|)) InVars {~counter~0=v_~counter~0_132, ~c~0=v_~c~0_76, ~N~0=v_~N~0_63} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_30|, ~counter~0=v_~counter~0_130, ~c~0=v_~c~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_46|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_56, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_38|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_30|, ~N~0=v_~N~0_63, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_49|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-06 07:38:17,500 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:17,501 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:17,651 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:38:17,651 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 343 [2022-12-06 07:38:17,651 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 177 flow [2022-12-06 07:38:17,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:17,652 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:17,652 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:17,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 07:38:17,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:38:17,852 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:38:17,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:17,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1341137177, now seen corresponding path program 1 times [2022-12-06 07:38:17,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:17,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839487136] [2022-12-06 07:38:17,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:17,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:17,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:17,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:17,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839487136] [2022-12-06 07:38:17,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839487136] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:17,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:17,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:17,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407961068] [2022-12-06 07:38:17,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:17,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:17,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:17,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:17,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:17,918 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 07:38:17,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 177 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:17,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:17,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 07:38:17,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:17,973 INFO L130 PetriNetUnfolder]: 76/153 cut-off events. [2022-12-06 07:38:17,973 INFO L131 PetriNetUnfolder]: For 524/524 co-relation queries the response was YES. [2022-12-06 07:38:17,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 153 events. 76/153 cut-off events. For 524/524 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 34 based on Foata normal form. 4/155 useless extension candidates. Maximal degree in co-relation 428. Up to 133 conditions per place. [2022-12-06 07:38:17,974 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 21 selfloop transitions, 3 changer transitions 9/33 dead transitions. [2022-12-06 07:38:17,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 299 flow [2022-12-06 07:38:17,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:17,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:17,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-12-06 07:38:17,975 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2022-12-06 07:38:17,975 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 177 flow. Second operand 4 states and 32 transitions. [2022-12-06 07:38:17,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 299 flow [2022-12-06 07:38:17,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 33 transitions, 251 flow, removed 20 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:17,977 INFO L231 Difference]: Finished difference. Result has 36 places, 23 transitions, 158 flow [2022-12-06 07:38:17,977 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=36, PETRI_TRANSITIONS=23} [2022-12-06 07:38:17,978 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 16 predicate places. [2022-12-06 07:38:17,978 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:17,978 INFO L89 Accepts]: Start accepts. Operand has 36 places, 23 transitions, 158 flow [2022-12-06 07:38:17,980 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:17,980 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:17,980 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 23 transitions, 158 flow [2022-12-06 07:38:17,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 23 transitions, 158 flow [2022-12-06 07:38:17,985 INFO L130 PetriNetUnfolder]: 13/53 cut-off events. [2022-12-06 07:38:17,985 INFO L131 PetriNetUnfolder]: For 75/79 co-relation queries the response was YES. [2022-12-06 07:38:17,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 53 events. 13/53 cut-off events. For 75/79 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 145 event pairs, 3 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 156. Up to 20 conditions per place. [2022-12-06 07:38:17,986 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 23 transitions, 158 flow [2022-12-06 07:38:17,986 INFO L188 LiptonReduction]: Number of co-enabled transitions 58 [2022-12-06 07:38:17,990 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [305] $Ultimate##0-->L51-4: Formula: (and (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_60|) (= (ite (< 0 (mod (+ v_~c~0_80 v_~counter~0_146) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_38|) (= v_~counter~0_146 v_~counter~0_144) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_38| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_38| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_38|) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_61) 4294967296) (mod v_~N~0_67 4294967296)) (= 2 v_thread1Thread1of1ForFork0_~i~0_61)) InVars {~counter~0=v_~counter~0_146, ~c~0=v_~c~0_80, ~N~0=v_~N~0_67} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_38|, ~counter~0=v_~counter~0_144, ~c~0=v_~c~0_80, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_51|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_61, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_46|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_38|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_60|, ~N~0=v_~N~0_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [298] L41-4-->L41-4: Formula: (let ((.cse0 (mod v_~N~0_57 4294967296))) (and (< (mod v_thread1Thread1of1ForFork0_~i~0_44 4294967296) .cse0) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_42) 4294967296) .cse0) (= (+ 2 v_thread1Thread1of1ForFork0_~i~0_44) v_thread1Thread1of1ForFork0_~i~0_42) (= (+ v_~counter~0_111 (* v_~c~0_70 2)) v_~counter~0_109))) InVars {~counter~0=v_~counter~0_111, ~c~0=v_~c~0_70, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_44, ~N~0=v_~N~0_57} OutVars{~counter~0=v_~counter~0_109, ~c~0=v_~c~0_70, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_34|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_42, ~N~0=v_~N~0_57} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-06 07:38:18,078 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [305] $Ultimate##0-->L51-4: Formula: (and (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_60|) (= (ite (< 0 (mod (+ v_~c~0_80 v_~counter~0_146) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_38|) (= v_~counter~0_146 v_~counter~0_144) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_38| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_38| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_38|) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_61) 4294967296) (mod v_~N~0_67 4294967296)) (= 2 v_thread1Thread1of1ForFork0_~i~0_61)) InVars {~counter~0=v_~counter~0_146, ~c~0=v_~c~0_80, ~N~0=v_~N~0_67} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_38|, ~counter~0=v_~counter~0_144, ~c~0=v_~c~0_80, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_51|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_61, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_46|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_38|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_60|, ~N~0=v_~N~0_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-06 07:38:18,165 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [310] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (+ v_~c~0_88 v_~counter~0_170))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_50| 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_72|) (= v_~counter~0_168 .cse0) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_73) 4294967296) (mod v_~N~0_75 4294967296)) (= v_thread1Thread1of1ForFork0_~i~0_73 3) (= (ite (< 0 (mod .cse0 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_50|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_50| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_50|))) InVars {~counter~0=v_~counter~0_170, ~c~0=v_~c~0_88, ~N~0=v_~N~0_75} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_50|, ~counter~0=v_~counter~0_168, ~c~0=v_~c~0_88, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_63|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_73, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_58|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_50|, ~N~0=v_~N~0_75, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_72|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-06 07:38:18,165 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:18,165 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:18,285 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-06 07:38:18,353 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:38:18,354 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 376 [2022-12-06 07:38:18,354 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 176 flow [2022-12-06 07:38:18,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:18,354 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:18,354 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:18,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 07:38:18,355 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:38:18,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:18,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1521404509, now seen corresponding path program 1 times [2022-12-06 07:38:18,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:18,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823001862] [2022-12-06 07:38:18,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:18,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:18,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:18,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:18,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823001862] [2022-12-06 07:38:18,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823001862] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:18,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:18,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:18,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800311439] [2022-12-06 07:38:18,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:18,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:18,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:18,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:18,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:18,423 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 07:38:18,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:18,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:18,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 07:38:18,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:18,471 INFO L130 PetriNetUnfolder]: 77/149 cut-off events. [2022-12-06 07:38:18,471 INFO L131 PetriNetUnfolder]: For 576/576 co-relation queries the response was YES. [2022-12-06 07:38:18,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 149 events. 77/149 cut-off events. For 576/576 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 33 based on Foata normal form. 12/161 useless extension candidates. Maximal degree in co-relation 638. Up to 132 conditions per place. [2022-12-06 07:38:18,472 INFO L137 encePairwiseOnDemand]: 18/22 looper letters, 30 selfloop transitions, 4 changer transitions 1/35 dead transitions. [2022-12-06 07:38:18,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 35 transitions, 312 flow [2022-12-06 07:38:18,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:18,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:18,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-06 07:38:18,473 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2022-12-06 07:38:18,473 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 176 flow. Second operand 4 states and 36 transitions. [2022-12-06 07:38:18,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 35 transitions, 312 flow [2022-12-06 07:38:18,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 273 flow, removed 19 selfloop flow, removed 4 redundant places. [2022-12-06 07:38:18,474 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 188 flow [2022-12-06 07:38:18,475 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2022-12-06 07:38:18,475 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 15 predicate places. [2022-12-06 07:38:18,475 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:18,475 INFO L89 Accepts]: Start accepts. Operand has 35 places, 25 transitions, 188 flow [2022-12-06 07:38:18,475 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:18,476 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:18,476 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 25 transitions, 188 flow [2022-12-06 07:38:18,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 25 transitions, 188 flow [2022-12-06 07:38:18,480 INFO L130 PetriNetUnfolder]: 15/58 cut-off events. [2022-12-06 07:38:18,480 INFO L131 PetriNetUnfolder]: For 96/96 co-relation queries the response was YES. [2022-12-06 07:38:18,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 58 events. 15/58 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 184 event pairs, 3 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 163. Up to 20 conditions per place. [2022-12-06 07:38:18,480 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 25 transitions, 188 flow [2022-12-06 07:38:18,480 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-06 07:38:18,489 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [309] $Ultimate##0-->L41-4: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_48| 0)) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_69) 4294967296) (mod v_~N~0_73 4294967296)) (= v_~counter~0_162 (+ (* v_~c~0_86 2) v_~counter~0_164)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_48| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_48|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_70|) (= v_thread1Thread1of1ForFork0_~i~0_69 4) (= (ite (< 0 (mod (+ v_~c~0_86 v_~counter~0_164) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_48|)) InVars {~counter~0=v_~counter~0_164, ~c~0=v_~c~0_86, ~N~0=v_~N~0_73} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_48|, ~counter~0=v_~counter~0_162, ~c~0=v_~c~0_86, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_59|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_69, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_56|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_48|, ~N~0=v_~N~0_73, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_70|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-06 07:38:18,489 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:18,489 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:18,688 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:18,689 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 214 [2022-12-06 07:38:18,689 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 198 flow [2022-12-06 07:38:18,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:18,689 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:18,689 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:18,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 07:38:18,690 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:38:18,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:18,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1030752452, now seen corresponding path program 1 times [2022-12-06 07:38:18,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:18,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004102901] [2022-12-06 07:38:18,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:18,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:18,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:18,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:18,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004102901] [2022-12-06 07:38:18,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004102901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:18,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:18,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:18,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657946953] [2022-12-06 07:38:18,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:18,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:18,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:18,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:18,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:18,741 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 07:38:18,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:18,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:18,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 07:38:18,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:18,798 INFO L130 PetriNetUnfolder]: 82/156 cut-off events. [2022-12-06 07:38:18,798 INFO L131 PetriNetUnfolder]: For 618/618 co-relation queries the response was YES. [2022-12-06 07:38:18,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 156 events. 82/156 cut-off events. For 618/618 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 18 based on Foata normal form. 6/162 useless extension candidates. Maximal degree in co-relation 412. Up to 105 conditions per place. [2022-12-06 07:38:18,799 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 28 selfloop transitions, 7 changer transitions 2/37 dead transitions. [2022-12-06 07:38:18,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 37 transitions, 329 flow [2022-12-06 07:38:18,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:18,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:18,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-06 07:38:18,800 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.391304347826087 [2022-12-06 07:38:18,800 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 198 flow. Second operand 4 states and 36 transitions. [2022-12-06 07:38:18,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 37 transitions, 329 flow [2022-12-06 07:38:18,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 297 flow, removed 16 selfloop flow, removed 0 redundant places. [2022-12-06 07:38:18,801 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 193 flow [2022-12-06 07:38:18,801 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=193, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2022-12-06 07:38:18,802 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 18 predicate places. [2022-12-06 07:38:18,802 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:18,802 INFO L89 Accepts]: Start accepts. Operand has 38 places, 26 transitions, 193 flow [2022-12-06 07:38:18,802 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:18,802 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:18,802 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 26 transitions, 193 flow [2022-12-06 07:38:18,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 26 transitions, 193 flow [2022-12-06 07:38:18,806 INFO L130 PetriNetUnfolder]: 16/56 cut-off events. [2022-12-06 07:38:18,806 INFO L131 PetriNetUnfolder]: For 95/95 co-relation queries the response was YES. [2022-12-06 07:38:18,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 56 events. 16/56 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 173 event pairs, 2 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 186. Up to 22 conditions per place. [2022-12-06 07:38:18,807 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 26 transitions, 193 flow [2022-12-06 07:38:18,807 INFO L188 LiptonReduction]: Number of co-enabled transitions 74 [2022-12-06 07:38:18,807 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:18,807 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:18,931 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [316] $Ultimate##0-->L41-4: Formula: (and (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_85) 4294967296) (mod v_~N~0_83 4294967296)) (= 5 v_thread1Thread1of1ForFork0_~i~0_85) (= (+ v_~counter~0_194 (* v_~c~0_96 3)) v_~counter~0_192) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_86|) (= (ite (< 0 (mod (+ v_~c~0_96 v_~counter~0_194) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_62|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_62| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_62| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_62|)) InVars {~counter~0=v_~counter~0_194, ~c~0=v_~c~0_96, ~N~0=v_~N~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_62|, ~counter~0=v_~counter~0_192, ~c~0=v_~c~0_96, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_73|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_85, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_70|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_62|, ~N~0=v_~N~0_83, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_86|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-06 07:38:18,931 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:18,931 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:19,053 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [307] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (+ v_~c~0_82 v_~counter~0_152))) (and (= v_~counter~0_150 .cse0) (not (= (ite (< 0 (mod .cse0 4294967296)) 1 0) 0)) (= v_thread1Thread1of1ForFork0_~i~0_63 3) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_63) 4294967296) (mod v_~N~0_69 4294967296)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_64|) (= (ite (< 0 (mod (+ v_~c~0_82 v_~counter~0_150) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_42|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_42| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_42| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_42|))) InVars {~counter~0=v_~counter~0_152, ~c~0=v_~c~0_82, ~N~0=v_~N~0_69} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_42|, ~counter~0=v_~counter~0_150, ~c~0=v_~c~0_82, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_53|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_63, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_50|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_42|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_64|, ~N~0=v_~N~0_69} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-06 07:38:19,254 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:38:19,255 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 453 [2022-12-06 07:38:19,255 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 207 flow [2022-12-06 07:38:19,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:19,255 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:19,255 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:19,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 07:38:19,255 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:38:19,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:19,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1632903841, now seen corresponding path program 1 times [2022-12-06 07:38:19,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:19,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923837421] [2022-12-06 07:38:19,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:19,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:19,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:19,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:19,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:19,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923837421] [2022-12-06 07:38:19,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923837421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:19,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:19,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:19,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965831035] [2022-12-06 07:38:19,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:19,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:19,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:19,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:19,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:19,336 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 07:38:19,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 207 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:19,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:19,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 07:38:19,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:19,396 INFO L130 PetriNetUnfolder]: 106/186 cut-off events. [2022-12-06 07:38:19,396 INFO L131 PetriNetUnfolder]: For 941/941 co-relation queries the response was YES. [2022-12-06 07:38:19,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 909 conditions, 186 events. 106/186 cut-off events. For 941/941 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 587 event pairs, 16 based on Foata normal form. 12/198 useless extension candidates. Maximal degree in co-relation 751. Up to 113 conditions per place. [2022-12-06 07:38:19,398 INFO L137 encePairwiseOnDemand]: 14/23 looper letters, 26 selfloop transitions, 14 changer transitions 0/40 dead transitions. [2022-12-06 07:38:19,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 40 transitions, 375 flow [2022-12-06 07:38:19,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:19,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:19,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-06 07:38:19,399 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41304347826086957 [2022-12-06 07:38:19,399 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 207 flow. Second operand 4 states and 38 transitions. [2022-12-06 07:38:19,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 40 transitions, 375 flow [2022-12-06 07:38:19,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 327 flow, removed 18 selfloop flow, removed 4 redundant places. [2022-12-06 07:38:19,402 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 268 flow [2022-12-06 07:38:19,402 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=268, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2022-12-06 07:38:19,403 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 16 predicate places. [2022-12-06 07:38:19,403 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:19,403 INFO L89 Accepts]: Start accepts. Operand has 36 places, 31 transitions, 268 flow [2022-12-06 07:38:19,404 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:19,404 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:19,404 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 31 transitions, 268 flow [2022-12-06 07:38:19,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 31 transitions, 268 flow [2022-12-06 07:38:19,409 INFO L130 PetriNetUnfolder]: 21/73 cut-off events. [2022-12-06 07:38:19,409 INFO L131 PetriNetUnfolder]: For 143/143 co-relation queries the response was YES. [2022-12-06 07:38:19,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 73 events. 21/73 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 279 event pairs, 2 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 239. Up to 30 conditions per place. [2022-12-06 07:38:19,410 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 31 transitions, 268 flow [2022-12-06 07:38:19,410 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 07:38:19,410 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (+ v_~counter~0_212 (* 2 v_~c~0_102)))) (and (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_93) 4294967296) (mod v_~N~0_89 4294967296)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_96|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_72| 0)) (= v_thread1Thread1of1ForFork0_~i~0_93 4) (= (ite (< 0 (mod .cse0 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_72|) (= v_~counter~0_210 .cse0) (not (= (ite (< 0 (mod (+ v_~counter~0_212 v_~c~0_102) 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_72| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_72|))) InVars {~counter~0=v_~counter~0_212, ~c~0=v_~c~0_102, ~N~0=v_~N~0_89} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_72|, ~counter~0=v_~counter~0_210, ~c~0=v_~c~0_102, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_81|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_93, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_80|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_72|, ~N~0=v_~N~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_96|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-06 07:38:19,410 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:19,411 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:19,537 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [322] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_97 6) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_98|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_74| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_74|) (< 5 (mod v_~N~0_91 4294967296)) (= (ite (< 0 (mod (+ v_~counter~0_218 v_~c~0_104) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_74|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_74| 0)) (= v_~counter~0_216 (+ v_~counter~0_218 (* v_~c~0_104 4)))) InVars {~counter~0=v_~counter~0_218, ~c~0=v_~c~0_104, ~N~0=v_~N~0_91} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_74|, ~counter~0=v_~counter~0_216, ~c~0=v_~c~0_104, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_85|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_97, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_82|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_74|, ~N~0=v_~N~0_91, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_98|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-06 07:38:19,537 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:19,537 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:19,653 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [308] $Ultimate##0-->L41-4: Formula: (and (= (ite (< 0 (mod (+ v_~c~0_84 v_~counter~0_158) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_46|) (< 3 (mod v_~N~0_71 4294967296)) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_68|) (= v_~counter~0_156 (+ v_~counter~0_158 (* v_~c~0_84 3))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_46| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_46|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_46| 0)) (= v_thread1Thread1of1ForFork0_~i~0_65 4)) InVars {~counter~0=v_~counter~0_158, ~c~0=v_~c~0_84, ~N~0=v_~N~0_71} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_46|, ~counter~0=v_~counter~0_156, ~c~0=v_~c~0_84, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_55|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_65, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_46|, ~N~0=v_~N~0_71, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_68|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [303] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_65 4294967296))) (and (< (mod (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_56|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_140 4294967296)) 1 0) 0)) (= v_~counter~0_140 (+ v_~counter~0_138 (* v_~c~0_78 2))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_34| 0)) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_56|) |v_thread2Thread1of1ForFork1_~i~1#1_54|) (= (ite (< 0 (mod (+ v_~c~0_78 v_~counter~0_138) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_34|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_34| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_34|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_56| 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_140, ~c~0=v_~c~0_78, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_56|, ~N~0=v_~N~0_65} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_34|, ~counter~0=v_~counter~0_138, ~c~0=v_~c~0_78, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_42|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_34|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_54|, ~N~0=v_~N~0_65} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-06 07:38:19,653 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:19,653 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:19,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 07:38:19,793 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IndexOutOfBoundsException: Index 12 out of bounds for length 12 at java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) at java.base/jdk.internal.util.Preconditions.outOfBoundsCheckIndex(Preconditions.java:70) at java.base/jdk.internal.util.Preconditions.checkIndex(Preconditions.java:248) at java.base/java.util.Objects.checkIndex(Objects.java:372) at java.base/java.util.ArrayList.get(ArrayList.java:459) at de.uni_freiburg.informatik.ultimate.automata.petrinet.PetriNetRun.getTransition(PetriNetRun.java:125) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.adaptRun(ChoiceRule.java:163) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.applyInternal(ChoiceRule.java:115) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.choiceRuleWrapper(LiptonReduction.java:239) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:200) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) 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-06 07:38:19,795 INFO L158 Benchmark]: Toolchain (without parser) took 8330.23ms. Allocated memory was 180.4MB in the beginning and 286.3MB in the end (delta: 105.9MB). Free memory was 156.1MB in the beginning and 166.7MB in the end (delta: -10.6MB). Peak memory consumption was 95.8MB. Max. memory is 8.0GB. [2022-12-06 07:38:19,795 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 180.4MB. Free memory is still 157.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:38:19,795 INFO L158 Benchmark]: CACSL2BoogieTranslator took 149.81ms. Allocated memory is still 180.4MB. Free memory was 156.1MB in the beginning and 144.9MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 07:38:19,796 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.74ms. Allocated memory is still 180.4MB. Free memory was 144.9MB in the beginning and 143.0MB in the end (delta: 1.9MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 07:38:19,796 INFO L158 Benchmark]: Boogie Preprocessor took 13.86ms. Allocated memory is still 180.4MB. Free memory was 143.0MB in the beginning and 142.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 07:38:19,796 INFO L158 Benchmark]: RCFGBuilder took 298.29ms. Allocated memory is still 180.4MB. Free memory was 142.0MB in the beginning and 128.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 07:38:19,796 INFO L158 Benchmark]: TraceAbstraction took 7843.53ms. Allocated memory was 180.4MB in the beginning and 286.3MB in the end (delta: 105.9MB). Free memory was 127.8MB in the beginning and 166.7MB in the end (delta: -38.9MB). Peak memory consumption was 67.5MB. Max. memory is 8.0GB. [2022-12-06 07:38:19,797 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 180.4MB. Free memory is still 157.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 149.81ms. Allocated memory is still 180.4MB. Free memory was 156.1MB in the beginning and 144.9MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.74ms. Allocated memory is still 180.4MB. Free memory was 144.9MB in the beginning and 143.0MB in the end (delta: 1.9MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 13.86ms. Allocated memory is still 180.4MB. Free memory was 143.0MB in the beginning and 142.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 298.29ms. Allocated memory is still 180.4MB. Free memory was 142.0MB in the beginning and 128.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 7843.53ms. Allocated memory was 180.4MB in the beginning and 286.3MB in the end (delta: 105.9MB). Free memory was 127.8MB in the beginning and 166.7MB in the end (delta: -38.9MB). Peak memory consumption was 67.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 71 PlacesBefore, 20 PlacesAfterwards, 70 TransitionsBefore, 15 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 32 TrivialYvCompositions, 19 ConcurrentYvCompositions, 4 ChoiceCompositions, 55 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 266, independent: 262, independent conditional: 262, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 266, independent: 262, independent conditional: 0, independent unconditional: 262, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 266, independent: 262, independent conditional: 0, independent unconditional: 262, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 266, independent: 262, independent conditional: 0, independent unconditional: 262, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 266, independent: 262, independent conditional: 0, independent unconditional: 262, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 266, independent: 262, independent conditional: 0, independent unconditional: 262, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 266, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 266, unknown conditional: 0, unknown unconditional: 266] , Statistics on independence cache: Total cache size (in pairs): 412, Positive cache size: 408, Positive conditional cache size: 0, Positive unconditional cache size: 408, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 19 PlacesBefore, 19 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 60 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 24 PlacesBefore, 23 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 2, independent unconditional: 12, 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: 14, independent: 14, independent conditional: 2, independent unconditional: 12, 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: 14, independent: 14, independent conditional: 2, independent unconditional: 12, 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: 7, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 1, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 7, Positive cache size: 7, Positive conditional cache size: 1, Positive unconditional cache size: 6, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 21 PlacesBefore, 21 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 7, Positive cache size: 7, Positive conditional cache size: 1, Positive unconditional cache size: 6, 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, 27 PlacesBefore, 26 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 80 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 5, independent unconditional: 3, 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: 8, independent: 8, independent conditional: 5, independent unconditional: 3, 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: 8, independent: 8, independent conditional: 5, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 5, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 21, Positive conditional cache size: 9, Positive unconditional cache size: 12, 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: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 29 PlacesBefore, 29 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 82 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 25, Positive conditional cache size: 13, Positive unconditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 25, Positive conditional cache size: 13, Positive unconditional cache size: 12, 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.2s, 35 PlacesBefore, 33 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 64 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 31, Positive conditional cache size: 19, Positive unconditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 35 PlacesBefore, 34 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 74 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 13, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 13, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 52, Positive conditional cache size: 40, Positive unconditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 34 PlacesBefore, 34 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 58 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 8, independent unconditional: 2, 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: 10, independent: 10, independent conditional: 8, independent unconditional: 2, 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: 10, independent: 10, independent conditional: 8, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 9, independent conditional: 8, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 53, Positive conditional cache size: 40, Positive unconditional cache size: 13, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 34 PlacesBefore, 34 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 59, Positive conditional cache size: 46, Positive unconditional cache size: 13, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 36 PlacesBefore, 35 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 74 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 10, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 70, Positive conditional cache size: 57, Positive unconditional cache size: 13, 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: 0 - ExceptionOrErrorResult: IndexOutOfBoundsException: Index 12 out of bounds for length 12 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IndexOutOfBoundsException: Index 12 out of bounds for length 12: java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 07:38:19,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...