/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 10:36:43,569 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 10:36:43,571 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 10:36:43,622 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 10:36:43,622 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 10:36:43,624 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 10:36:43,628 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 10:36:43,632 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 10:36:43,637 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 10:36:43,644 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 10:36:43,645 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 10:36:43,647 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 10:36:43,647 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 10:36:43,649 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 10:36:43,651 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 10:36:43,654 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 10:36:43,655 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 10:36:43,656 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 10:36:43,659 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 10:36:43,664 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 10:36:43,665 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 10:36:43,668 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 10:36:43,669 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 10:36:43,670 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 10:36:43,678 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 10:36:43,678 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 10:36:43,678 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 10:36:43,680 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 10:36:43,681 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 10:36:43,681 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 10:36:43,682 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 10:36:43,683 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 10:36:43,685 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 10:36:43,685 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 10:36:43,686 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 10:36:43,686 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 10:36:43,687 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 10:36:43,687 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 10:36:43,687 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 10:36:43,688 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 10:36:43,689 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 10:36:43,689 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 10:36:43,723 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 10:36:43,723 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 10:36:43,725 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 10:36:43,725 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 10:36:43,725 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 10:36:43,726 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 10:36:43,726 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 10:36:43,726 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 10:36:43,727 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 10:36:43,727 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 10:36:43,727 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 10:36:43,728 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 10:36:43,728 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 10:36:43,728 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 10:36:43,728 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 10:36:43,728 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 10:36:43,728 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 10:36:43,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 10:36:43,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 10:36:43,729 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 10:36:43,729 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 10:36:43,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 10:36:43,729 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 10:36:43,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 10:36:43,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 10:36:43,730 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 10:36:43,730 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 10:36:43,730 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 10:36:43,730 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 10:36:43,730 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-13 10:36:44,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 10:36:44,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 10:36:44,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 10:36:44,073 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 10:36:44,074 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 10:36:44,075 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c [2022-12-13 10:36:45,327 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 10:36:45,571 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 10:36:45,572 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c [2022-12-13 10:36:45,581 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c79c3f6aa/9958ed64fcd74e85a81405a94260f527/FLAG00fc14140 [2022-12-13 10:36:45,592 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c79c3f6aa/9958ed64fcd74e85a81405a94260f527 [2022-12-13 10:36:45,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 10:36:45,595 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 10:36:45,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 10:36:45,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 10:36:45,598 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 10:36:45,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:36:45" (1/1) ... [2022-12-13 10:36:45,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f776fd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:36:45, skipping insertion in model container [2022-12-13 10:36:45,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:36:45" (1/1) ... [2022-12-13 10:36:45,604 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 10:36:45,623 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 10:36:45,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:36:45,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:36:45,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:36:45,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:36:45,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:36:45,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:36:45,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:36:45,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:36:45,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:36:45,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:36:45,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:36:45,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:36:45,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:36:45,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:36:45,757 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-bad-ring.wvr.c[3947,3960] [2022-12-13 10:36:45,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 10:36:45,774 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 10:36:45,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:36:45,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:36:45,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:36:45,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:36:45,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:36:45,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:36:45,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:36:45,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:36:45,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:36:45,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:36:45,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:36:45,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:36:45,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:36:45,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:36:45,803 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-bad-ring.wvr.c[3947,3960] [2022-12-13 10:36:45,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 10:36:45,819 INFO L208 MainTranslator]: Completed translation [2022-12-13 10:36:45,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:36:45 WrapperNode [2022-12-13 10:36:45,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 10:36:45,821 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 10:36:45,821 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 10:36:45,821 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 10:36:45,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:36:45" (1/1) ... [2022-12-13 10:36:45,836 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:36:45" (1/1) ... [2022-12-13 10:36:45,888 INFO L138 Inliner]: procedures = 25, calls = 61, calls flagged for inlining = 16, calls inlined = 20, statements flattened = 315 [2022-12-13 10:36:45,889 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 10:36:45,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 10:36:45,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 10:36:45,890 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 10:36:45,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:36:45" (1/1) ... [2022-12-13 10:36:45,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:36:45" (1/1) ... [2022-12-13 10:36:45,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:36:45" (1/1) ... [2022-12-13 10:36:45,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:36:45" (1/1) ... [2022-12-13 10:36:45,923 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:36:45" (1/1) ... [2022-12-13 10:36:45,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:36:45" (1/1) ... [2022-12-13 10:36:45,944 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:36:45" (1/1) ... [2022-12-13 10:36:45,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:36:45" (1/1) ... [2022-12-13 10:36:45,949 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 10:36:45,949 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 10:36:45,950 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 10:36:45,950 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 10:36:45,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:36:45" (1/1) ... [2022-12-13 10:36:45,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 10:36:45,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:36:45,993 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-13 10:36:46,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 10:36:46,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 10:36:46,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 10:36:46,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 10:36:46,036 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 10:36:46,036 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 10:36:46,036 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 10:36:46,036 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 10:36:46,036 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 10:36:46,036 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 10:36:46,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 10:36:46,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 10:36:46,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 10:36:46,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 10:36:46,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 10:36:46,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 10:36:46,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 10:36:46,038 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 10:36:46,023 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-13 10:36:46,216 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 10:36:46,218 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 10:36:46,703 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 10:36:46,836 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 10:36:46,836 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-13 10:36:46,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:36:46 BoogieIcfgContainer [2022-12-13 10:36:46,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 10:36:46,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 10:36:46,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 10:36:46,850 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 10:36:46,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 10:36:45" (1/3) ... [2022-12-13 10:36:46,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51477909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:36:46, skipping insertion in model container [2022-12-13 10:36:46,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:36:45" (2/3) ... [2022-12-13 10:36:46,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51477909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:36:46, skipping insertion in model container [2022-12-13 10:36:46,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:36:46" (3/3) ... [2022-12-13 10:36:46,853 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-ring.wvr.c [2022-12-13 10:36:46,868 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 10:36:46,868 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 10:36:46,868 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 10:36:46,991 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 10:36:47,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 245 transitions, 514 flow [2022-12-13 10:36:47,146 INFO L130 PetriNetUnfolder]: 22/242 cut-off events. [2022-12-13 10:36:47,146 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 10:36:47,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 242 events. 22/242 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 158 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 204. Up to 3 conditions per place. [2022-12-13 10:36:47,154 INFO L82 GeneralOperation]: Start removeDead. Operand has 233 places, 245 transitions, 514 flow [2022-12-13 10:36:47,167 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 232 transitions, 482 flow [2022-12-13 10:36:47,169 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:36:47,196 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 232 transitions, 482 flow [2022-12-13 10:36:47,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 232 transitions, 482 flow [2022-12-13 10:36:47,275 INFO L130 PetriNetUnfolder]: 22/232 cut-off events. [2022-12-13 10:36:47,275 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 10:36:47,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 232 events. 22/232 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 155 event pairs, 0 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 204. Up to 3 conditions per place. [2022-12-13 10:36:47,279 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 232 transitions, 482 flow [2022-12-13 10:36:47,279 INFO L226 LiptonReduction]: Number of co-enabled transitions 1962 [2022-12-13 10:36:56,659 INFO L241 LiptonReduction]: Total number of compositions: 200 [2022-12-13 10:36:56,673 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 10:36:56,679 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;@3780799f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 10:36:56,679 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 10:36:56,685 INFO L130 PetriNetUnfolder]: 7/30 cut-off events. [2022-12-13 10:36:56,685 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 10:36:56,685 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:36:56,686 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:36:56,686 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:36:56,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:36:56,690 INFO L85 PathProgramCache]: Analyzing trace with hash -32754915, now seen corresponding path program 1 times [2022-12-13 10:36:56,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:36:56,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554715589] [2022-12-13 10:36:56,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:36:56,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:36:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:36:57,090 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-13 10:36:57,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:36:57,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554715589] [2022-12-13 10:36:57,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554715589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:36:57,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:36:57,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:36:57,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929192945] [2022-12-13 10:36:57,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:36:57,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:36:57,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:36:57,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:36:57,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:36:57,126 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 10:36:57,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 31 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-13 10:36:57,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:36:57,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 10:36:57,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:36:57,308 INFO L130 PetriNetUnfolder]: 472/690 cut-off events. [2022-12-13 10:36:57,308 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-12-13 10:36:57,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 690 events. 472/690 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2132 event pairs, 135 based on Foata normal form. 30/575 useless extension candidates. Maximal degree in co-relation 1216. Up to 449 conditions per place. [2022-12-13 10:36:57,318 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 40 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2022-12-13 10:36:57,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 43 transitions, 196 flow [2022-12-13 10:36:57,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:36:57,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:36:57,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-13 10:36:57,335 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5053763440860215 [2022-12-13 10:36:57,337 INFO L175 Difference]: Start difference. First operand has 34 places, 31 transitions, 80 flow. Second operand 3 states and 47 transitions. [2022-12-13 10:36:57,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 43 transitions, 196 flow [2022-12-13 10:36:57,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 43 transitions, 180 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-13 10:36:57,345 INFO L231 Difference]: Finished difference. Result has 31 places, 32 transitions, 87 flow [2022-12-13 10:36:57,347 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=31, PETRI_TRANSITIONS=32} [2022-12-13 10:36:57,351 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2022-12-13 10:36:57,353 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:36:57,358 INFO L89 Accepts]: Start accepts. Operand has 31 places, 32 transitions, 87 flow [2022-12-13 10:36:57,361 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:36:57,362 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:36:57,362 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 32 transitions, 87 flow [2022-12-13 10:36:57,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 32 transitions, 87 flow [2022-12-13 10:36:57,372 INFO L130 PetriNetUnfolder]: 14/43 cut-off events. [2022-12-13 10:36:57,372 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 10:36:57,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 43 events. 14/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 58 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 45. Up to 17 conditions per place. [2022-12-13 10:36:57,376 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 32 transitions, 87 flow [2022-12-13 10:36:57,376 INFO L226 LiptonReduction]: Number of co-enabled transitions 218 [2022-12-13 10:36:57,395 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:36:57,396 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-13 10:36:57,397 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 32 transitions, 87 flow [2022-12-13 10:36:57,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-13 10:36:57,397 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:36:57,397 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:36:57,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 10:36:57,398 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:36:57,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:36:57,398 INFO L85 PathProgramCache]: Analyzing trace with hash -2034944899, now seen corresponding path program 1 times [2022-12-13 10:36:57,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:36:57,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064170946] [2022-12-13 10:36:57,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:36:57,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:36:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:36:57,620 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-13 10:36:57,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:36:57,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064170946] [2022-12-13 10:36:57,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064170946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:36:57,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:36:57,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:36:57,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677975829] [2022-12-13 10:36:57,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:36:57,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:36:57,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:36:57,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:36:57,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:36:57,622 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 10:36:57,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 32 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-13 10:36:57,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:36:57,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 10:36:57,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:36:57,788 INFO L130 PetriNetUnfolder]: 529/810 cut-off events. [2022-12-13 10:36:57,788 INFO L131 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2022-12-13 10:36:57,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1920 conditions, 810 events. 529/810 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2610 event pairs, 371 based on Foata normal form. 52/712 useless extension candidates. Maximal degree in co-relation 753. Up to 691 conditions per place. [2022-12-13 10:36:57,792 INFO L137 encePairwiseOnDemand]: 21/30 looper letters, 31 selfloop transitions, 2 changer transitions 27/60 dead transitions. [2022-12-13 10:36:57,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 60 transitions, 269 flow [2022-12-13 10:36:57,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:36:57,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:36:57,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-13 10:36:57,795 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4266666666666667 [2022-12-13 10:36:57,795 INFO L175 Difference]: Start difference. First operand has 31 places, 32 transitions, 87 flow. Second operand 5 states and 64 transitions. [2022-12-13 10:36:57,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 60 transitions, 269 flow [2022-12-13 10:36:57,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 60 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 10:36:57,797 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 114 flow [2022-12-13 10:36:57,797 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2022-12-13 10:36:57,798 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2022-12-13 10:36:57,798 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:36:57,798 INFO L89 Accepts]: Start accepts. Operand has 37 places, 33 transitions, 114 flow [2022-12-13 10:36:57,800 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:36:57,801 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:36:57,801 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 33 transitions, 114 flow [2022-12-13 10:36:57,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 33 transitions, 114 flow [2022-12-13 10:36:57,810 INFO L130 PetriNetUnfolder]: 22/62 cut-off events. [2022-12-13 10:36:57,811 INFO L131 PetriNetUnfolder]: For 7/13 co-relation queries the response was YES. [2022-12-13 10:36:57,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 62 events. 22/62 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 146 event pairs, 4 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 19 conditions per place. [2022-12-13 10:36:57,812 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 33 transitions, 114 flow [2022-12-13 10:36:57,812 INFO L226 LiptonReduction]: Number of co-enabled transitions 214 [2022-12-13 10:36:59,373 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:36:59,375 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1577 [2022-12-13 10:36:59,375 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 110 flow [2022-12-13 10:36:59,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-13 10:36:59,375 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:36:59,375 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:36:59,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 10:36:59,377 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:36:59,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:36:59,378 INFO L85 PathProgramCache]: Analyzing trace with hash 602269161, now seen corresponding path program 1 times [2022-12-13 10:36:59,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:36:59,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121465973] [2022-12-13 10:36:59,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:36:59,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:36:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:36:59,561 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-13 10:36:59,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:36:59,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121465973] [2022-12-13 10:36:59,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121465973] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:36:59,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:36:59,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:36:59,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338318811] [2022-12-13 10:36:59,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:36:59,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:36:59,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:36:59,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:36:59,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:36:59,565 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 10:36:59,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-13 10:36:59,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:36:59,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 10:36:59,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:36:59,781 INFO L130 PetriNetUnfolder]: 759/1166 cut-off events. [2022-12-13 10:36:59,781 INFO L131 PetriNetUnfolder]: For 637/637 co-relation queries the response was YES. [2022-12-13 10:36:59,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3190 conditions, 1166 events. 759/1166 cut-off events. For 637/637 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4329 event pairs, 563 based on Foata normal form. 56/1039 useless extension candidates. Maximal degree in co-relation 3178. Up to 691 conditions per place. [2022-12-13 10:36:59,787 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 31 selfloop transitions, 2 changer transitions 35/68 dead transitions. [2022-12-13 10:36:59,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 68 transitions, 358 flow [2022-12-13 10:36:59,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:36:59,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:36:59,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-12-13 10:36:59,791 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-13 10:36:59,791 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 110 flow. Second operand 5 states and 70 transitions. [2022-12-13 10:36:59,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 68 transitions, 358 flow [2022-12-13 10:36:59,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 68 transitions, 336 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-13 10:36:59,794 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 118 flow [2022-12-13 10:36:59,794 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=118, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2022-12-13 10:36:59,795 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2022-12-13 10:36:59,795 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:36:59,795 INFO L89 Accepts]: Start accepts. Operand has 39 places, 33 transitions, 118 flow [2022-12-13 10:36:59,797 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:36:59,797 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:36:59,797 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 33 transitions, 118 flow [2022-12-13 10:36:59,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 33 transitions, 118 flow [2022-12-13 10:36:59,806 INFO L130 PetriNetUnfolder]: 22/62 cut-off events. [2022-12-13 10:36:59,806 INFO L131 PetriNetUnfolder]: For 11/17 co-relation queries the response was YES. [2022-12-13 10:36:59,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 62 events. 22/62 cut-off events. For 11/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 144 event pairs, 4 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 17 conditions per place. [2022-12-13 10:36:59,807 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 33 transitions, 118 flow [2022-12-13 10:36:59,808 INFO L226 LiptonReduction]: Number of co-enabled transitions 214 [2022-12-13 10:37:00,082 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:37:00,084 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 289 [2022-12-13 10:37:00,084 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 114 flow [2022-12-13 10:37:00,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-13 10:37:00,084 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:37:00,084 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:37:00,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 10:37:00,084 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:37:00,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:37:00,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1216932410, now seen corresponding path program 1 times [2022-12-13 10:37:00,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:37:00,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017285934] [2022-12-13 10:37:00,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:37:00,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:37:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:37:00,242 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-13 10:37:00,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:37:00,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017285934] [2022-12-13 10:37:00,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017285934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:37:00,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:37:00,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:37:00,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846201209] [2022-12-13 10:37:00,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:37:00,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:37:00,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:37:00,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:37:00,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:37:00,244 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 10:37:00,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-13 10:37:00,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:37:00,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 10:37:00,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:37:00,445 INFO L130 PetriNetUnfolder]: 797/1197 cut-off events. [2022-12-13 10:37:00,446 INFO L131 PetriNetUnfolder]: For 867/867 co-relation queries the response was YES. [2022-12-13 10:37:00,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3572 conditions, 1197 events. 797/1197 cut-off events. For 867/867 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4404 event pairs, 586 based on Foata normal form. 70/1030 useless extension candidates. Maximal degree in co-relation 3554. Up to 691 conditions per place. [2022-12-13 10:37:00,453 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 31 selfloop transitions, 2 changer transitions 21/54 dead transitions. [2022-12-13 10:37:00,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 54 transitions, 301 flow [2022-12-13 10:37:00,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:37:00,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:37:00,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-13 10:37:00,454 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2022-12-13 10:37:00,455 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 114 flow. Second operand 4 states and 53 transitions. [2022-12-13 10:37:00,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 54 transitions, 301 flow [2022-12-13 10:37:00,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 54 transitions, 261 flow, removed 20 selfloop flow, removed 5 redundant places. [2022-12-13 10:37:00,460 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 108 flow [2022-12-13 10:37:00,460 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=36, PETRI_TRANSITIONS=33} [2022-12-13 10:37:00,462 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2022-12-13 10:37:00,462 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:37:00,462 INFO L89 Accepts]: Start accepts. Operand has 36 places, 33 transitions, 108 flow [2022-12-13 10:37:00,463 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:37:00,463 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:37:00,464 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 33 transitions, 108 flow [2022-12-13 10:37:00,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 33 transitions, 108 flow [2022-12-13 10:37:00,474 INFO L130 PetriNetUnfolder]: 38/84 cut-off events. [2022-12-13 10:37:00,474 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 10:37:00,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 84 events. 38/84 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 208 event pairs, 10 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 160. Up to 33 conditions per place. [2022-12-13 10:37:00,475 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 33 transitions, 108 flow [2022-12-13 10:37:00,476 INFO L226 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-13 10:37:00,741 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:37:00,742 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 280 [2022-12-13 10:37:00,742 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 104 flow [2022-12-13 10:37:00,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-13 10:37:00,742 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:37:00,743 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:37:00,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 10:37:00,743 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:37:00,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:37:00,743 INFO L85 PathProgramCache]: Analyzing trace with hash -582879671, now seen corresponding path program 1 times [2022-12-13 10:37:00,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:37:00,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779154183] [2022-12-13 10:37:00,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:37:00,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:37:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:37:00,871 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-13 10:37:00,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:37:00,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779154183] [2022-12-13 10:37:00,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779154183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:37:00,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:37:00,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 10:37:00,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502306698] [2022-12-13 10:37:00,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:37:00,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:37:00,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:37:00,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:37:00,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:37:00,873 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 10:37:00,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 104 flow. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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-13 10:37:00,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:37:00,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 10:37:00,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:37:01,048 INFO L130 PetriNetUnfolder]: 839/1226 cut-off events. [2022-12-13 10:37:01,049 INFO L131 PetriNetUnfolder]: For 361/361 co-relation queries the response was YES. [2022-12-13 10:37:01,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3364 conditions, 1226 events. 839/1226 cut-off events. For 361/361 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4517 event pairs, 317 based on Foata normal form. 1/961 useless extension candidates. Maximal degree in co-relation 3344. Up to 645 conditions per place. [2022-12-13 10:37:01,055 INFO L137 encePairwiseOnDemand]: 27/30 looper letters, 46 selfloop transitions, 2 changer transitions 6/54 dead transitions. [2022-12-13 10:37:01,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 54 transitions, 285 flow [2022-12-13 10:37:01,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:37:01,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:37:01,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-12-13 10:37:01,056 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2022-12-13 10:37:01,056 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 104 flow. Second operand 3 states and 51 transitions. [2022-12-13 10:37:01,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 54 transitions, 285 flow [2022-12-13 10:37:01,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 54 transitions, 277 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 10:37:01,058 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 110 flow [2022-12-13 10:37:01,058 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2022-12-13 10:37:01,059 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2022-12-13 10:37:01,059 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:37:01,059 INFO L89 Accepts]: Start accepts. Operand has 35 places, 33 transitions, 110 flow [2022-12-13 10:37:01,060 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:37:01,060 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:37:01,060 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 33 transitions, 110 flow [2022-12-13 10:37:01,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 33 transitions, 110 flow [2022-12-13 10:37:01,071 INFO L130 PetriNetUnfolder]: 46/107 cut-off events. [2022-12-13 10:37:01,072 INFO L131 PetriNetUnfolder]: For 23/25 co-relation queries the response was YES. [2022-12-13 10:37:01,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 107 events. 46/107 cut-off events. For 23/25 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 337 event pairs, 14 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 194. Up to 39 conditions per place. [2022-12-13 10:37:01,073 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 33 transitions, 110 flow [2022-12-13 10:37:01,073 INFO L226 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-13 10:37:01,074 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:37:01,075 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 10:37:01,075 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 110 flow [2022-12-13 10:37:01,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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-13 10:37:01,075 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:37:01,075 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:37:01,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 10:37:01,075 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:37:01,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:37:01,076 INFO L85 PathProgramCache]: Analyzing trace with hash 971652712, now seen corresponding path program 1 times [2022-12-13 10:37:01,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:37:01,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046493137] [2022-12-13 10:37:01,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:37:01,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:37:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:37:01,198 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-13 10:37:01,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:37:01,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046493137] [2022-12-13 10:37:01,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046493137] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:37:01,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444603131] [2022-12-13 10:37:01,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:37:01,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:37:01,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:37:01,203 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-13 10:37:01,262 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-13 10:37:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:37:01,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 10:37:01,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:37:01,482 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-13 10:37:01,482 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:37:01,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444603131] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:37:01,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:37:01,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-13 10:37:01,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516991492] [2022-12-13 10:37:01,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:37:01,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:37:01,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:37:01,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:37:01,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:37:01,484 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 10:37:01,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-13 10:37:01,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:37:01,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 10:37:01,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:37:01,934 INFO L130 PetriNetUnfolder]: 1774/2682 cut-off events. [2022-12-13 10:37:01,934 INFO L131 PetriNetUnfolder]: For 1111/1111 co-relation queries the response was YES. [2022-12-13 10:37:01,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7582 conditions, 2682 events. 1774/2682 cut-off events. For 1111/1111 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12250 event pairs, 784 based on Foata normal form. 148/2294 useless extension candidates. Maximal degree in co-relation 4829. Up to 1227 conditions per place. [2022-12-13 10:37:01,946 INFO L137 encePairwiseOnDemand]: 21/30 looper letters, 32 selfloop transitions, 2 changer transitions 75/109 dead transitions. [2022-12-13 10:37:01,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 109 transitions, 554 flow [2022-12-13 10:37:01,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:37:01,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:37:01,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2022-12-13 10:37:01,947 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2022-12-13 10:37:01,948 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 110 flow. Second operand 7 states and 106 transitions. [2022-12-13 10:37:01,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 109 transitions, 554 flow [2022-12-13 10:37:01,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 109 transitions, 550 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 10:37:01,952 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 146 flow [2022-12-13 10:37:01,952 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=146, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2022-12-13 10:37:01,953 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2022-12-13 10:37:01,953 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:37:01,953 INFO L89 Accepts]: Start accepts. Operand has 45 places, 34 transitions, 146 flow [2022-12-13 10:37:01,954 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:37:01,954 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:37:01,954 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 34 transitions, 146 flow [2022-12-13 10:37:01,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 146 flow [2022-12-13 10:37:01,967 INFO L130 PetriNetUnfolder]: 46/108 cut-off events. [2022-12-13 10:37:01,968 INFO L131 PetriNetUnfolder]: For 81/95 co-relation queries the response was YES. [2022-12-13 10:37:01,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 108 events. 46/108 cut-off events. For 81/95 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 346 event pairs, 14 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 293. Up to 39 conditions per place. [2022-12-13 10:37:01,969 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 34 transitions, 146 flow [2022-12-13 10:37:01,969 INFO L226 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-13 10:37:03,907 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:37:03,908 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1955 [2022-12-13 10:37:03,908 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 142 flow [2022-12-13 10:37:03,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-13 10:37:03,908 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:37:03,908 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:37:03,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-13 10:37:04,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-13 10:37:04,115 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:37:04,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:37:04,116 INFO L85 PathProgramCache]: Analyzing trace with hash -651039405, now seen corresponding path program 1 times [2022-12-13 10:37:04,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:37:04,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395870853] [2022-12-13 10:37:04,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:37:04,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:37:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:37:04,343 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-13 10:37:04,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:37:04,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395870853] [2022-12-13 10:37:04,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395870853] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:37:04,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:37:04,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:37:04,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476631906] [2022-12-13 10:37:04,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:37:04,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:37:04,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:37:04,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:37:04,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:37:04,349 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 10:37:04,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-13 10:37:04,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:37:04,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 10:37:04,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:37:04,526 INFO L130 PetriNetUnfolder]: 658/961 cut-off events. [2022-12-13 10:37:04,526 INFO L131 PetriNetUnfolder]: For 1575/1575 co-relation queries the response was YES. [2022-12-13 10:37:04,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3461 conditions, 961 events. 658/961 cut-off events. For 1575/1575 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3026 event pairs, 269 based on Foata normal form. 38/754 useless extension candidates. Maximal degree in co-relation 3443. Up to 512 conditions per place. [2022-12-13 10:37:04,532 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 38 selfloop transitions, 3 changer transitions 5/46 dead transitions. [2022-12-13 10:37:04,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 300 flow [2022-12-13 10:37:04,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:37:04,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:37:04,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-13 10:37:04,535 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2022-12-13 10:37:04,535 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 142 flow. Second operand 3 states and 44 transitions. [2022-12-13 10:37:04,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 300 flow [2022-12-13 10:37:04,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 46 transitions, 258 flow, removed 21 selfloop flow, removed 5 redundant places. [2022-12-13 10:37:04,545 INFO L231 Difference]: Finished difference. Result has 38 places, 35 transitions, 141 flow [2022-12-13 10:37:04,545 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=38, PETRI_TRANSITIONS=35} [2022-12-13 10:37:04,546 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2022-12-13 10:37:04,546 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:37:04,546 INFO L89 Accepts]: Start accepts. Operand has 38 places, 35 transitions, 141 flow [2022-12-13 10:37:04,547 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:37:04,548 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:37:04,548 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 35 transitions, 141 flow [2022-12-13 10:37:04,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 35 transitions, 141 flow [2022-12-13 10:37:04,559 INFO L130 PetriNetUnfolder]: 33/105 cut-off events. [2022-12-13 10:37:04,559 INFO L131 PetriNetUnfolder]: For 32/38 co-relation queries the response was YES. [2022-12-13 10:37:04,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 105 events. 33/105 cut-off events. For 32/38 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 358 event pairs, 8 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 205. Up to 29 conditions per place. [2022-12-13 10:37:04,562 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 35 transitions, 141 flow [2022-12-13 10:37:04,562 INFO L226 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-13 10:37:04,563 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:37:04,570 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 10:37:04,570 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 35 transitions, 141 flow [2022-12-13 10:37:04,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-13 10:37:04,570 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:37:04,570 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:37:04,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 10:37:04,571 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:37:04,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:37:04,571 INFO L85 PathProgramCache]: Analyzing trace with hash -965008021, now seen corresponding path program 2 times [2022-12-13 10:37:04,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:37:04,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941376021] [2022-12-13 10:37:04,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:37:04,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:37:04,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:37:06,366 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-13 10:37:06,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:37:06,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941376021] [2022-12-13 10:37:06,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941376021] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:37:06,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705235685] [2022-12-13 10:37:06,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 10:37:06,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:37:06,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:37:06,368 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-13 10:37:06,371 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-13 10:37:06,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 10:37:06,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 10:37:06,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 10:37:06,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:37:06,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:37:06,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 10:37:06,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 10:37:06,887 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-13 10:37:06,887 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:37:06,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705235685] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:37:06,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:37:06,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 18 [2022-12-13 10:37:06,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533276425] [2022-12-13 10:37:06,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:37:06,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:37:06,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:37:06,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:37:06,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-12-13 10:37:06,889 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 10:37:06,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 35 transitions, 141 flow. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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-13 10:37:06,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:37:06,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 10:37:06,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:37:07,265 INFO L130 PetriNetUnfolder]: 1151/1730 cut-off events. [2022-12-13 10:37:07,266 INFO L131 PetriNetUnfolder]: For 1351/1351 co-relation queries the response was YES. [2022-12-13 10:37:07,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5831 conditions, 1730 events. 1151/1730 cut-off events. For 1351/1351 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6754 event pairs, 507 based on Foata normal form. 12/1324 useless extension candidates. Maximal degree in co-relation 4191. Up to 962 conditions per place. [2022-12-13 10:37:07,274 INFO L137 encePairwiseOnDemand]: 21/30 looper letters, 92 selfloop transitions, 8 changer transitions 2/102 dead transitions. [2022-12-13 10:37:07,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 102 transitions, 611 flow [2022-12-13 10:37:07,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:37:07,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:37:07,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2022-12-13 10:37:07,275 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-13 10:37:07,276 INFO L175 Difference]: Start difference. First operand has 38 places, 35 transitions, 141 flow. Second operand 7 states and 91 transitions. [2022-12-13 10:37:07,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 102 transitions, 611 flow [2022-12-13 10:37:07,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 102 transitions, 568 flow, removed 18 selfloop flow, removed 2 redundant places. [2022-12-13 10:37:07,279 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 198 flow [2022-12-13 10:37:07,279 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=198, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2022-12-13 10:37:07,279 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2022-12-13 10:37:07,280 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:37:07,280 INFO L89 Accepts]: Start accepts. Operand has 47 places, 42 transitions, 198 flow [2022-12-13 10:37:07,281 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:37:07,281 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:37:07,281 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 42 transitions, 198 flow [2022-12-13 10:37:07,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 42 transitions, 198 flow [2022-12-13 10:37:07,302 INFO L130 PetriNetUnfolder]: 76/222 cut-off events. [2022-12-13 10:37:07,303 INFO L131 PetriNetUnfolder]: For 177/191 co-relation queries the response was YES. [2022-12-13 10:37:07,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 222 events. 76/222 cut-off events. For 177/191 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 951 event pairs, 12 based on Foata normal form. 1/169 useless extension candidates. Maximal degree in co-relation 302. Up to 59 conditions per place. [2022-12-13 10:37:07,305 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 42 transitions, 198 flow [2022-12-13 10:37:07,305 INFO L226 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-13 10:37:11,976 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [960] L76-2-->L81: Formula: (and (= |v_thread2Thread1of1ForFork1_~j~0#1_25| (select (select |v_#memory_int_129| v_~q1~0.base_48) (+ v_~q1~0.offset_48 (* 4 v_~q1_front~0_39)))) (= (ite (and (<= 0 v_~q1_front~0_39) (< v_~q1_front~0_39 v_~n1~0_29) (< v_~q1_front~0_39 v_~q1_back~0_94)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (+ v_~q1_front~0_39 1) v_~q1_front~0_38) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~q1~0.offset=v_~q1~0.offset_48, ~q1_front~0=v_~q1_front~0_39, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, #memory_int=|v_#memory_int_129|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1~0.offset=v_~q1~0.offset_48, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_25|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_5|, ~q1_front~0=v_~q1_front~0_38, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_5|, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] and [1108] L160-22-->L142-2: Formula: (and (= (store |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31| (store (select |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre30#1_33|)) |v_#memory_int_265|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483648)) (= |v_ULTIMATE.start_main_#t~nondet29#1_48| v_~q3_front~0_102) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) (<= |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483647) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154| |v_ULTIMATE.start_create_fresh_int_array_~size#1_160|)) (<= |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483647) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| (ite (<= 0 v_~N~0_54) 1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483648)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483648)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| v_~q3~0.base_83) (= |v_#pthreadsForks_79| |v_ULTIMATE.start_main_#t~pre30#1_33|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| v_~q3~0.offset_83) (= (+ |v_#pthreadsForks_79| 1) |v_#pthreadsForks_78|) (= v_~q1_back~0_145 v_~q1_front~0_96) (= v_~q2_front~0_124 v_~q2_back~0_122) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213| 0)) (= |v_ULTIMATE.start_main_#t~nondet28#1_56| v_~q2_front~0_124) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|) (= v_~q3_front~0_102 v_~q3_back~0_120) (= |v_ULTIMATE.start_main_#t~nondet27#1_40| v_~q1_front~0_96) (<= |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483647)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, #pthreadsForks=|v_#pthreadsForks_79|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, #memory_int=|v_#memory_int_266|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_48|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_40|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_56|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ~q1_front~0=v_~q1_front~0_96, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_33|, ~q3_front~0=v_~q3_front~0_102, ~q3_back~0=v_~q3_back~0_120, #pthreadsForks=|v_#pthreadsForks_78|, ~q1_back~0=v_~q1_back~0_145, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|, ~q3~0.base=v_~q3~0.base_83, ~q2_back~0=v_~q2_back~0_122, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ~q2_front~0=v_~q2_front~0_124, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ~q3~0.offset=v_~q3~0.offset_83, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90|, #memory_int=|v_#memory_int_265|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167|} AuxVars[] AssignedVars[~q1_front~0, ULTIMATE.start_main_#t~ret26#1.base, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~nondet29#1, ~q3~0.offset, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~pre30#1, ~q3_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~q3_back~0, #pthreadsForks, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~q3~0.base, ~q2_back~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-13 10:37:12,266 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1061] L142-3-->L143-3: Formula: (and (= |v_#pthreadsForks_66| (+ |v_#pthreadsForks_67| 1)) (= (store |v_#memory_int_228| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_228| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre32#1_25|)) |v_#memory_int_227|) (= |v_#pthreadsForks_67| |v_ULTIMATE.start_main_#t~pre32#1_25|)) InVars {#pthreadsForks=|v_#pthreadsForks_67|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_228|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{#pthreadsForks=|v_#pthreadsForks_66|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_227|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_11|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_25|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_17|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_main_#t~pre32#1, ULTIMATE.start_main_#t~pre30#1] and [1108] L160-22-->L142-2: Formula: (and (= (store |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31| (store (select |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre30#1_33|)) |v_#memory_int_265|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483648)) (= |v_ULTIMATE.start_main_#t~nondet29#1_48| v_~q3_front~0_102) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) (<= |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483647) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154| |v_ULTIMATE.start_create_fresh_int_array_~size#1_160|)) (<= |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483647) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| (ite (<= 0 v_~N~0_54) 1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483648)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483648)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| v_~q3~0.base_83) (= |v_#pthreadsForks_79| |v_ULTIMATE.start_main_#t~pre30#1_33|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| v_~q3~0.offset_83) (= (+ |v_#pthreadsForks_79| 1) |v_#pthreadsForks_78|) (= v_~q1_back~0_145 v_~q1_front~0_96) (= v_~q2_front~0_124 v_~q2_back~0_122) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213| 0)) (= |v_ULTIMATE.start_main_#t~nondet28#1_56| v_~q2_front~0_124) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|) (= v_~q3_front~0_102 v_~q3_back~0_120) (= |v_ULTIMATE.start_main_#t~nondet27#1_40| v_~q1_front~0_96) (<= |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483647)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, #pthreadsForks=|v_#pthreadsForks_79|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, #memory_int=|v_#memory_int_266|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_48|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_40|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_56|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ~q1_front~0=v_~q1_front~0_96, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_33|, ~q3_front~0=v_~q3_front~0_102, ~q3_back~0=v_~q3_back~0_120, #pthreadsForks=|v_#pthreadsForks_78|, ~q1_back~0=v_~q1_back~0_145, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|, ~q3~0.base=v_~q3~0.base_83, ~q2_back~0=v_~q2_back~0_122, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ~q2_front~0=v_~q2_front~0_124, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ~q3~0.offset=v_~q3~0.offset_83, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90|, #memory_int=|v_#memory_int_265|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167|} AuxVars[] AssignedVars[~q1_front~0, ULTIMATE.start_main_#t~ret26#1.base, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~nondet29#1, ~q3~0.offset, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~pre30#1, ~q3_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~q3_back~0, #pthreadsForks, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~q3~0.base, ~q2_back~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-13 10:37:12,535 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [944] L52-2-->L56: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= 2 (select (select |v_#memory_int_119| v_~q1~0.base_46) (+ v_~q1~0.offset_46 (* 4 v_~q1_back~0_91)))) (= (+ 1 v_~q1_back~0_91) v_~q1_back~0_90) (< v_~q1_back~0_91 v_~n1~0_27) (= (ite |v_thread1_#t~short2#1_47| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (< |v_thread1Thread1of1ForFork0_~i~0#1_19| v_~N~0_10) (<= 0 v_~q1_back~0_91) |v_thread1_#t~short2#1_48| (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~q1~0.offset=v_~q1~0.offset_46, ~q1_back~0=v_~q1_back~0_91, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~q1~0.offset=v_~q1~0.offset_46, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_5|, ~q1_back~0=v_~q1_back~0_90, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[|v_thread1_#t~short2#1_48|, |v_thread1_#t~short2#1_47|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [960] L76-2-->L81: Formula: (and (= |v_thread2Thread1of1ForFork1_~j~0#1_25| (select (select |v_#memory_int_129| v_~q1~0.base_48) (+ v_~q1~0.offset_48 (* 4 v_~q1_front~0_39)))) (= (ite (and (<= 0 v_~q1_front~0_39) (< v_~q1_front~0_39 v_~n1~0_29) (< v_~q1_front~0_39 v_~q1_back~0_94)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (+ v_~q1_front~0_39 1) v_~q1_front~0_38) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~q1~0.offset=v_~q1~0.offset_48, ~q1_front~0=v_~q1_front~0_39, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, #memory_int=|v_#memory_int_129|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1~0.offset=v_~q1~0.offset_48, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_25|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_5|, ~q1_front~0=v_~q1_front~0_38, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_5|, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] [2022-12-13 10:37:12,711 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [944] L52-2-->L56: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= 2 (select (select |v_#memory_int_119| v_~q1~0.base_46) (+ v_~q1~0.offset_46 (* 4 v_~q1_back~0_91)))) (= (+ 1 v_~q1_back~0_91) v_~q1_back~0_90) (< v_~q1_back~0_91 v_~n1~0_27) (= (ite |v_thread1_#t~short2#1_47| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (< |v_thread1Thread1of1ForFork0_~i~0#1_19| v_~N~0_10) (<= 0 v_~q1_back~0_91) |v_thread1_#t~short2#1_48| (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~q1~0.offset=v_~q1~0.offset_46, ~q1_back~0=v_~q1_back~0_91, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~q1~0.offset=v_~q1~0.offset_46, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_5|, ~q1_back~0=v_~q1_back~0_90, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[|v_thread1_#t~short2#1_48|, |v_thread1_#t~short2#1_47|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [1061] L142-3-->L143-3: Formula: (and (= |v_#pthreadsForks_66| (+ |v_#pthreadsForks_67| 1)) (= (store |v_#memory_int_228| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_228| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre32#1_25|)) |v_#memory_int_227|) (= |v_#pthreadsForks_67| |v_ULTIMATE.start_main_#t~pre32#1_25|)) InVars {#pthreadsForks=|v_#pthreadsForks_67|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_228|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{#pthreadsForks=|v_#pthreadsForks_66|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_227|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_11|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_25|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_17|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_main_#t~pre32#1, ULTIMATE.start_main_#t~pre30#1] [2022-12-13 10:37:12,801 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [944] L52-2-->L56: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= 2 (select (select |v_#memory_int_119| v_~q1~0.base_46) (+ v_~q1~0.offset_46 (* 4 v_~q1_back~0_91)))) (= (+ 1 v_~q1_back~0_91) v_~q1_back~0_90) (< v_~q1_back~0_91 v_~n1~0_27) (= (ite |v_thread1_#t~short2#1_47| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (< |v_thread1Thread1of1ForFork0_~i~0#1_19| v_~N~0_10) (<= 0 v_~q1_back~0_91) |v_thread1_#t~short2#1_48| (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~q1~0.offset=v_~q1~0.offset_46, ~q1_back~0=v_~q1_back~0_91, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~q1~0.offset=v_~q1~0.offset_46, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_5|, ~q1_back~0=v_~q1_back~0_90, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[|v_thread1_#t~short2#1_48|, |v_thread1_#t~short2#1_47|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [1118] L142-3-->L142-2: Formula: (and (= |v_ULTIMATE.start_main_#t~nondet28#1_72| v_~q2_front~0_136) (<= |v_ULTIMATE.start_main_#t~nondet27#1_56| 2147483647) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) (<= |v_ULTIMATE.start_main_#t~nondet29#1_64| 2147483647) (= |v_ULTIMATE.start_main_#t~nondet29#1_64| v_~q3_front~0_122) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_189| (ite (<= 0 v_~N~0_76) 1 0)) (= v_~q2_front~0_136 v_~q2_back~0_142) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_189| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_235|) (= (+ |v_ULTIMATE.start_main_#t~pre30#1_49| 1) |v_#pthreadsForks_120|) (= (let ((.cse0 (store |v_#memory_int_348| |v_ULTIMATE.start_main_~#t2~0#1.base_51| (store (select |v_#memory_int_348| |v_ULTIMATE.start_main_~#t2~0#1.base_51|) |v_ULTIMATE.start_main_~#t2~0#1.offset_51| |v_ULTIMATE.start_main_#t~pre32#1_62|)))) (store .cse0 |v_ULTIMATE.start_main_~#t1~0#1.base_43| (store (select .cse0 |v_ULTIMATE.start_main_~#t1~0#1.base_43|) |v_ULTIMATE.start_main_~#t1~0#1.offset_43| |v_ULTIMATE.start_main_#t~pre30#1_49|))) |v_#memory_int_346|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet29#1_64| 2147483648)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet27#1_56| 2147483648)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_114| v_~q3~0.offset_99) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_196| |v_ULTIMATE.start_create_fresh_int_array_~size#1_192|)) (= (+ |v_#pthreadsForks_122| 1) |v_ULTIMATE.start_main_#t~pre30#1_49|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_114| v_~q3~0.base_99) (= |v_ULTIMATE.start_main_#t~nondet27#1_56| v_~q1_front~0_143) (= |v_ULTIMATE.start_main_#t~pre32#1_62| |v_#pthreadsForks_122|) (= v_~q3_front~0_122 v_~q3_back~0_136) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_164|) (<= |v_ULTIMATE.start_main_#t~nondet28#1_72| 2147483647) (= v_~q1_front~0_143 v_~q1_back~0_190) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet28#1_72| 2147483648)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_235| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_164|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_196|, ~N~0=v_~N~0_76, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_64|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_192|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_56|, #pthreadsForks=|v_#pthreadsForks_122|, #memory_int=|v_#memory_int_348|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_51|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_72|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_164|, ~q1_front~0=v_~q1_front~0_143, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_51|, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_47|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_196|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_114|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_49|, ~q3_front~0=v_~q3_front~0_122, ~q3_back~0=v_~q3_back~0_136, #pthreadsForks=|v_#pthreadsForks_120|, ~q1_back~0=v_~q1_back~0_190, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_235|, ~q3~0.base=v_~q3~0.base_99, ~q2_back~0=v_~q2_back~0_142, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_47|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_35|, ~q2_front~0=v_~q2_front~0_136, ~N~0=v_~N~0_76, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_62|, ~q3~0.offset=v_~q3~0.offset_99, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_192|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_114|, #memory_int=|v_#memory_int_346|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_51|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_189|} AuxVars[] AssignedVars[~q1_front~0, ULTIMATE.start_main_#t~ret26#1.base, ULTIMATE.start_main_#t~nondet31#1, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~nondet29#1, ULTIMATE.start_main_#t~pre32#1, ~q3~0.offset, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~pre30#1, ~q3_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~q3_back~0, #pthreadsForks, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~q3~0.base, ~q2_back~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-13 10:37:13,157 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:37:13,158 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5878 [2022-12-13 10:37:13,158 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 232 flow [2022-12-13 10:37:13,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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-13 10:37:13,158 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:37:13,158 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:37:13,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 10:37:13,366 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,SelfDestructingSolverStorable7 [2022-12-13 10:37:13,366 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:37:13,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:37:13,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1966629878, now seen corresponding path program 1 times [2022-12-13 10:37:13,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:37:13,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579318437] [2022-12-13 10:37:13,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:37:13,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:37:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:37:14,175 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-13 10:37:14,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:37:14,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579318437] [2022-12-13 10:37:14,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579318437] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:37:14,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396128341] [2022-12-13 10:37:14,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:37:14,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:37:14,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:37:14,178 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-13 10:37:14,202 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-13 10:37:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:37:14,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 10:37:14,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:37:14,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:37:14,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 10:37:14,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:37:14,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 10:37:14,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-13 10:37:14,474 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-13 10:37:14,475 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:37:14,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396128341] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:37:14,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:37:14,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2022-12-13 10:37:14,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318542502] [2022-12-13 10:37:14,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:37:14,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:37:14,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:37:14,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:37:14,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-12-13 10:37:14,477 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 10:37:14,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 232 flow. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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-13 10:37:14,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:37:14,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 10:37:14,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:37:14,910 INFO L130 PetriNetUnfolder]: 1002/1510 cut-off events. [2022-12-13 10:37:14,910 INFO L131 PetriNetUnfolder]: For 2231/2231 co-relation queries the response was YES. [2022-12-13 10:37:14,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5385 conditions, 1510 events. 1002/1510 cut-off events. For 2231/2231 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5799 event pairs, 433 based on Foata normal form. 6/1178 useless extension candidates. Maximal degree in co-relation 3321. Up to 960 conditions per place. [2022-12-13 10:37:14,920 INFO L137 encePairwiseOnDemand]: 26/36 looper letters, 81 selfloop transitions, 6 changer transitions 29/116 dead transitions. [2022-12-13 10:37:14,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 116 transitions, 773 flow [2022-12-13 10:37:14,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:37:14,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:37:14,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2022-12-13 10:37:14,921 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2022-12-13 10:37:14,922 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 232 flow. Second operand 8 states and 104 transitions. [2022-12-13 10:37:14,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 116 transitions, 773 flow [2022-12-13 10:37:14,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 116 transitions, 717 flow, removed 27 selfloop flow, removed 3 redundant places. [2022-12-13 10:37:14,928 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 200 flow [2022-12-13 10:37:14,928 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=200, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2022-12-13 10:37:14,929 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 20 predicate places. [2022-12-13 10:37:14,929 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:37:14,929 INFO L89 Accepts]: Start accepts. Operand has 54 places, 40 transitions, 200 flow [2022-12-13 10:37:14,931 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:37:14,932 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:37:14,932 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 40 transitions, 200 flow [2022-12-13 10:37:14,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 40 transitions, 200 flow [2022-12-13 10:37:14,963 INFO L130 PetriNetUnfolder]: 74/216 cut-off events. [2022-12-13 10:37:14,964 INFO L131 PetriNetUnfolder]: For 196/200 co-relation queries the response was YES. [2022-12-13 10:37:14,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 581 conditions, 216 events. 74/216 cut-off events. For 196/200 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 939 event pairs, 24 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 302. Up to 57 conditions per place. [2022-12-13 10:37:14,967 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 40 transitions, 200 flow [2022-12-13 10:37:14,967 INFO L226 LiptonReduction]: Number of co-enabled transitions 270 [2022-12-13 10:37:14,968 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:37:14,971 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-13 10:37:14,971 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 200 flow [2022-12-13 10:37:14,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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-13 10:37:14,971 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:37:14,971 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:37:14,981 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-13 10:37:15,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:37:15,178 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:37:15,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:37:15,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1252749932, now seen corresponding path program 1 times [2022-12-13 10:37:15,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:37:15,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589443936] [2022-12-13 10:37:15,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:37:15,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:37:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:37:16,126 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-13 10:37:16,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:37:16,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589443936] [2022-12-13 10:37:16,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589443936] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:37:16,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331745600] [2022-12-13 10:37:16,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:37:16,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:37:16,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:37:16,129 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-13 10:37:16,131 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-13 10:37:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:37:16,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 10:37:16,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:37:16,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:37:16,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 10:37:16,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-13 10:37:16,441 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-13 10:37:16,442 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:37:16,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331745600] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:37:16,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:37:16,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2022-12-13 10:37:16,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443955198] [2022-12-13 10:37:16,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:37:16,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:37:16,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:37:16,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:37:16,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-12-13 10:37:16,443 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 10:37:16,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 200 flow. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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-13 10:37:16,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:37:16,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 10:37:16,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:37:16,751 INFO L130 PetriNetUnfolder]: 778/1214 cut-off events. [2022-12-13 10:37:16,751 INFO L131 PetriNetUnfolder]: For 1938/1938 co-relation queries the response was YES. [2022-12-13 10:37:16,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4372 conditions, 1214 events. 778/1214 cut-off events. For 1938/1938 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4513 event pairs, 264 based on Foata normal form. 18/986 useless extension candidates. Maximal degree in co-relation 2712. Up to 983 conditions per place. [2022-12-13 10:37:16,759 INFO L137 encePairwiseOnDemand]: 22/32 looper letters, 64 selfloop transitions, 9 changer transitions 2/75 dead transitions. [2022-12-13 10:37:16,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 75 transitions, 490 flow [2022-12-13 10:37:16,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:37:16,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:37:16,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-12-13 10:37:16,761 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29464285714285715 [2022-12-13 10:37:16,761 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 200 flow. Second operand 7 states and 66 transitions. [2022-12-13 10:37:16,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 75 transitions, 490 flow [2022-12-13 10:37:16,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 75 transitions, 453 flow, removed 15 selfloop flow, removed 5 redundant places. [2022-12-13 10:37:16,765 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 242 flow [2022-12-13 10:37:16,766 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=242, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2022-12-13 10:37:16,766 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2022-12-13 10:37:16,767 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:37:16,767 INFO L89 Accepts]: Start accepts. Operand has 55 places, 45 transitions, 242 flow [2022-12-13 10:37:16,768 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:37:16,768 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:37:16,768 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 45 transitions, 242 flow [2022-12-13 10:37:16,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 45 transitions, 242 flow [2022-12-13 10:37:16,792 INFO L130 PetriNetUnfolder]: 85/229 cut-off events. [2022-12-13 10:37:16,792 INFO L131 PetriNetUnfolder]: For 206/207 co-relation queries the response was YES. [2022-12-13 10:37:16,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 229 events. 85/229 cut-off events. For 206/207 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 915 event pairs, 20 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 466. Up to 69 conditions per place. [2022-12-13 10:37:16,795 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 45 transitions, 242 flow [2022-12-13 10:37:16,795 INFO L226 LiptonReduction]: Number of co-enabled transitions 220 [2022-12-13 10:37:16,805 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [944] L52-2-->L56: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= 2 (select (select |v_#memory_int_119| v_~q1~0.base_46) (+ v_~q1~0.offset_46 (* 4 v_~q1_back~0_91)))) (= (+ 1 v_~q1_back~0_91) v_~q1_back~0_90) (< v_~q1_back~0_91 v_~n1~0_27) (= (ite |v_thread1_#t~short2#1_47| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (< |v_thread1Thread1of1ForFork0_~i~0#1_19| v_~N~0_10) (<= 0 v_~q1_back~0_91) |v_thread1_#t~short2#1_48| (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~q1~0.offset=v_~q1~0.offset_46, ~q1_back~0=v_~q1_back~0_91, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~q1~0.offset=v_~q1~0.offset_46, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_5|, ~q1_back~0=v_~q1_back~0_90, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[|v_thread1_#t~short2#1_48|, |v_thread1_#t~short2#1_47|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [1061] L142-3-->L143-3: Formula: (and (= |v_#pthreadsForks_66| (+ |v_#pthreadsForks_67| 1)) (= (store |v_#memory_int_228| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_228| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre32#1_25|)) |v_#memory_int_227|) (= |v_#pthreadsForks_67| |v_ULTIMATE.start_main_#t~pre32#1_25|)) InVars {#pthreadsForks=|v_#pthreadsForks_67|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_228|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{#pthreadsForks=|v_#pthreadsForks_66|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_227|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_11|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_25|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_17|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_main_#t~pre32#1, ULTIMATE.start_main_#t~pre30#1] [2022-12-13 10:37:16,904 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [944] L52-2-->L56: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= 2 (select (select |v_#memory_int_119| v_~q1~0.base_46) (+ v_~q1~0.offset_46 (* 4 v_~q1_back~0_91)))) (= (+ 1 v_~q1_back~0_91) v_~q1_back~0_90) (< v_~q1_back~0_91 v_~n1~0_27) (= (ite |v_thread1_#t~short2#1_47| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (< |v_thread1Thread1of1ForFork0_~i~0#1_19| v_~N~0_10) (<= 0 v_~q1_back~0_91) |v_thread1_#t~short2#1_48| (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~q1~0.offset=v_~q1~0.offset_46, ~q1_back~0=v_~q1_back~0_91, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~q1~0.offset=v_~q1~0.offset_46, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_5|, ~q1_back~0=v_~q1_back~0_90, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[|v_thread1_#t~short2#1_48|, |v_thread1_#t~short2#1_47|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [960] L76-2-->L81: Formula: (and (= |v_thread2Thread1of1ForFork1_~j~0#1_25| (select (select |v_#memory_int_129| v_~q1~0.base_48) (+ v_~q1~0.offset_48 (* 4 v_~q1_front~0_39)))) (= (ite (and (<= 0 v_~q1_front~0_39) (< v_~q1_front~0_39 v_~n1~0_29) (< v_~q1_front~0_39 v_~q1_back~0_94)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (+ v_~q1_front~0_39 1) v_~q1_front~0_38) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~q1~0.offset=v_~q1~0.offset_48, ~q1_front~0=v_~q1_front~0_39, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, #memory_int=|v_#memory_int_129|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1~0.offset=v_~q1~0.offset_48, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_25|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_5|, ~q1_front~0=v_~q1_front~0_38, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_5|, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] [2022-12-13 10:37:17,079 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:37:17,080 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 313 [2022-12-13 10:37:17,080 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 244 flow [2022-12-13 10:37:17,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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-13 10:37:17,080 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:37:17,081 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:37:17,091 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-13 10:37:17,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:37:17,281 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:37:17,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:37:17,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1281291401, now seen corresponding path program 1 times [2022-12-13 10:37:17,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:37:17,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061808466] [2022-12-13 10:37:17,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:37:17,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:37:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:37:17,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:37:17,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:37:17,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061808466] [2022-12-13 10:37:17,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061808466] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:37:17,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959460581] [2022-12-13 10:37:17,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:37:17,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:37:17,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:37:17,414 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:37:17,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 10:37:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:37:17,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 10:37:17,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:37:17,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:37:17,620 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:37:17,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959460581] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:37:17,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:37:17,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-13 10:37:17,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273630421] [2022-12-13 10:37:17,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:37:17,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:37:17,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:37:17,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:37:17,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:37:17,623 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 10:37:17,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 244 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-13 10:37:17,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:37:17,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 10:37:17,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:37:18,031 INFO L130 PetriNetUnfolder]: 1357/2218 cut-off events. [2022-12-13 10:37:18,033 INFO L131 PetriNetUnfolder]: For 3730/3730 co-relation queries the response was YES. [2022-12-13 10:37:18,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8229 conditions, 2218 events. 1357/2218 cut-off events. For 3730/3730 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 10259 event pairs, 530 based on Foata normal form. 104/1942 useless extension candidates. Maximal degree in co-relation 5079. Up to 915 conditions per place. [2022-12-13 10:37:18,052 INFO L137 encePairwiseOnDemand]: 27/34 looper letters, 101 selfloop transitions, 7 changer transitions 19/127 dead transitions. [2022-12-13 10:37:18,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 127 transitions, 932 flow [2022-12-13 10:37:18,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:37:18,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:37:18,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2022-12-13 10:37:18,053 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44537815126050423 [2022-12-13 10:37:18,054 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 244 flow. Second operand 7 states and 106 transitions. [2022-12-13 10:37:18,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 127 transitions, 932 flow [2022-12-13 10:37:18,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 127 transitions, 882 flow, removed 24 selfloop flow, removed 2 redundant places. [2022-12-13 10:37:18,059 INFO L231 Difference]: Finished difference. Result has 63 places, 49 transitions, 297 flow [2022-12-13 10:37:18,060 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=297, PETRI_PLACES=63, PETRI_TRANSITIONS=49} [2022-12-13 10:37:18,060 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 29 predicate places. [2022-12-13 10:37:18,060 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:37:18,060 INFO L89 Accepts]: Start accepts. Operand has 63 places, 49 transitions, 297 flow [2022-12-13 10:37:18,064 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:37:18,065 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:37:18,065 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 49 transitions, 297 flow [2022-12-13 10:37:18,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 49 transitions, 297 flow [2022-12-13 10:37:18,096 INFO L130 PetriNetUnfolder]: 98/320 cut-off events. [2022-12-13 10:37:18,097 INFO L131 PetriNetUnfolder]: For 297/297 co-relation queries the response was YES. [2022-12-13 10:37:18,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 904 conditions, 320 events. 98/320 cut-off events. For 297/297 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1570 event pairs, 20 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 575. Up to 83 conditions per place. [2022-12-13 10:37:18,101 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 49 transitions, 297 flow [2022-12-13 10:37:18,101 INFO L226 LiptonReduction]: Number of co-enabled transitions 224 [2022-12-13 10:37:18,517 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:37:18,518 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 458 [2022-12-13 10:37:18,518 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 49 transitions, 301 flow [2022-12-13 10:37:18,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-13 10:37:18,518 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:37:18,518 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:37:18,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 10:37:18,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 10:37:18,719 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:37:18,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:37:18,720 INFO L85 PathProgramCache]: Analyzing trace with hash 285743505, now seen corresponding path program 1 times [2022-12-13 10:37:18,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:37:18,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138780850] [2022-12-13 10:37:18,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:37:18,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:37:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:37:19,598 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-13 10:37:19,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:37:19,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138780850] [2022-12-13 10:37:19,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138780850] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:37:19,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403703570] [2022-12-13 10:37:19,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:37:19,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:37:19,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:37:19,604 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:37:19,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 10:37:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:37:19,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 10:37:19,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:37:19,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:37:19,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 10:37:19,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:37:19,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 10:37:19,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-13 10:37:19,967 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-13 10:37:19,967 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:37:19,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403703570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:37:19,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:37:19,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2022-12-13 10:37:19,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721437882] [2022-12-13 10:37:19,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:37:19,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:37:19,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:37:19,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:37:19,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 10:37:19,970 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-13 10:37:19,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 49 transitions, 301 flow. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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-13 10:37:19,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:37:19,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-13 10:37:19,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:37:20,392 INFO L130 PetriNetUnfolder]: 784/1277 cut-off events. [2022-12-13 10:37:20,392 INFO L131 PetriNetUnfolder]: For 2245/2245 co-relation queries the response was YES. [2022-12-13 10:37:20,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4802 conditions, 1277 events. 784/1277 cut-off events. For 2245/2245 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5234 event pairs, 136 based on Foata normal form. 32/1087 useless extension candidates. Maximal degree in co-relation 3613. Up to 584 conditions per place. [2022-12-13 10:37:20,406 INFO L137 encePairwiseOnDemand]: 24/35 looper letters, 79 selfloop transitions, 15 changer transitions 2/96 dead transitions. [2022-12-13 10:37:20,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 96 transitions, 700 flow [2022-12-13 10:37:20,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:37:20,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:37:20,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2022-12-13 10:37:20,408 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26031746031746034 [2022-12-13 10:37:20,408 INFO L175 Difference]: Start difference. First operand has 63 places, 49 transitions, 301 flow. Second operand 9 states and 82 transitions. [2022-12-13 10:37:20,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 96 transitions, 700 flow [2022-12-13 10:37:20,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 96 transitions, 675 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-12-13 10:37:20,419 INFO L231 Difference]: Finished difference. Result has 67 places, 49 transitions, 320 flow [2022-12-13 10:37:20,419 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=320, PETRI_PLACES=67, PETRI_TRANSITIONS=49} [2022-12-13 10:37:20,421 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 33 predicate places. [2022-12-13 10:37:20,422 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:37:20,422 INFO L89 Accepts]: Start accepts. Operand has 67 places, 49 transitions, 320 flow [2022-12-13 10:37:20,423 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:37:20,423 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:37:20,423 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 49 transitions, 320 flow [2022-12-13 10:37:20,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 49 transitions, 320 flow [2022-12-13 10:37:20,453 INFO L130 PetriNetUnfolder]: 105/266 cut-off events. [2022-12-13 10:37:20,453 INFO L131 PetriNetUnfolder]: For 416/416 co-relation queries the response was YES. [2022-12-13 10:37:20,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 863 conditions, 266 events. 105/266 cut-off events. For 416/416 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1093 event pairs, 28 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 486. Up to 84 conditions per place. [2022-12-13 10:37:20,457 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 49 transitions, 320 flow [2022-12-13 10:37:20,457 INFO L226 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-13 10:37:23,893 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:37:23,894 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3472 [2022-12-13 10:37:23,894 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 48 transitions, 318 flow [2022-12-13 10:37:23,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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-13 10:37:23,894 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:37:23,894 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:37:23,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 10:37:24,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:37:24,095 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:37:24,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:37:24,095 INFO L85 PathProgramCache]: Analyzing trace with hash 888473660, now seen corresponding path program 1 times [2022-12-13 10:37:24,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:37:24,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494079287] [2022-12-13 10:37:24,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:37:24,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:37:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:37:25,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:37:25,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:37:25,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494079287] [2022-12-13 10:37:25,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494079287] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:37:25,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131534629] [2022-12-13 10:37:25,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:37:25,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:37:25,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:37:25,079 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:37:25,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 10:37:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:37:25,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 10:37:25,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:37:25,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:37:25,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 10:37:25,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:37:25,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 10:37:25,646 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-12-13 10:37:25,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 12 [2022-12-13 10:37:25,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:37:25,652 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:37:25,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131534629] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:37:25,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:37:25,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17 [2022-12-13 10:37:25,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790676773] [2022-12-13 10:37:25,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:37:25,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:37:25,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:37:25,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:37:25,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-12-13 10:37:25,654 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 10:37:25,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 48 transitions, 318 flow. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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-13 10:37:25,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:37:25,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 10:37:25,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:37:26,151 INFO L130 PetriNetUnfolder]: 724/1130 cut-off events. [2022-12-13 10:37:26,151 INFO L131 PetriNetUnfolder]: For 2595/2595 co-relation queries the response was YES. [2022-12-13 10:37:26,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4562 conditions, 1130 events. 724/1130 cut-off events. For 2595/2595 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4032 event pairs, 251 based on Foata normal form. 0/964 useless extension candidates. Maximal degree in co-relation 2546. Up to 629 conditions per place. [2022-12-13 10:37:26,160 INFO L137 encePairwiseOnDemand]: 27/34 looper letters, 88 selfloop transitions, 8 changer transitions 4/100 dead transitions. [2022-12-13 10:37:26,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 100 transitions, 735 flow [2022-12-13 10:37:26,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:37:26,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:37:26,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2022-12-13 10:37:26,161 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36134453781512604 [2022-12-13 10:37:26,161 INFO L175 Difference]: Start difference. First operand has 64 places, 48 transitions, 318 flow. Second operand 7 states and 86 transitions. [2022-12-13 10:37:26,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 100 transitions, 735 flow [2022-12-13 10:37:26,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 100 transitions, 662 flow, removed 31 selfloop flow, removed 6 redundant places. [2022-12-13 10:37:26,167 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 319 flow [2022-12-13 10:37:26,168 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=319, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2022-12-13 10:37:26,169 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 32 predicate places. [2022-12-13 10:37:26,169 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:37:26,169 INFO L89 Accepts]: Start accepts. Operand has 66 places, 53 transitions, 319 flow [2022-12-13 10:37:26,170 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:37:26,170 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:37:26,170 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 53 transitions, 319 flow [2022-12-13 10:37:26,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 53 transitions, 319 flow [2022-12-13 10:37:26,201 INFO L130 PetriNetUnfolder]: 118/284 cut-off events. [2022-12-13 10:37:26,201 INFO L131 PetriNetUnfolder]: For 332/339 co-relation queries the response was YES. [2022-12-13 10:37:26,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 902 conditions, 284 events. 118/284 cut-off events. For 332/339 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1175 event pairs, 20 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 464. Up to 111 conditions per place. [2022-12-13 10:37:26,205 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 53 transitions, 319 flow [2022-12-13 10:37:26,205 INFO L226 LiptonReduction]: Number of co-enabled transitions 264 [2022-12-13 10:37:26,211 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [960] L76-2-->L81: Formula: (and (= |v_thread2Thread1of1ForFork1_~j~0#1_25| (select (select |v_#memory_int_129| v_~q1~0.base_48) (+ v_~q1~0.offset_48 (* 4 v_~q1_front~0_39)))) (= (ite (and (<= 0 v_~q1_front~0_39) (< v_~q1_front~0_39 v_~n1~0_29) (< v_~q1_front~0_39 v_~q1_back~0_94)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (+ v_~q1_front~0_39 1) v_~q1_front~0_38) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~q1~0.offset=v_~q1~0.offset_48, ~q1_front~0=v_~q1_front~0_39, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, #memory_int=|v_#memory_int_129|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1~0.offset=v_~q1~0.offset_48, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_25|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_5|, ~q1_front~0=v_~q1_front~0_38, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_5|, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] and [1051] L143-4-->L144-3: Formula: (and (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= (store |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27| (store (select |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27|) |v_ULTIMATE.start_main_~#t3~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre34#1_23|)) |v_#memory_int_209|) (= |v_#pthreadsForks_59| |v_ULTIMATE.start_main_#t~pre34#1_23|)) InVars {#pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_210|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|} OutVars{#pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_9|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_209|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_23|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_21|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet33#1, #memory_int, ULTIMATE.start_main_#t~pre34#1, ULTIMATE.start_main_#t~pre32#1] [2022-12-13 10:37:26,408 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:37:26,409 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 240 [2022-12-13 10:37:26,409 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 325 flow [2022-12-13 10:37:26,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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-13 10:37:26,409 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:37:26,409 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:37:26,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 10:37:26,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:37:26,616 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:37:26,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:37:26,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1618413964, now seen corresponding path program 1 times [2022-12-13 10:37:26,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:37:26,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657374064] [2022-12-13 10:37:26,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:37:26,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:37:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:37:26,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:37:26,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:37:26,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657374064] [2022-12-13 10:37:26,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657374064] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:37:26,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:37:26,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:37:26,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116306203] [2022-12-13 10:37:26,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:37:26,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:37:26,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:37:26,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:37:26,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:37:26,776 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 10:37:26,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 325 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-13 10:37:26,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:37:26,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 10:37:26,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:37:27,091 INFO L130 PetriNetUnfolder]: 1245/1907 cut-off events. [2022-12-13 10:37:27,091 INFO L131 PetriNetUnfolder]: For 3570/3570 co-relation queries the response was YES. [2022-12-13 10:37:27,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7598 conditions, 1907 events. 1245/1907 cut-off events. For 3570/3570 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7714 event pairs, 209 based on Foata normal form. 69/1582 useless extension candidates. Maximal degree in co-relation 4160. Up to 790 conditions per place. [2022-12-13 10:37:27,108 INFO L137 encePairwiseOnDemand]: 27/36 looper letters, 70 selfloop transitions, 17 changer transitions 2/89 dead transitions. [2022-12-13 10:37:27,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 89 transitions, 685 flow [2022-12-13 10:37:27,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:37:27,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:37:27,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-12-13 10:37:27,110 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4930555555555556 [2022-12-13 10:37:27,110 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 325 flow. Second operand 4 states and 71 transitions. [2022-12-13 10:37:27,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 89 transitions, 685 flow [2022-12-13 10:37:27,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 89 transitions, 680 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 10:37:27,117 INFO L231 Difference]: Finished difference. Result has 70 places, 58 transitions, 450 flow [2022-12-13 10:37:27,117 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=450, PETRI_PLACES=70, PETRI_TRANSITIONS=58} [2022-12-13 10:37:27,118 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 36 predicate places. [2022-12-13 10:37:27,118 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:37:27,118 INFO L89 Accepts]: Start accepts. Operand has 70 places, 58 transitions, 450 flow [2022-12-13 10:37:27,119 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:37:27,119 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:37:27,119 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 58 transitions, 450 flow [2022-12-13 10:37:27,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 58 transitions, 450 flow [2022-12-13 10:37:27,170 INFO L130 PetriNetUnfolder]: 186/453 cut-off events. [2022-12-13 10:37:27,171 INFO L131 PetriNetUnfolder]: For 819/825 co-relation queries the response was YES. [2022-12-13 10:37:27,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1705 conditions, 453 events. 186/453 cut-off events. For 819/825 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2191 event pairs, 8 based on Foata normal form. 1/335 useless extension candidates. Maximal degree in co-relation 989. Up to 165 conditions per place. [2022-12-13 10:37:27,176 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 58 transitions, 450 flow [2022-12-13 10:37:27,177 INFO L226 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-13 10:37:27,178 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [944] L52-2-->L56: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= 2 (select (select |v_#memory_int_119| v_~q1~0.base_46) (+ v_~q1~0.offset_46 (* 4 v_~q1_back~0_91)))) (= (+ 1 v_~q1_back~0_91) v_~q1_back~0_90) (< v_~q1_back~0_91 v_~n1~0_27) (= (ite |v_thread1_#t~short2#1_47| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (< |v_thread1Thread1of1ForFork0_~i~0#1_19| v_~N~0_10) (<= 0 v_~q1_back~0_91) |v_thread1_#t~short2#1_48| (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~q1~0.offset=v_~q1~0.offset_46, ~q1_back~0=v_~q1_back~0_91, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~q1~0.offset=v_~q1~0.offset_46, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_5|, ~q1_back~0=v_~q1_back~0_90, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[|v_thread1_#t~short2#1_48|, |v_thread1_#t~short2#1_47|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [960] L76-2-->L81: Formula: (and (= |v_thread2Thread1of1ForFork1_~j~0#1_25| (select (select |v_#memory_int_129| v_~q1~0.base_48) (+ v_~q1~0.offset_48 (* 4 v_~q1_front~0_39)))) (= (ite (and (<= 0 v_~q1_front~0_39) (< v_~q1_front~0_39 v_~n1~0_29) (< v_~q1_front~0_39 v_~q1_back~0_94)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (+ v_~q1_front~0_39 1) v_~q1_front~0_38) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~q1~0.offset=v_~q1~0.offset_48, ~q1_front~0=v_~q1_front~0_39, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, #memory_int=|v_#memory_int_129|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1~0.offset=v_~q1~0.offset_48, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_25|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_5|, ~q1_front~0=v_~q1_front~0_38, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_5|, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] [2022-12-13 10:37:27,360 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1128] L76-2-->L76-2: Formula: (and (= (ite |v_thread2_#t~short13#1_136| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_60|) (= |v_thread2Thread1of1ForFork1_~s~0#1_51| (+ |v_thread2Thread1of1ForFork1_~s~0#1_52| |v_thread2Thread1of1ForFork1_~j~0#1_80|)) (not (<= |v_thread2Thread1of1ForFork1_~j~0#1_80| 0)) |v_thread2_#t~short13#1_135| (= (select (select |v_#memory_int_409| v_~q1~0.base_144) (+ (* v_~q1_front~0_170 4) v_~q1~0.offset_143)) |v_thread2Thread1of1ForFork1_~j~0#1_80|) (not (= (ite (and (< v_~q1_front~0_170 v_~n1~0_128) (< v_~q1_front~0_170 v_~q1_back~0_236) (<= 0 v_~q1_front~0_170)) 1 0) 0)) (= (+ v_~q2_back~0_152 1) v_~q2_back~0_151) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_60| 0)) (<= 0 v_~q2_back~0_152) (< v_~q2_back~0_152 v_~n2~0_116) (= |v_thread2Thread1of1ForFork1_~j~0#1_80| (+ (select (select |v_#memory_int_409| v_~q2~0.base_109) (+ v_~q2~0.offset_109 (* 4 v_~q2_back~0_152))) 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_60| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_60|) (= (+ v_~q1_front~0_170 1) v_~q1_front~0_169)) InVars {~q1~0.offset=v_~q1~0.offset_143, ~n2~0=v_~n2~0_116, ~q1_front~0=v_~q1_front~0_170, ~q1_back~0=v_~q1_back~0_236, ~q2~0.offset=v_~q2~0.offset_109, ~n1~0=v_~n1~0_128, ~q1~0.base=v_~q1~0.base_144, #memory_int=|v_#memory_int_409|, ~q2~0.base=v_~q2~0.base_109, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_52|, ~q2_back~0=v_~q2_back~0_152} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_80|, thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_25|, ~q1~0.offset=v_~q1~0.offset_143, ~n2~0=v_~n2~0_116, ~q1_front~0=v_~q1_front~0_169, ~q2~0.offset=v_~q2~0.offset_109, ~n1~0=v_~n1~0_128, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_60|, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_51|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_60|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_38|, ~q1_back~0=v_~q1_back~0_236, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_25|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_37|, ~q1~0.base=v_~q1~0.base_144, #memory_int=|v_#memory_int_409|, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_38|, ~q2~0.base=v_~q2~0.base_109, ~q2_back~0=v_~q2_back~0_151} AuxVars[|v_thread2_#t~short13#1_135|, |v_thread2_#t~short13#1_136|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#t~short13#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~s~0#1, ~q2_back~0] and [1051] L143-4-->L144-3: Formula: (and (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= (store |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27| (store (select |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27|) |v_ULTIMATE.start_main_~#t3~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre34#1_23|)) |v_#memory_int_209|) (= |v_#pthreadsForks_59| |v_ULTIMATE.start_main_#t~pre34#1_23|)) InVars {#pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_210|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|} OutVars{#pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_9|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_209|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_23|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_21|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet33#1, #memory_int, ULTIMATE.start_main_#t~pre34#1, ULTIMATE.start_main_#t~pre32#1] [2022-12-13 10:37:27,502 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1128] L76-2-->L76-2: Formula: (and (= (ite |v_thread2_#t~short13#1_136| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_60|) (= |v_thread2Thread1of1ForFork1_~s~0#1_51| (+ |v_thread2Thread1of1ForFork1_~s~0#1_52| |v_thread2Thread1of1ForFork1_~j~0#1_80|)) (not (<= |v_thread2Thread1of1ForFork1_~j~0#1_80| 0)) |v_thread2_#t~short13#1_135| (= (select (select |v_#memory_int_409| v_~q1~0.base_144) (+ (* v_~q1_front~0_170 4) v_~q1~0.offset_143)) |v_thread2Thread1of1ForFork1_~j~0#1_80|) (not (= (ite (and (< v_~q1_front~0_170 v_~n1~0_128) (< v_~q1_front~0_170 v_~q1_back~0_236) (<= 0 v_~q1_front~0_170)) 1 0) 0)) (= (+ v_~q2_back~0_152 1) v_~q2_back~0_151) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_60| 0)) (<= 0 v_~q2_back~0_152) (< v_~q2_back~0_152 v_~n2~0_116) (= |v_thread2Thread1of1ForFork1_~j~0#1_80| (+ (select (select |v_#memory_int_409| v_~q2~0.base_109) (+ v_~q2~0.offset_109 (* 4 v_~q2_back~0_152))) 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_60| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_60|) (= (+ v_~q1_front~0_170 1) v_~q1_front~0_169)) InVars {~q1~0.offset=v_~q1~0.offset_143, ~n2~0=v_~n2~0_116, ~q1_front~0=v_~q1_front~0_170, ~q1_back~0=v_~q1_back~0_236, ~q2~0.offset=v_~q2~0.offset_109, ~n1~0=v_~n1~0_128, ~q1~0.base=v_~q1~0.base_144, #memory_int=|v_#memory_int_409|, ~q2~0.base=v_~q2~0.base_109, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_52|, ~q2_back~0=v_~q2_back~0_152} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_80|, thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_25|, ~q1~0.offset=v_~q1~0.offset_143, ~n2~0=v_~n2~0_116, ~q1_front~0=v_~q1_front~0_169, ~q2~0.offset=v_~q2~0.offset_109, ~n1~0=v_~n1~0_128, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_60|, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_51|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_60|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_38|, ~q1_back~0=v_~q1_back~0_236, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_25|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_37|, ~q1~0.base=v_~q1~0.base_144, #memory_int=|v_#memory_int_409|, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_38|, ~q2~0.base=v_~q2~0.base_109, ~q2_back~0=v_~q2_back~0_151} AuxVars[|v_thread2_#t~short13#1_135|, |v_thread2_#t~short13#1_136|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#t~short13#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~s~0#1, ~q2_back~0] and [1053] L98-2-->L98-2: Formula: (and (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= (+ (select (select |v_#memory_int_217| v_~q3~0.base_57) (+ (* v_~q3_back~0_83 4) v_~q3~0.offset_57)) 1) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (= v_~q3_back~0_82 (+ v_~q3_back~0_83 1)) |v_thread3_#t~short18#1_69| (< v_~q3_back~0_83 v_~n3~0_52) (= (select (select |v_#memory_int_217| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* 4 v_~q2_front~0_89))) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_80) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_48)) 1 0) 0)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_35| 0)) (= (+ |v_thread3Thread1of1ForFork2_~t~0#1_24| |v_thread3Thread1of1ForFork2_~k~0#1_35|) |v_thread3Thread1of1ForFork2_~t~0#1_23|) (<= 0 v_~q3_back~0_83) (= (ite |v_thread3_#t~short18#1_70| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| 0))) InVars {~q3_back~0=v_~q3_back~0_83, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_24|, ~q3~0.offset=v_~q3~0.offset_57, ~q2_back~0=v_~q2_back~0_80} OutVars{thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_17|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_17|, ~q2_front~0=v_~q2_front~0_88, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_19|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_19|, ~q3~0.offset=v_~q3~0.offset_57, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_19|, ~q3_back~0=v_~q3_back~0_82, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_23|, ~q2_back~0=v_~q2_back~0_80, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_35|} AuxVars[|v_thread3_#t~short18#1_70|, |v_thread3_#t~short18#1_69|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q3_back~0, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread3Thread1of1ForFork2_#t~mem15#1, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] [2022-12-13 10:37:27,956 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:37:27,957 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 839 [2022-12-13 10:37:27,957 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 468 flow [2022-12-13 10:37:27,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-13 10:37:27,957 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:37:27,957 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:37:27,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 10:37:27,957 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:37:27,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:37:27,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1481516364, now seen corresponding path program 1 times [2022-12-13 10:37:27,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:37:27,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267547296] [2022-12-13 10:37:27,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:37:27,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:37:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:37:28,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:37:28,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:37:28,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267547296] [2022-12-13 10:37:28,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267547296] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:37:28,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453685062] [2022-12-13 10:37:28,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:37:28,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:37:28,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:37:28,863 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:37:28,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 10:37:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:37:29,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-13 10:37:29,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:37:29,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 183 [2022-12-13 10:37:29,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:37:29,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 10:37:29,299 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 10:37:29,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 48 [2022-12-13 10:37:29,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 17 [2022-12-13 10:37:29,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:37:29,384 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:37:29,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453685062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:37:29,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:37:29,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2022-12-13 10:37:29,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62849357] [2022-12-13 10:37:29,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:37:29,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:37:29,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:37:29,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:37:29,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-12-13 10:37:29,386 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 10:37:29,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 468 flow. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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-13 10:37:29,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:37:29,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 10:37:29,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:37:29,964 INFO L130 PetriNetUnfolder]: 1636/2493 cut-off events. [2022-12-13 10:37:29,964 INFO L131 PetriNetUnfolder]: For 6328/6328 co-relation queries the response was YES. [2022-12-13 10:37:29,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10923 conditions, 2493 events. 1636/2493 cut-off events. For 6328/6328 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 10676 event pairs, 711 based on Foata normal form. 0/1987 useless extension candidates. Maximal degree in co-relation 4570. Up to 1773 conditions per place. [2022-12-13 10:37:29,980 INFO L137 encePairwiseOnDemand]: 28/37 looper letters, 91 selfloop transitions, 8 changer transitions 7/106 dead transitions. [2022-12-13 10:37:29,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 106 transitions, 990 flow [2022-12-13 10:37:29,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:37:29,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:37:29,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-12-13 10:37:29,981 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.305019305019305 [2022-12-13 10:37:29,982 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 468 flow. Second operand 7 states and 79 transitions. [2022-12-13 10:37:29,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 106 transitions, 990 flow [2022-12-13 10:37:29,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 106 transitions, 895 flow, removed 46 selfloop flow, removed 3 redundant places. [2022-12-13 10:37:29,993 INFO L231 Difference]: Finished difference. Result has 76 places, 64 transitions, 520 flow [2022-12-13 10:37:29,993 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=520, PETRI_PLACES=76, PETRI_TRANSITIONS=64} [2022-12-13 10:37:29,994 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 42 predicate places. [2022-12-13 10:37:29,994 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:37:29,994 INFO L89 Accepts]: Start accepts. Operand has 76 places, 64 transitions, 520 flow [2022-12-13 10:37:29,994 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:37:29,995 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:37:29,995 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 64 transitions, 520 flow [2022-12-13 10:37:29,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 64 transitions, 520 flow [2022-12-13 10:37:30,068 INFO L130 PetriNetUnfolder]: 268/640 cut-off events. [2022-12-13 10:37:30,068 INFO L131 PetriNetUnfolder]: For 1006/1006 co-relation queries the response was YES. [2022-12-13 10:37:30,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2126 conditions, 640 events. 268/640 cut-off events. For 1006/1006 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3475 event pairs, 34 based on Foata normal form. 0/465 useless extension candidates. Maximal degree in co-relation 1097. Up to 246 conditions per place. [2022-12-13 10:37:30,077 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 64 transitions, 520 flow [2022-12-13 10:37:30,077 INFO L226 LiptonReduction]: Number of co-enabled transitions 270 [2022-12-13 10:37:37,899 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1053] L98-2-->L98-2: Formula: (and (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= (+ (select (select |v_#memory_int_217| v_~q3~0.base_57) (+ (* v_~q3_back~0_83 4) v_~q3~0.offset_57)) 1) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (= v_~q3_back~0_82 (+ v_~q3_back~0_83 1)) |v_thread3_#t~short18#1_69| (< v_~q3_back~0_83 v_~n3~0_52) (= (select (select |v_#memory_int_217| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* 4 v_~q2_front~0_89))) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_80) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_48)) 1 0) 0)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_35| 0)) (= (+ |v_thread3Thread1of1ForFork2_~t~0#1_24| |v_thread3Thread1of1ForFork2_~k~0#1_35|) |v_thread3Thread1of1ForFork2_~t~0#1_23|) (<= 0 v_~q3_back~0_83) (= (ite |v_thread3_#t~short18#1_70| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| 0))) InVars {~q3_back~0=v_~q3_back~0_83, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_24|, ~q3~0.offset=v_~q3~0.offset_57, ~q2_back~0=v_~q2_back~0_80} OutVars{thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_17|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_17|, ~q2_front~0=v_~q2_front~0_88, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_19|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_19|, ~q3~0.offset=v_~q3~0.offset_57, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_19|, ~q3_back~0=v_~q3_back~0_82, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_23|, ~q2_back~0=v_~q2_back~0_80, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_35|} AuxVars[|v_thread3_#t~short18#1_70|, |v_thread3_#t~short18#1_69|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q3_back~0, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread3Thread1of1ForFork2_#t~mem15#1, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] and [1108] L160-22-->L142-2: Formula: (and (= (store |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31| (store (select |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre30#1_33|)) |v_#memory_int_265|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483648)) (= |v_ULTIMATE.start_main_#t~nondet29#1_48| v_~q3_front~0_102) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) (<= |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483647) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154| |v_ULTIMATE.start_create_fresh_int_array_~size#1_160|)) (<= |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483647) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| (ite (<= 0 v_~N~0_54) 1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483648)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483648)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| v_~q3~0.base_83) (= |v_#pthreadsForks_79| |v_ULTIMATE.start_main_#t~pre30#1_33|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| v_~q3~0.offset_83) (= (+ |v_#pthreadsForks_79| 1) |v_#pthreadsForks_78|) (= v_~q1_back~0_145 v_~q1_front~0_96) (= v_~q2_front~0_124 v_~q2_back~0_122) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213| 0)) (= |v_ULTIMATE.start_main_#t~nondet28#1_56| v_~q2_front~0_124) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|) (= v_~q3_front~0_102 v_~q3_back~0_120) (= |v_ULTIMATE.start_main_#t~nondet27#1_40| v_~q1_front~0_96) (<= |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483647)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, #pthreadsForks=|v_#pthreadsForks_79|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, #memory_int=|v_#memory_int_266|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_48|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_40|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_56|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ~q1_front~0=v_~q1_front~0_96, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_33|, ~q3_front~0=v_~q3_front~0_102, ~q3_back~0=v_~q3_back~0_120, #pthreadsForks=|v_#pthreadsForks_78|, ~q1_back~0=v_~q1_back~0_145, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|, ~q3~0.base=v_~q3~0.base_83, ~q2_back~0=v_~q2_back~0_122, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ~q2_front~0=v_~q2_front~0_124, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ~q3~0.offset=v_~q3~0.offset_83, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90|, #memory_int=|v_#memory_int_265|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167|} AuxVars[] AssignedVars[~q1_front~0, ULTIMATE.start_main_#t~ret26#1.base, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~nondet29#1, ~q3~0.offset, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~pre30#1, ~q3_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~q3_back~0, #pthreadsForks, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~q3~0.base, ~q2_back~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-13 10:37:38,269 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1051] L143-4-->L144-3: Formula: (and (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= (store |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27| (store (select |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27|) |v_ULTIMATE.start_main_~#t3~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre34#1_23|)) |v_#memory_int_209|) (= |v_#pthreadsForks_59| |v_ULTIMATE.start_main_#t~pre34#1_23|)) InVars {#pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_210|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|} OutVars{#pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_9|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_209|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_23|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_21|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet33#1, #memory_int, ULTIMATE.start_main_#t~pre34#1, ULTIMATE.start_main_#t~pre32#1] and [1108] L160-22-->L142-2: Formula: (and (= (store |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31| (store (select |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre30#1_33|)) |v_#memory_int_265|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483648)) (= |v_ULTIMATE.start_main_#t~nondet29#1_48| v_~q3_front~0_102) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) (<= |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483647) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154| |v_ULTIMATE.start_create_fresh_int_array_~size#1_160|)) (<= |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483647) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| (ite (<= 0 v_~N~0_54) 1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483648)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483648)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| v_~q3~0.base_83) (= |v_#pthreadsForks_79| |v_ULTIMATE.start_main_#t~pre30#1_33|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| v_~q3~0.offset_83) (= (+ |v_#pthreadsForks_79| 1) |v_#pthreadsForks_78|) (= v_~q1_back~0_145 v_~q1_front~0_96) (= v_~q2_front~0_124 v_~q2_back~0_122) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213| 0)) (= |v_ULTIMATE.start_main_#t~nondet28#1_56| v_~q2_front~0_124) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|) (= v_~q3_front~0_102 v_~q3_back~0_120) (= |v_ULTIMATE.start_main_#t~nondet27#1_40| v_~q1_front~0_96) (<= |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483647)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, #pthreadsForks=|v_#pthreadsForks_79|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, #memory_int=|v_#memory_int_266|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_48|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_40|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_56|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ~q1_front~0=v_~q1_front~0_96, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_33|, ~q3_front~0=v_~q3_front~0_102, ~q3_back~0=v_~q3_back~0_120, #pthreadsForks=|v_#pthreadsForks_78|, ~q1_back~0=v_~q1_back~0_145, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|, ~q3~0.base=v_~q3~0.base_83, ~q2_back~0=v_~q2_back~0_122, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ~q2_front~0=v_~q2_front~0_124, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ~q3~0.offset=v_~q3~0.offset_83, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90|, #memory_int=|v_#memory_int_265|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167|} AuxVars[] AssignedVars[~q1_front~0, ULTIMATE.start_main_#t~ret26#1.base, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~nondet29#1, ~q3~0.offset, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~pre30#1, ~q3_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~q3_back~0, #pthreadsForks, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~q3~0.base, ~q2_back~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-13 10:37:38,474 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:37:38,475 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8481 [2022-12-13 10:37:38,475 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 65 transitions, 570 flow [2022-12-13 10:37:38,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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-13 10:37:38,475 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:37:38,475 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:37:38,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 10:37:38,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 10:37:38,676 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:37:38,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:37:38,677 INFO L85 PathProgramCache]: Analyzing trace with hash -635837301, now seen corresponding path program 1 times [2022-12-13 10:37:38,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:37:38,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938106531] [2022-12-13 10:37:38,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:37:38,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:37:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:37:39,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:37:39,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:37:39,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938106531] [2022-12-13 10:37:39,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938106531] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:37:39,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898517329] [2022-12-13 10:37:39,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:37:39,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:37:39,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:37:39,856 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:37:39,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 10:37:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:37:40,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 10:37:40,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:37:40,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 108 [2022-12-13 10:37:40,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:37:40,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 10:37:40,329 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 10:37:40,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 42 [2022-12-13 10:37:40,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-12-13 10:37:40,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:37:40,408 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:37:40,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898517329] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:37:40,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:37:40,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2022-12-13 10:37:40,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295079484] [2022-12-13 10:37:40,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:37:40,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:37:40,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:37:40,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:37:40,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-12-13 10:37:40,411 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 10:37:40,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 65 transitions, 570 flow. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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-13 10:37:40,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:37:40,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 10:37:40,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:37:41,094 INFO L130 PetriNetUnfolder]: 1632/2489 cut-off events. [2022-12-13 10:37:41,094 INFO L131 PetriNetUnfolder]: For 5286/5286 co-relation queries the response was YES. [2022-12-13 10:37:41,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10226 conditions, 2489 events. 1632/2489 cut-off events. For 5286/5286 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 10517 event pairs, 802 based on Foata normal form. 0/1984 useless extension candidates. Maximal degree in co-relation 6261. Up to 1049 conditions per place. [2022-12-13 10:37:41,108 INFO L137 encePairwiseOnDemand]: 32/41 looper letters, 119 selfloop transitions, 9 changer transitions 19/147 dead transitions. [2022-12-13 10:37:41,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 147 transitions, 1224 flow [2022-12-13 10:37:41,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:37:41,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:37:41,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2022-12-13 10:37:41,110 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28292682926829266 [2022-12-13 10:37:41,110 INFO L175 Difference]: Start difference. First operand has 77 places, 65 transitions, 570 flow. Second operand 10 states and 116 transitions. [2022-12-13 10:37:41,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 147 transitions, 1224 flow [2022-12-13 10:37:41,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 147 transitions, 1214 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-13 10:37:41,120 INFO L231 Difference]: Finished difference. Result has 87 places, 63 transitions, 529 flow [2022-12-13 10:37:41,120 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=529, PETRI_PLACES=87, PETRI_TRANSITIONS=63} [2022-12-13 10:37:41,121 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 53 predicate places. [2022-12-13 10:37:41,121 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:37:41,121 INFO L89 Accepts]: Start accepts. Operand has 87 places, 63 transitions, 529 flow [2022-12-13 10:37:41,124 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:37:41,124 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:37:41,124 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 63 transitions, 529 flow [2022-12-13 10:37:41,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 63 transitions, 529 flow [2022-12-13 10:37:41,200 INFO L130 PetriNetUnfolder]: 274/635 cut-off events. [2022-12-13 10:37:41,200 INFO L131 PetriNetUnfolder]: For 989/989 co-relation queries the response was YES. [2022-12-13 10:37:41,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2118 conditions, 635 events. 274/635 cut-off events. For 989/989 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3401 event pairs, 56 based on Foata normal form. 0/451 useless extension candidates. Maximal degree in co-relation 1490. Up to 253 conditions per place. [2022-12-13 10:37:41,209 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 63 transitions, 529 flow [2022-12-13 10:37:41,209 INFO L226 LiptonReduction]: Number of co-enabled transitions 272 [2022-12-13 10:37:41,210 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:37:41,210 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-13 10:37:41,211 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 63 transitions, 529 flow [2022-12-13 10:37:41,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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-13 10:37:41,211 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:37:41,211 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:37:41,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 10:37:41,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 10:37:41,418 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:37:41,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:37:41,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1539598017, now seen corresponding path program 1 times [2022-12-13 10:37:41,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:37:41,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690782459] [2022-12-13 10:37:41,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:37:41,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:37:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:37:41,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:37:41,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:37:41,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690782459] [2022-12-13 10:37:41,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690782459] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:37:41,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:37:41,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:37:41,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583329329] [2022-12-13 10:37:41,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:37:41,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:37:41,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:37:41,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:37:41,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:37:41,506 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 10:37:41,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 63 transitions, 529 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-13 10:37:41,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:37:41,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 10:37:41,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:37:41,898 INFO L130 PetriNetUnfolder]: 1705/2604 cut-off events. [2022-12-13 10:37:41,898 INFO L131 PetriNetUnfolder]: For 5836/5836 co-relation queries the response was YES. [2022-12-13 10:37:41,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10599 conditions, 2604 events. 1705/2604 cut-off events. For 5836/5836 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 11329 event pairs, 381 based on Foata normal form. 88/2196 useless extension candidates. Maximal degree in co-relation 7077. Up to 2179 conditions per place. [2022-12-13 10:37:41,917 INFO L137 encePairwiseOnDemand]: 30/38 looper letters, 74 selfloop transitions, 7 changer transitions 0/81 dead transitions. [2022-12-13 10:37:41,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 81 transitions, 805 flow [2022-12-13 10:37:41,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:37:41,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:37:41,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-13 10:37:41,918 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45614035087719296 [2022-12-13 10:37:41,918 INFO L175 Difference]: Start difference. First operand has 84 places, 63 transitions, 529 flow. Second operand 3 states and 52 transitions. [2022-12-13 10:37:41,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 81 transitions, 805 flow [2022-12-13 10:37:41,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 81 transitions, 781 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-13 10:37:41,927 INFO L231 Difference]: Finished difference. Result has 82 places, 65 transitions, 544 flow [2022-12-13 10:37:41,928 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=544, PETRI_PLACES=82, PETRI_TRANSITIONS=65} [2022-12-13 10:37:41,928 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 48 predicate places. [2022-12-13 10:37:41,928 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:37:41,928 INFO L89 Accepts]: Start accepts. Operand has 82 places, 65 transitions, 544 flow [2022-12-13 10:37:41,929 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:37:41,929 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:37:41,929 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 65 transitions, 544 flow [2022-12-13 10:37:41,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 65 transitions, 544 flow [2022-12-13 10:37:42,006 INFO L130 PetriNetUnfolder]: 289/681 cut-off events. [2022-12-13 10:37:42,006 INFO L131 PetriNetUnfolder]: For 1217/1265 co-relation queries the response was YES. [2022-12-13 10:37:42,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2519 conditions, 681 events. 289/681 cut-off events. For 1217/1265 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3744 event pairs, 25 based on Foata normal form. 0/493 useless extension candidates. Maximal degree in co-relation 1317. Up to 256 conditions per place. [2022-12-13 10:37:42,016 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 65 transitions, 544 flow [2022-12-13 10:37:42,016 INFO L226 LiptonReduction]: Number of co-enabled transitions 312 [2022-12-13 10:37:42,017 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:37:42,017 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-13 10:37:42,017 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 65 transitions, 544 flow [2022-12-13 10:37:42,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-13 10:37:42,018 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:37:42,018 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:37:42,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 10:37:42,019 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:37:42,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:37:42,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1079976863, now seen corresponding path program 2 times [2022-12-13 10:37:42,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:37:42,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183144777] [2022-12-13 10:37:42,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:37:42,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:37:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:37:42,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:37:42,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:37:42,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183144777] [2022-12-13 10:37:42,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183144777] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:37:42,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119888438] [2022-12-13 10:37:42,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 10:37:42,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:37:42,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:37:42,137 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:37:42,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 10:37:42,670 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 10:37:42,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 10:37:42,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 10:37:42,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:37:42,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:37:42,731 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:37:42,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119888438] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:37:42,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:37:42,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-13 10:37:42,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328202256] [2022-12-13 10:37:42,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:37:42,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:37:42,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:37:42,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:37:42,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:37:42,733 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 10:37:42,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 65 transitions, 544 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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-13 10:37:42,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:37:42,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 10:37:42,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:37:43,362 INFO L130 PetriNetUnfolder]: 2564/4171 cut-off events. [2022-12-13 10:37:43,362 INFO L131 PetriNetUnfolder]: For 12610/12610 co-relation queries the response was YES. [2022-12-13 10:37:43,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18065 conditions, 4171 events. 2564/4171 cut-off events. For 12610/12610 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 22105 event pairs, 1042 based on Foata normal form. 316/3853 useless extension candidates. Maximal degree in co-relation 8747. Up to 2605 conditions per place. [2022-12-13 10:37:43,392 INFO L137 encePairwiseOnDemand]: 31/38 looper letters, 101 selfloop transitions, 6 changer transitions 14/121 dead transitions. [2022-12-13 10:37:43,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 121 transitions, 1232 flow [2022-12-13 10:37:43,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:37:43,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:37:43,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-12-13 10:37:43,394 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3894736842105263 [2022-12-13 10:37:43,394 INFO L175 Difference]: Start difference. First operand has 82 places, 65 transitions, 544 flow. Second operand 5 states and 74 transitions. [2022-12-13 10:37:43,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 121 transitions, 1232 flow [2022-12-13 10:37:43,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 121 transitions, 1221 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 10:37:43,411 INFO L231 Difference]: Finished difference. Result has 88 places, 68 transitions, 591 flow [2022-12-13 10:37:43,411 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=591, PETRI_PLACES=88, PETRI_TRANSITIONS=68} [2022-12-13 10:37:43,411 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 54 predicate places. [2022-12-13 10:37:43,411 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:37:43,412 INFO L89 Accepts]: Start accepts. Operand has 88 places, 68 transitions, 591 flow [2022-12-13 10:37:43,413 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:37:43,413 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:37:43,414 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 68 transitions, 591 flow [2022-12-13 10:37:43,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 68 transitions, 591 flow [2022-12-13 10:37:43,501 INFO L130 PetriNetUnfolder]: 295/774 cut-off events. [2022-12-13 10:37:43,501 INFO L131 PetriNetUnfolder]: For 1621/1669 co-relation queries the response was YES. [2022-12-13 10:37:43,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2972 conditions, 774 events. 295/774 cut-off events. For 1621/1669 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4727 event pairs, 25 based on Foata normal form. 0/583 useless extension candidates. Maximal degree in co-relation 1430. Up to 273 conditions per place. [2022-12-13 10:37:43,513 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 68 transitions, 591 flow [2022-12-13 10:37:43,513 INFO L226 LiptonReduction]: Number of co-enabled transitions 314 [2022-12-13 10:37:43,514 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:37:43,517 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-13 10:37:43,517 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 68 transitions, 591 flow [2022-12-13 10:37:43,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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-13 10:37:43,517 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:37:43,517 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:37:43,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 10:37:43,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 10:37:43,724 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:37:43,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:37:43,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1970857884, now seen corresponding path program 1 times [2022-12-13 10:37:43,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:37:43,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573669170] [2022-12-13 10:37:43,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:37:43,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:37:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:37:46,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:37:46,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:37:46,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573669170] [2022-12-13 10:37:46,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573669170] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:37:46,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249991479] [2022-12-13 10:37:46,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:37:46,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:37:46,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:37:46,039 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:37:46,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 10:37:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:37:46,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-13 10:37:46,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:37:46,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:37:46,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2022-12-13 10:37:46,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 10:37:46,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:37:46,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 10:37:46,578 INFO L321 Elim1Store]: treesize reduction 9, result has 85.2 percent of original size [2022-12-13 10:37:46,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 74 [2022-12-13 10:37:46,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:37:46,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:37:46,952 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (* c_~q3_front~0 4)) (.cse5 (* c_~q2_front~0 4)) (.cse8 (* c_~q3_back~0 4)) (.cse1 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse3 (* c_~q2_back~0 4))) (and (forall ((~q2~0.base Int) (v_ArrVal_1134 (Array Int Int)) (~q2~0.offset Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1134))) (let ((.cse2 (select .cse0 ~q2~0.base))) (or (< (select (select .cse0 c_~q1~0.base) .cse1) (+ (select .cse2 (+ ~q2~0.offset .cse3)) 1)) (forall ((~q3~0.offset Int) (~q3~0.base Int)) (let ((.cse6 (select .cse0 ~q3~0.base))) (let ((.cse4 (+ (select .cse6 (+ ~q3~0.offset .cse8)) 1))) (or (<= .cse4 0) (not (<= .cse4 (select .cse2 (+ ~q2~0.offset .cse5)))) (< 0 (+ (select .cse6 (+ ~q3~0.offset .cse7)) c_~r~0 1)))))))))) (forall ((~q2~0.base Int) (v_ArrVal_1134 (Array Int Int)) (~q2~0.offset Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1134))) (let ((.cse11 (select .cse12 ~q2~0.base))) (or (forall ((~q3~0.offset Int) (~q3~0.base Int)) (let ((.cse10 (select .cse12 ~q3~0.base))) (let ((.cse9 (+ (select .cse10 (+ ~q3~0.offset .cse8)) 1))) (or (<= .cse9 0) (<= (+ (select .cse10 (+ ~q3~0.offset .cse7)) c_~r~0) 0) (not (<= .cse9 (select .cse11 (+ ~q2~0.offset .cse5)))))))) (< (select (select .cse12 c_~q1~0.base) .cse1) (+ (select .cse11 (+ ~q2~0.offset .cse3)) 1)))))))) is different from false [2022-12-13 10:37:47,595 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:37:47,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 3190 treesize of output 3538 [2022-12-13 10:37:47,831 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:37:47,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 2745 treesize of output 2682 [2022-12-13 10:37:48,057 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:37:48,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 2529 treesize of output 2250 [2022-12-13 10:37:48,307 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:37:48,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 2097 treesize of output 2034 [2022-12-13 10:37:48,575 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:37:48,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1881 treesize of output 1926 Received shutdown request... [2022-12-13 10:50:15,849 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 10:50:15,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 10:50:15,874 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 10:50:15,874 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 10:50:16,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:50:16,056 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 25 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-7-2-2-2-3-2-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-6-2-2-2-3-2-2-2-2-1 context. [2022-12-13 10:50:16,058 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 10:50:16,058 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 10:50:16,058 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 10:50:16,058 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:50:16,062 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 10:50:16,062 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 10:50:16,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 10:50:16 BasicIcfg [2022-12-13 10:50:16,064 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 10:50:16,064 INFO L158 Benchmark]: Toolchain (without parser) took 810469.26ms. Allocated memory was 190.8MB in the beginning and 974.1MB in the end (delta: 783.3MB). Free memory was 167.4MB in the beginning and 586.5MB in the end (delta: -419.2MB). Peak memory consumption was 614.1MB. Max. memory is 8.0GB. [2022-12-13 10:50:16,064 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 190.8MB. Free memory is still 168.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 10:50:16,065 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.36ms. Allocated memory is still 190.8MB. Free memory was 166.9MB in the beginning and 153.2MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 10:50:16,065 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.89ms. Allocated memory is still 190.8MB. Free memory was 153.2MB in the beginning and 150.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 10:50:16,065 INFO L158 Benchmark]: Boogie Preprocessor took 59.20ms. Allocated memory is still 190.8MB. Free memory was 150.6MB in the beginning and 148.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 10:50:16,066 INFO L158 Benchmark]: RCFGBuilder took 889.19ms. Allocated memory is still 190.8MB. Free memory was 148.5MB in the beginning and 107.1MB in the end (delta: 41.4MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. [2022-12-13 10:50:16,066 INFO L158 Benchmark]: TraceAbstraction took 809222.87ms. Allocated memory was 190.8MB in the beginning and 974.1MB in the end (delta: 783.3MB). Free memory was 106.0MB in the beginning and 586.5MB in the end (delta: -480.5MB). Peak memory consumption was 553.3MB. Max. memory is 8.0GB. [2022-12-13 10:50:16,067 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.16ms. Allocated memory is still 190.8MB. Free memory is still 168.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 224.36ms. Allocated memory is still 190.8MB. Free memory was 166.9MB in the beginning and 153.2MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 67.89ms. Allocated memory is still 190.8MB. Free memory was 153.2MB in the beginning and 150.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 59.20ms. Allocated memory is still 190.8MB. Free memory was 150.6MB in the beginning and 148.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 889.19ms. Allocated memory is still 190.8MB. Free memory was 148.5MB in the beginning and 107.1MB in the end (delta: 41.4MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. * TraceAbstraction took 809222.87ms. Allocated memory was 190.8MB in the beginning and 974.1MB in the end (delta: 783.3MB). Free memory was 106.0MB in the beginning and 586.5MB in the end (delta: -480.5MB). Peak memory consumption was 553.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.4s, 220 PlacesBefore, 34 PlacesAfterwards, 232 TransitionsBefore, 31 TransitionsAfterwards, 1962 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 151 TrivialYvCompositions, 35 ConcurrentYvCompositions, 14 ChoiceCompositions, 200 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1222, independent: 1198, independent conditional: 1198, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1116, independent: 1102, independent conditional: 0, independent unconditional: 1102, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1116, independent: 1102, independent conditional: 0, independent unconditional: 1102, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1116, independent: 1095, independent conditional: 0, independent unconditional: 1095, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 92, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1222, independent: 96, independent conditional: 96, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 1116, unknown conditional: 1116, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1143, Positive cache size: 1129, Positive conditional cache size: 1129, Positive unconditional cache size: 0, Negative cache size: 14, Negative conditional cache size: 14, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 31 PlacesBefore, 31 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 47, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 17, independent conditional: 0, independent unconditional: 17, 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: 21, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 21, unknown conditional: 21, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 17, Positive conditional cache size: 17, Positive unconditional cache size: 0, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 35 PlacesBefore, 34 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 21, Positive cache size: 17, Positive conditional cache size: 17, Positive unconditional cache size: 0, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 37 PlacesBefore, 36 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 21, Positive cache size: 17, Positive conditional cache size: 17, Positive unconditional cache size: 0, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 35 PlacesBefore, 34 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 21, Positive cache size: 17, Positive conditional cache size: 17, Positive unconditional cache size: 0, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 21, Positive cache size: 17, Positive conditional cache size: 17, Positive unconditional cache size: 0, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 41 PlacesBefore, 40 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 21, Positive cache size: 17, Positive conditional cache size: 17, Positive unconditional cache size: 0, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 21, Positive cache size: 17, Positive conditional cache size: 17, Positive unconditional cache size: 0, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 47 PlacesBefore, 47 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, 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: 18, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 30, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 35, Positive conditional cache size: 35, Positive unconditional cache size: 0, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 39, Positive cache size: 35, Positive conditional cache size: 35, Positive unconditional cache size: 0, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 55 PlacesBefore, 54 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 220 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 12, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 41, Positive conditional cache size: 41, Positive unconditional cache size: 0, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 63 PlacesBefore, 63 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 224 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 45, Positive cache size: 41, Positive conditional cache size: 41, Positive unconditional cache size: 0, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 65 PlacesBefore, 64 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 45, Positive cache size: 41, Positive conditional cache size: 41, Positive unconditional cache size: 0, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 66 PlacesBefore, 66 PlacesAfterwards, 53 TransitionsBefore, 52 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, 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: 16, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 19, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 57, Positive conditional cache size: 57, Positive unconditional cache size: 0, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 69 PlacesBefore, 68 PlacesAfterwards, 58 TransitionsBefore, 57 TransitionsAfterwards, 274 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 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: 10, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 64, Positive conditional cache size: 64, Positive unconditional cache size: 0, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.4s, 76 PlacesBefore, 77 PlacesAfterwards, 64 TransitionsBefore, 65 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 66, Positive conditional cache size: 66, Positive unconditional cache size: 0, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 84 PlacesBefore, 84 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 272 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 66, Positive conditional cache size: 66, Positive unconditional cache size: 0, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 82 PlacesBefore, 82 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 312 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 66, Positive conditional cache size: 66, Positive unconditional cache size: 0, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 88 PlacesBefore, 88 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 314 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 66, Positive conditional cache size: 66, Positive unconditional cache size: 0, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 150]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 25 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-7-2-2-2-3-2-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-6-2-2-2-3-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 144]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 25 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-7-2-2-2-3-2-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-6-2-2-2-3-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 143]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 25 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-7-2-2-2-3-2-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-6-2-2-2-3-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 142]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 25 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-7-2-2-2-3-2-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-6-2-2-2-3-2-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 261 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 809.0s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 970 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 970 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2828 IncrementalHoareTripleChecker+Invalid, 2932 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 104 mSolverCounterUnsat, 0 mSDtfsCounter, 2828 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 371 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=591occurred in iteration=18, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 668 NumberOfCodeBlocks, 668 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 640 ConstructedInterpolants, 2 QuantifiedInterpolants, 8592 SizeOfPredicates, 71 NumberOfNonLiveVariables, 4116 ConjunctsInSsa, 170 ConjunctsInUnsatCore, 28 InterpolantComputations, 18 PerfectInterpolantSequences, 24/40 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown