/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-buffer-mult-alt2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:21:53,151 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:21:53,152 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:21:53,184 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:21:53,184 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:21:53,186 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:21:53,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:21:53,192 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:21:53,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:21:53,199 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:21:53,200 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:21:53,201 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:21:53,201 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:21:53,203 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:21:53,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:21:53,207 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:21:53,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:21:53,208 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:21:53,210 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:21:53,214 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:21:53,215 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:21:53,216 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:21:53,217 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:21:53,217 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:21:53,222 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:21:53,222 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:21:53,223 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:21:53,224 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:21:53,224 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:21:53,225 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:21:53,225 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:21:53,226 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:21:53,227 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:21:53,228 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:21:53,228 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:21:53,228 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:21:53,229 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:21:53,229 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:21:53,229 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:21:53,230 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:21:53,230 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:21:53,231 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:21:53,258 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:21:53,258 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:21:53,259 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:21:53,259 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:21:53,260 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:21:53,260 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:21:53,260 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:21:53,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:21:53,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:21:53,261 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:21:53,261 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:21:53,261 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:21:53,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:21:53,261 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:21:53,261 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:21:53,262 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:21:53,262 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:21:53,262 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:21:53,262 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:21:53,262 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:21:53,262 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:21:53,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:21:53,262 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:21:53,262 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:21:53,263 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:21:53,263 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:21:53,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:21:53,263 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:21:53,263 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 05:21:53,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:21:53,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:21:53,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:21:53,537 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:21:53,537 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:21:53,538 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2022-12-06 05:21:54,517 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:21:54,680 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:21:54,680 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2022-12-06 05:21:54,687 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6420db42e/9bee316067074d19a5d782af03b19a1f/FLAGda37b1408 [2022-12-06 05:21:54,697 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6420db42e/9bee316067074d19a5d782af03b19a1f [2022-12-06 05:21:54,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:21:54,699 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:21:54,700 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:21:54,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:21:54,702 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:21:54,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:21:54" (1/1) ... [2022-12-06 05:21:54,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b27448e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:54, skipping insertion in model container [2022-12-06 05:21:54,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:21:54" (1/1) ... [2022-12-06 05:21:54,708 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:21:54,723 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:21:54,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:21:54,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:21:54,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:21:54,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:21:54,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:21:54,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:21:54,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:21:54,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:21:54,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:21:54,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:21:54,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:21:54,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:21:54,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:21:54,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:21:54,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:21:54,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:21:54,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:21:54,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:21:54,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:21:54,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:21:54,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:21:54,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:21:54,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:21:54,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:21:54,885 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-buffer-mult-alt2.wvr.c[4174,4187] [2022-12-06 05:21:54,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:21:54,908 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:21:54,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:21:54,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:21:54,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:21:54,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:21:54,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:21:54,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:21:54,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:21:54,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:21:54,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:21:54,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:21:54,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:21:54,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:21:54,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:21:54,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:21:54,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:21:54,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:21:54,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:21:54,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:21:54,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:21:54,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:21:54,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:21:54,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:21:54,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:21:54,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:21:54,950 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-buffer-mult-alt2.wvr.c[4174,4187] [2022-12-06 05:21:54,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:21:54,967 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:21:54,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:54 WrapperNode [2022-12-06 05:21:54,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:21:54,969 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:21:54,969 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:21:54,969 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:21:54,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:54" (1/1) ... [2022-12-06 05:21:54,992 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:54" (1/1) ... [2022-12-06 05:21:55,018 INFO L138 Inliner]: procedures = 26, calls = 75, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 315 [2022-12-06 05:21:55,018 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:21:55,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:21:55,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:21:55,019 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:21:55,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:54" (1/1) ... [2022-12-06 05:21:55,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:54" (1/1) ... [2022-12-06 05:21:55,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:54" (1/1) ... [2022-12-06 05:21:55,034 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:54" (1/1) ... [2022-12-06 05:21:55,041 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:54" (1/1) ... [2022-12-06 05:21:55,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:54" (1/1) ... [2022-12-06 05:21:55,064 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:54" (1/1) ... [2022-12-06 05:21:55,065 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:54" (1/1) ... [2022-12-06 05:21:55,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:21:55,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:21:55,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:21:55,068 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:21:55,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:54" (1/1) ... [2022-12-06 05:21:55,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:21:55,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:21:55,101 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 05:21:55,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 05:21:55,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:21:55,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:21:55,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:21:55,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:21:55,135 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:21:55,135 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:21:55,135 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:21:55,135 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:21:55,135 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:21:55,135 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:21:55,135 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 05:21:55,135 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 05:21:55,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:21:55,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 05:21:55,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 05:21:55,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:21:55,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:21:55,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:21:55,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:21:55,137 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:21:55,227 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:21:55,228 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:21:55,568 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:21:55,759 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:21:55,759 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 05:21:55,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:21:55 BoogieIcfgContainer [2022-12-06 05:21:55,761 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:21:55,763 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:21:55,763 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:21:55,765 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:21:55,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:21:54" (1/3) ... [2022-12-06 05:21:55,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ed4da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:21:55, skipping insertion in model container [2022-12-06 05:21:55,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:54" (2/3) ... [2022-12-06 05:21:55,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ed4da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:21:55, skipping insertion in model container [2022-12-06 05:21:55,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:21:55" (3/3) ... [2022-12-06 05:21:55,767 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt2.wvr.c [2022-12-06 05:21:55,783 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:21:55,783 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:21:55,783 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:21:55,855 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-06 05:21:55,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 226 transitions, 484 flow [2022-12-06 05:21:55,953 INFO L130 PetriNetUnfolder]: 19/222 cut-off events. [2022-12-06 05:21:55,953 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 05:21:55,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 222 events. 19/222 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 107 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 185. Up to 2 conditions per place. [2022-12-06 05:21:55,958 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 226 transitions, 484 flow [2022-12-06 05:21:55,986 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 204 places, 210 transitions, 444 flow [2022-12-06 05:21:55,987 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:56,006 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 204 places, 210 transitions, 444 flow [2022-12-06 05:21:56,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 210 transitions, 444 flow [2022-12-06 05:21:56,061 INFO L130 PetriNetUnfolder]: 19/210 cut-off events. [2022-12-06 05:21:56,061 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 05:21:56,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 210 events. 19/210 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 105 event pairs, 0 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 185. Up to 2 conditions per place. [2022-12-06 05:21:56,065 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 210 transitions, 444 flow [2022-12-06 05:21:56,065 INFO L188 LiptonReduction]: Number of co-enabled transitions 1824 [2022-12-06 05:22:05,701 INFO L203 LiptonReduction]: Total number of compositions: 175 [2022-12-06 05:22:05,713 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:22:05,718 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;@5e5d6862, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:22:05,718 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 05:22:05,731 INFO L130 PetriNetUnfolder]: 6/34 cut-off events. [2022-12-06 05:22:05,731 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 05:22:05,731 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:05,732 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:05,732 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 2 more)] === [2022-12-06 05:22:05,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:05,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1402613233, now seen corresponding path program 1 times [2022-12-06 05:22:05,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:05,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418263298] [2022-12-06 05:22:05,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:05,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:06,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:06,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:06,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418263298] [2022-12-06 05:22:06,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418263298] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:06,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:06,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:06,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091288455] [2022-12-06 05:22:06,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:06,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:22:06,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:06,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:22:06,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:22:06,399 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-06 05:22:06,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:06,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:06,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-06 05:22:06,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:06,807 INFO L130 PetriNetUnfolder]: 2592/3424 cut-off events. [2022-12-06 05:22:06,807 INFO L131 PetriNetUnfolder]: For 281/281 co-relation queries the response was YES. [2022-12-06 05:22:06,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7062 conditions, 3424 events. 2592/3424 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 14384 event pairs, 355 based on Foata normal form. 0/2355 useless extension candidates. Maximal degree in co-relation 5848. Up to 1372 conditions per place. [2022-12-06 05:22:06,830 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 66 selfloop transitions, 6 changer transitions 9/84 dead transitions. [2022-12-06 05:22:06,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 84 transitions, 387 flow [2022-12-06 05:22:06,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:22:06,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:22:06,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2022-12-06 05:22:06,840 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2022-12-06 05:22:06,842 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 94 flow. Second operand 6 states and 101 transitions. [2022-12-06 05:22:06,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 84 transitions, 387 flow [2022-12-06 05:22:06,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 84 transitions, 349 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-12-06 05:22:06,852 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 117 flow [2022-12-06 05:22:06,853 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=117, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2022-12-06 05:22:06,856 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2022-12-06 05:22:06,856 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:06,857 INFO L89 Accepts]: Start accepts. Operand has 42 places, 39 transitions, 117 flow [2022-12-06 05:22:06,863 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:06,863 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:06,863 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 39 transitions, 117 flow [2022-12-06 05:22:06,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 39 transitions, 117 flow [2022-12-06 05:22:06,874 INFO L130 PetriNetUnfolder]: 11/54 cut-off events. [2022-12-06 05:22:06,874 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 05:22:06,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 54 events. 11/54 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 92 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 57. Up to 8 conditions per place. [2022-12-06 05:22:06,876 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 39 transitions, 117 flow [2022-12-06 05:22:06,876 INFO L188 LiptonReduction]: Number of co-enabled transitions 448 [2022-12-06 05:22:06,904 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:22:06,906 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 05:22:06,907 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 117 flow [2022-12-06 05:22:06,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:06,907 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:06,907 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:06,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:22:06,910 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 2 more)] === [2022-12-06 05:22:06,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:06,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1996718852, now seen corresponding path program 1 times [2022-12-06 05:22:06,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:06,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482402270] [2022-12-06 05:22:06,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:06,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:07,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:07,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:07,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482402270] [2022-12-06 05:22:07,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482402270] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:07,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:07,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:22:07,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513391987] [2022-12-06 05:22:07,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:07,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:07,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:07,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:07,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:07,026 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2022-12-06 05:22:07,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:07,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:07,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2022-12-06 05:22:07,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:07,340 INFO L130 PetriNetUnfolder]: 2170/3051 cut-off events. [2022-12-06 05:22:07,341 INFO L131 PetriNetUnfolder]: For 1299/1560 co-relation queries the response was YES. [2022-12-06 05:22:07,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6884 conditions, 3051 events. 2170/3051 cut-off events. For 1299/1560 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 14772 event pairs, 1340 based on Foata normal form. 514/2861 useless extension candidates. Maximal degree in co-relation 4328. Up to 2387 conditions per place. [2022-12-06 05:22:07,354 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 30 selfloop transitions, 2 changer transitions 39/79 dead transitions. [2022-12-06 05:22:07,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 79 transitions, 357 flow [2022-12-06 05:22:07,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:22:07,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:22:07,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2022-12-06 05:22:07,356 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5885714285714285 [2022-12-06 05:22:07,356 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 117 flow. Second operand 5 states and 103 transitions. [2022-12-06 05:22:07,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 79 transitions, 357 flow [2022-12-06 05:22:07,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 79 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 05:22:07,367 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 138 flow [2022-12-06 05:22:07,368 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2022-12-06 05:22:07,368 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2022-12-06 05:22:07,368 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:07,368 INFO L89 Accepts]: Start accepts. Operand has 47 places, 40 transitions, 138 flow [2022-12-06 05:22:07,370 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:07,370 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:07,370 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 40 transitions, 138 flow [2022-12-06 05:22:07,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 40 transitions, 138 flow [2022-12-06 05:22:07,377 INFO L130 PetriNetUnfolder]: 12/57 cut-off events. [2022-12-06 05:22:07,377 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 05:22:07,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 57 events. 12/57 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 107 event pairs, 1 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 96. Up to 8 conditions per place. [2022-12-06 05:22:07,378 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 40 transitions, 138 flow [2022-12-06 05:22:07,379 INFO L188 LiptonReduction]: Number of co-enabled transitions 446 [2022-12-06 05:22:08,662 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:08,663 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1295 [2022-12-06 05:22:08,663 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 134 flow [2022-12-06 05:22:08,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:08,663 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:08,663 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:08,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:22:08,664 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 2 more)] === [2022-12-06 05:22:08,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:08,664 INFO L85 PathProgramCache]: Analyzing trace with hash 377684187, now seen corresponding path program 1 times [2022-12-06 05:22:08,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:08,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489335832] [2022-12-06 05:22:08,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:08,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:08,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:08,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:08,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489335832] [2022-12-06 05:22:08,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489335832] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:22:08,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736316560] [2022-12-06 05:22:08,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:08,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:22:08,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:22:08,850 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:22:08,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 05:22:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:09,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 05:22:09,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:22:09,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:09,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:22:09,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:09,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736316560] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 05:22:09,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 05:22:09,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 14 [2022-12-06 05:22:09,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295833749] [2022-12-06 05:22:09,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:09,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:22:09,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:09,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:22:09,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:22:09,210 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-06 05:22:09,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 134 flow. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:09,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:09,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-06 05:22:09,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:09,824 INFO L130 PetriNetUnfolder]: 3646/4815 cut-off events. [2022-12-06 05:22:09,824 INFO L131 PetriNetUnfolder]: For 2376/2376 co-relation queries the response was YES. [2022-12-06 05:22:09,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12333 conditions, 4815 events. 3646/4815 cut-off events. For 2376/2376 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 22531 event pairs, 115 based on Foata normal form. 72/3873 useless extension candidates. Maximal degree in co-relation 12320. Up to 1399 conditions per place. [2022-12-06 05:22:09,850 INFO L137 encePairwiseOnDemand]: 27/35 looper letters, 89 selfloop transitions, 15 changer transitions 0/107 dead transitions. [2022-12-06 05:22:09,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 107 transitions, 538 flow [2022-12-06 05:22:09,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:22:09,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:22:09,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2022-12-06 05:22:09,851 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49387755102040815 [2022-12-06 05:22:09,852 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 134 flow. Second operand 7 states and 121 transitions. [2022-12-06 05:22:09,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 107 transitions, 538 flow [2022-12-06 05:22:09,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 107 transitions, 512 flow, removed 13 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:09,857 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 224 flow [2022-12-06 05:22:09,857 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=224, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2022-12-06 05:22:09,857 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2022-12-06 05:22:09,858 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:09,858 INFO L89 Accepts]: Start accepts. Operand has 51 places, 48 transitions, 224 flow [2022-12-06 05:22:09,858 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:09,859 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:09,859 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 48 transitions, 224 flow [2022-12-06 05:22:09,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 48 transitions, 224 flow [2022-12-06 05:22:09,867 INFO L130 PetriNetUnfolder]: 22/93 cut-off events. [2022-12-06 05:22:09,867 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-12-06 05:22:09,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 93 events. 22/93 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 254 event pairs, 1 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 186. Up to 18 conditions per place. [2022-12-06 05:22:09,868 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 48 transitions, 224 flow [2022-12-06 05:22:09,868 INFO L188 LiptonReduction]: Number of co-enabled transitions 660 [2022-12-06 05:22:09,874 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:22:09,874 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 05:22:09,875 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 224 flow [2022-12-06 05:22:09,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:09,875 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:09,875 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:09,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 05:22:10,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:22:10,082 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 2 more)] === [2022-12-06 05:22:10,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:10,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1892802076, now seen corresponding path program 1 times [2022-12-06 05:22:10,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:10,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513211234] [2022-12-06 05:22:10,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:10,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:10,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-06 05:22:10,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:10,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513211234] [2022-12-06 05:22:10,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513211234] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:22:10,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738844698] [2022-12-06 05:22:10,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:10,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:22:10,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:22:10,865 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:22:10,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 05:22:10,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:10,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-06 05:22:10,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:22:11,183 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-06 05:22:11,193 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-06 05:22:11,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:22:11,232 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:22:11,232 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 26 treesize of output 22 [2022-12-06 05:22:11,365 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-06 05:22:11,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738844698] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:22:11,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:22:11,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 05:22:11,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461501401] [2022-12-06 05:22:11,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:22:11,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 05:22:11,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:11,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 05:22:11,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-12-06 05:22:11,367 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2022-12-06 05:22:11,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 224 flow. Second operand has 15 states, 15 states have (on average 7.933333333333334) internal successors, (119), 15 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:11,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:11,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2022-12-06 05:22:11,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:13,530 INFO L130 PetriNetUnfolder]: 13822/18183 cut-off events. [2022-12-06 05:22:13,530 INFO L131 PetriNetUnfolder]: For 20140/20140 co-relation queries the response was YES. [2022-12-06 05:22:13,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51977 conditions, 18183 events. 13822/18183 cut-off events. For 20140/20140 co-relation queries the response was YES. Maximal size of possible extension queue 958. Compared 96540 event pairs, 1184 based on Foata normal form. 76/14162 useless extension candidates. Maximal degree in co-relation 33223. Up to 5631 conditions per place. [2022-12-06 05:22:13,619 INFO L137 encePairwiseOnDemand]: 24/35 looper letters, 242 selfloop transitions, 65 changer transitions 14/326 dead transitions. [2022-12-06 05:22:13,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 326 transitions, 1958 flow [2022-12-06 05:22:13,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 05:22:13,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 05:22:13,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 350 transitions. [2022-12-06 05:22:13,621 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2022-12-06 05:22:13,621 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 224 flow. Second operand 17 states and 350 transitions. [2022-12-06 05:22:13,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 326 transitions, 1958 flow [2022-12-06 05:22:13,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 326 transitions, 1878 flow, removed 39 selfloop flow, removed 2 redundant places. [2022-12-06 05:22:13,677 INFO L231 Difference]: Finished difference. Result has 78 places, 114 transitions, 833 flow [2022-12-06 05:22:13,677 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=833, PETRI_PLACES=78, PETRI_TRANSITIONS=114} [2022-12-06 05:22:13,678 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places. [2022-12-06 05:22:13,678 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:13,678 INFO L89 Accepts]: Start accepts. Operand has 78 places, 114 transitions, 833 flow [2022-12-06 05:22:13,680 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:13,680 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:13,680 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 114 transitions, 833 flow [2022-12-06 05:22:13,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 114 transitions, 833 flow [2022-12-06 05:22:13,734 INFO L130 PetriNetUnfolder]: 230/688 cut-off events. [2022-12-06 05:22:13,735 INFO L131 PetriNetUnfolder]: For 1464/1471 co-relation queries the response was YES. [2022-12-06 05:22:13,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2119 conditions, 688 events. 230/688 cut-off events. For 1464/1471 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4409 event pairs, 14 based on Foata normal form. 2/665 useless extension candidates. Maximal degree in co-relation 1954. Up to 151 conditions per place. [2022-12-06 05:22:13,744 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 114 transitions, 833 flow [2022-12-06 05:22:13,744 INFO L188 LiptonReduction]: Number of co-enabled transitions 1870 [2022-12-06 05:22:13,745 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->L95: Formula: (= (ite (= (ite (or (< v_~i~0_6 v_~N~0_4) (< v_~q1_front~0_4 v_~q1_back~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork1_~cond~2#1_1|) InVars {~N~0=v_~N~0_4, ~q1_front~0=v_~q1_front~0_4, ~i~0=v_~i~0_6, ~q1_back~0=v_~q1_back~0_6} OutVars{~N~0=v_~N~0_4, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_1|, ~q1_front~0=v_~q1_front~0_4, ~i~0=v_~i~0_6, ~q1_back~0=v_~q1_back~0_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~cond~2#1] and [839] L59-->L59: Formula: (and (= (+ 1 v_~q1_back~0_66) v_~q1_back~0_65) (not (= (mod |v_thread1Thread1of1ForFork2_~cond~0#1_16| 256) 0)) (= v_~i~0_56 (+ v_~i~0_57 1)) (= (ite (= (ite (< v_~i~0_56 v_~N~0_8) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork2_~cond~0#1_15|) (= (select (select |v_#memory_int_79| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_back~0_66))) v_~C~0_25) (= (ite |v_thread1_#t~short2#1_58| 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (not (= 0 |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) (<= 0 v_~q1_back~0_66) |v_thread1_#t~short2#1_57| (< v_~q1_back~0_66 v_~n1~0_22)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~i~0=v_~i~0_57, ~C~0=v_~C~0_25, ~q1_back~0=v_~q1_back~0_66, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_79|, ~N~0=v_~N~0_8, thread1Thread1of1ForFork2_~cond~0#1=|v_thread1Thread1of1ForFork2_~cond~0#1_16|} OutVars{~q1~0.offset=v_~q1~0.offset_29, ~i~0=v_~i~0_56, ~C~0=v_~C~0_25, thread1Thread1of1ForFork2_#t~short2#1=|v_thread1Thread1of1ForFork2_#t~short2#1_9|, ~n1~0=v_~n1~0_22, ~N~0=v_~N~0_8, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_9|, ~q1_back~0=v_~q1_back~0_65, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_79|, thread1Thread1of1ForFork2_#t~post4#1=|v_thread1Thread1of1ForFork2_#t~post4#1_9|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread1Thread1of1ForFork2_~cond~0#1=|v_thread1Thread1of1ForFork2_~cond~0#1_15|, thread1Thread1of1ForFork2_#t~mem1#1=|v_thread1Thread1of1ForFork2_#t~mem1#1_11|} AuxVars[|v_thread1_#t~short2#1_58|, |v_thread1_#t~short2#1_57|] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, ~i~0, thread1Thread1of1ForFork2_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~post4#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_~cond~0#1, thread1Thread1of1ForFork2_#t~mem1#1] [2022-12-06 05:22:13,845 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->L95: Formula: (= (ite (= (ite (or (< v_~i~0_6 v_~N~0_4) (< v_~q1_front~0_4 v_~q1_back~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork1_~cond~2#1_1|) InVars {~N~0=v_~N~0_4, ~q1_front~0=v_~q1_front~0_4, ~i~0=v_~i~0_6, ~q1_back~0=v_~q1_back~0_6} OutVars{~N~0=v_~N~0_4, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_1|, ~q1_front~0=v_~q1_front~0_4, ~i~0=v_~i~0_6, ~q1_back~0=v_~q1_back~0_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~cond~2#1] and [839] L59-->L59: Formula: (and (= (+ 1 v_~q1_back~0_66) v_~q1_back~0_65) (not (= (mod |v_thread1Thread1of1ForFork2_~cond~0#1_16| 256) 0)) (= v_~i~0_56 (+ v_~i~0_57 1)) (= (ite (= (ite (< v_~i~0_56 v_~N~0_8) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork2_~cond~0#1_15|) (= (select (select |v_#memory_int_79| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_back~0_66))) v_~C~0_25) (= (ite |v_thread1_#t~short2#1_58| 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (not (= 0 |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) (<= 0 v_~q1_back~0_66) |v_thread1_#t~short2#1_57| (< v_~q1_back~0_66 v_~n1~0_22)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~i~0=v_~i~0_57, ~C~0=v_~C~0_25, ~q1_back~0=v_~q1_back~0_66, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_79|, ~N~0=v_~N~0_8, thread1Thread1of1ForFork2_~cond~0#1=|v_thread1Thread1of1ForFork2_~cond~0#1_16|} OutVars{~q1~0.offset=v_~q1~0.offset_29, ~i~0=v_~i~0_56, ~C~0=v_~C~0_25, thread1Thread1of1ForFork2_#t~short2#1=|v_thread1Thread1of1ForFork2_#t~short2#1_9|, ~n1~0=v_~n1~0_22, ~N~0=v_~N~0_8, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_9|, ~q1_back~0=v_~q1_back~0_65, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_79|, thread1Thread1of1ForFork2_#t~post4#1=|v_thread1Thread1of1ForFork2_#t~post4#1_9|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread1Thread1of1ForFork2_~cond~0#1=|v_thread1Thread1of1ForFork2_~cond~0#1_15|, thread1Thread1of1ForFork2_#t~mem1#1=|v_thread1Thread1of1ForFork2_#t~mem1#1_11|} AuxVars[|v_thread1_#t~short2#1_58|, |v_thread1_#t~short2#1_57|] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, ~i~0, thread1Thread1of1ForFork2_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~post4#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_~cond~0#1, thread1Thread1of1ForFork2_#t~mem1#1] [2022-12-06 05:22:18,887 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:22:18,888 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5210 [2022-12-06 05:22:18,888 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 113 transitions, 838 flow [2022-12-06 05:22:18,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.933333333333334) internal successors, (119), 15 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:18,888 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:18,889 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:18,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 05:22:19,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-12-06 05:22:19,095 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 2 more)] === [2022-12-06 05:22:19,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:19,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1417993986, now seen corresponding path program 1 times [2022-12-06 05:22:19,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:19,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400393605] [2022-12-06 05:22:19,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:19,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:19,618 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-06 05:22:19,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:19,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400393605] [2022-12-06 05:22:19,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400393605] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:22:19,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406721281] [2022-12-06 05:22:19,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:19,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:22:19,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:22:19,625 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:22:19,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 05:22:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:19,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-06 05:22:19,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:22:19,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 05:22:19,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:22:19,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:22:19,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:22:19,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:22:19,955 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-06 05:22:20,048 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-06 05:22:20,055 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-06 05:22:20,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:22:20,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:20,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406721281] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:22:20,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:22:20,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 17 [2022-12-06 05:22:20,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209613516] [2022-12-06 05:22:20,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:22:20,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 05:22:20,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:20,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 05:22:20,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=269, Unknown=5, NotChecked=0, Total=342 [2022-12-06 05:22:20,405 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2022-12-06 05:22:20,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 113 transitions, 838 flow. Second operand has 19 states, 19 states have (on average 7.473684210526316) internal successors, (142), 19 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:20,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:20,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2022-12-06 05:22:20,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:22,988 INFO L130 PetriNetUnfolder]: 16708/21973 cut-off events. [2022-12-06 05:22:22,988 INFO L131 PetriNetUnfolder]: For 43034/43036 co-relation queries the response was YES. [2022-12-06 05:22:23,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72156 conditions, 21973 events. 16708/21973 cut-off events. For 43034/43036 co-relation queries the response was YES. Maximal size of possible extension queue 1147. Compared 119684 event pairs, 4553 based on Foata normal form. 4/18968 useless extension candidates. Maximal degree in co-relation 67868. Up to 10618 conditions per place. [2022-12-06 05:22:23,134 INFO L137 encePairwiseOnDemand]: 28/38 looper letters, 149 selfloop transitions, 24 changer transitions 9/187 dead transitions. [2022-12-06 05:22:23,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 187 transitions, 1585 flow [2022-12-06 05:22:23,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:22:23,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:22:23,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2022-12-06 05:22:23,136 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46616541353383456 [2022-12-06 05:22:23,136 INFO L175 Difference]: Start difference. First operand has 77 places, 113 transitions, 838 flow. Second operand 7 states and 124 transitions. [2022-12-06 05:22:23,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 187 transitions, 1585 flow [2022-12-06 05:22:23,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 187 transitions, 1555 flow, removed 15 selfloop flow, removed 1 redundant places. [2022-12-06 05:22:23,276 INFO L231 Difference]: Finished difference. Result has 84 places, 119 transitions, 913 flow [2022-12-06 05:22:23,276 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=913, PETRI_PLACES=84, PETRI_TRANSITIONS=119} [2022-12-06 05:22:23,277 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 42 predicate places. [2022-12-06 05:22:23,277 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:23,277 INFO L89 Accepts]: Start accepts. Operand has 84 places, 119 transitions, 913 flow [2022-12-06 05:22:23,278 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:23,278 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:23,279 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 119 transitions, 913 flow [2022-12-06 05:22:23,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 119 transitions, 913 flow [2022-12-06 05:22:23,339 INFO L130 PetriNetUnfolder]: 263/809 cut-off events. [2022-12-06 05:22:23,339 INFO L131 PetriNetUnfolder]: For 1651/1665 co-relation queries the response was YES. [2022-12-06 05:22:23,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2559 conditions, 809 events. 263/809 cut-off events. For 1651/1665 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5451 event pairs, 17 based on Foata normal form. 5/793 useless extension candidates. Maximal degree in co-relation 2397. Up to 172 conditions per place. [2022-12-06 05:22:23,347 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 119 transitions, 913 flow [2022-12-06 05:22:23,347 INFO L188 LiptonReduction]: Number of co-enabled transitions 1972 [2022-12-06 05:22:29,474 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:29,475 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6198 [2022-12-06 05:22:29,475 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 119 transitions, 919 flow [2022-12-06 05:22:29,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.473684210526316) internal successors, (142), 19 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:29,475 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:29,475 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:29,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 05:22:29,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:22:29,683 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 2 more)] === [2022-12-06 05:22:29,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:29,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1972099819, now seen corresponding path program 1 times [2022-12-06 05:22:29,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:29,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468791212] [2022-12-06 05:22:29,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:29,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:30,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:30,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:30,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468791212] [2022-12-06 05:22:30,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468791212] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:22:30,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895349364] [2022-12-06 05:22:30,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:30,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:22:30,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:22:30,363 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:22:30,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 05:22:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:30,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 05:22:30,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:22:30,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:22:30,608 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-06 05:22:30,650 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-06 05:22:30,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:30,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:22:30,723 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:22:30,723 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 46 treesize of output 42 [2022-12-06 05:22:30,738 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 11 treesize of output 5 [2022-12-06 05:22:30,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:30,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895349364] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:22:30,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:22:30,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 05:22:30,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515599833] [2022-12-06 05:22:30,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:22:30,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 05:22:30,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:30,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 05:22:30,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=162, Unknown=3, NotChecked=0, Total=210 [2022-12-06 05:22:30,805 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 40 [2022-12-06 05:22:30,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 119 transitions, 919 flow. Second operand has 15 states, 15 states have (on average 7.666666666666667) internal successors, (115), 15 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:30,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:30,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 40 [2022-12-06 05:22:30,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:34,531 INFO L130 PetriNetUnfolder]: 28364/37199 cut-off events. [2022-12-06 05:22:34,532 INFO L131 PetriNetUnfolder]: For 80283/80287 co-relation queries the response was YES. [2022-12-06 05:22:34,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125696 conditions, 37199 events. 28364/37199 cut-off events. For 80283/80287 co-relation queries the response was YES. Maximal size of possible extension queue 1924. Compared 216191 event pairs, 6371 based on Foata normal form. 72/32112 useless extension candidates. Maximal degree in co-relation 112421. Up to 19747 conditions per place. [2022-12-06 05:22:34,770 INFO L137 encePairwiseOnDemand]: 26/40 looper letters, 199 selfloop transitions, 89 changer transitions 13/306 dead transitions. [2022-12-06 05:22:34,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 306 transitions, 2626 flow [2022-12-06 05:22:34,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:22:34,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:22:34,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 208 transitions. [2022-12-06 05:22:34,771 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4727272727272727 [2022-12-06 05:22:34,771 INFO L175 Difference]: Start difference. First operand has 84 places, 119 transitions, 919 flow. Second operand 11 states and 208 transitions. [2022-12-06 05:22:34,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 306 transitions, 2626 flow [2022-12-06 05:22:35,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 306 transitions, 2552 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-12-06 05:22:35,120 INFO L231 Difference]: Finished difference. Result has 94 places, 186 transitions, 1744 flow [2022-12-06 05:22:35,120 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=871, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1744, PETRI_PLACES=94, PETRI_TRANSITIONS=186} [2022-12-06 05:22:35,120 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 52 predicate places. [2022-12-06 05:22:35,120 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:35,120 INFO L89 Accepts]: Start accepts. Operand has 94 places, 186 transitions, 1744 flow [2022-12-06 05:22:35,123 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:35,123 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:35,123 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 186 transitions, 1744 flow [2022-12-06 05:22:35,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 186 transitions, 1744 flow [2022-12-06 05:22:35,345 INFO L130 PetriNetUnfolder]: 430/1344 cut-off events. [2022-12-06 05:22:35,345 INFO L131 PetriNetUnfolder]: For 3684/3732 co-relation queries the response was YES. [2022-12-06 05:22:35,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4567 conditions, 1344 events. 430/1344 cut-off events. For 3684/3732 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10542 event pairs, 31 based on Foata normal form. 17/1330 useless extension candidates. Maximal degree in co-relation 4377. Up to 271 conditions per place. [2022-12-06 05:22:35,362 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 186 transitions, 1744 flow [2022-12-06 05:22:35,363 INFO L188 LiptonReduction]: Number of co-enabled transitions 3368 [2022-12-06 05:22:35,364 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->L95: Formula: (= (ite (= (ite (or (< v_~i~0_6 v_~N~0_4) (< v_~q1_front~0_4 v_~q1_back~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork1_~cond~2#1_1|) InVars {~N~0=v_~N~0_4, ~q1_front~0=v_~q1_front~0_4, ~i~0=v_~i~0_6, ~q1_back~0=v_~q1_back~0_6} OutVars{~N~0=v_~N~0_4, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_1|, ~q1_front~0=v_~q1_front~0_4, ~i~0=v_~i~0_6, ~q1_back~0=v_~q1_back~0_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~cond~2#1] and [839] L59-->L59: Formula: (and (= (+ 1 v_~q1_back~0_66) v_~q1_back~0_65) (not (= (mod |v_thread1Thread1of1ForFork2_~cond~0#1_16| 256) 0)) (= v_~i~0_56 (+ v_~i~0_57 1)) (= (ite (= (ite (< v_~i~0_56 v_~N~0_8) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork2_~cond~0#1_15|) (= (select (select |v_#memory_int_79| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_back~0_66))) v_~C~0_25) (= (ite |v_thread1_#t~short2#1_58| 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (not (= 0 |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) (<= 0 v_~q1_back~0_66) |v_thread1_#t~short2#1_57| (< v_~q1_back~0_66 v_~n1~0_22)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~i~0=v_~i~0_57, ~C~0=v_~C~0_25, ~q1_back~0=v_~q1_back~0_66, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_79|, ~N~0=v_~N~0_8, thread1Thread1of1ForFork2_~cond~0#1=|v_thread1Thread1of1ForFork2_~cond~0#1_16|} OutVars{~q1~0.offset=v_~q1~0.offset_29, ~i~0=v_~i~0_56, ~C~0=v_~C~0_25, thread1Thread1of1ForFork2_#t~short2#1=|v_thread1Thread1of1ForFork2_#t~short2#1_9|, ~n1~0=v_~n1~0_22, ~N~0=v_~N~0_8, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_9|, ~q1_back~0=v_~q1_back~0_65, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_79|, thread1Thread1of1ForFork2_#t~post4#1=|v_thread1Thread1of1ForFork2_#t~post4#1_9|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread1Thread1of1ForFork2_~cond~0#1=|v_thread1Thread1of1ForFork2_~cond~0#1_15|, thread1Thread1of1ForFork2_#t~mem1#1=|v_thread1Thread1of1ForFork2_#t~mem1#1_11|} AuxVars[|v_thread1_#t~short2#1_58|, |v_thread1_#t~short2#1_57|] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, ~i~0, thread1Thread1of1ForFork2_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~post4#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_~cond~0#1, thread1Thread1of1ForFork2_#t~mem1#1] [2022-12-06 05:22:35,456 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:35,457 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 337 [2022-12-06 05:22:35,457 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 186 transitions, 1748 flow [2022-12-06 05:22:35,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.666666666666667) internal successors, (115), 15 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:35,458 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:35,458 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:35,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 05:22:35,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:22:35,663 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 2 more)] === [2022-12-06 05:22:35,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:35,663 INFO L85 PathProgramCache]: Analyzing trace with hash 414610100, now seen corresponding path program 1 times [2022-12-06 05:22:35,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:35,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389636740] [2022-12-06 05:22:35,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:35,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:36,573 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-06 05:22:36,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:36,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389636740] [2022-12-06 05:22:36,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389636740] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:22:36,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926526828] [2022-12-06 05:22:36,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:36,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:22:36,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:22:36,575 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-06 05:22:36,577 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-06 05:22:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:36,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 05:22:36,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:22:36,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:22:36,796 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-06 05:22:36,827 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-06 05:22:36,841 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-06 05:22:36,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:22:36,884 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_422 (Array Int Int))) (< 0 (+ c_~total~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_422) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset))))) is different from false [2022-12-06 05:22:36,893 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:22:36,893 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 46 treesize of output 42 [2022-12-06 05:22:36,895 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 11 treesize of output 5 [2022-12-06 05:22:36,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 05:22:36,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926526828] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:22:36,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:22:36,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2022-12-06 05:22:36,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230213060] [2022-12-06 05:22:36,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:22:36,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 05:22:36,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:36,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 05:22:36,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=170, Unknown=1, NotChecked=26, Total=240 [2022-12-06 05:22:36,963 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 40 [2022-12-06 05:22:36,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 186 transitions, 1748 flow. Second operand has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:36,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:36,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 40 [2022-12-06 05:22:36,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:41,720 INFO L130 PetriNetUnfolder]: 34422/45201 cut-off events. [2022-12-06 05:22:41,720 INFO L131 PetriNetUnfolder]: For 138636/138636 co-relation queries the response was YES. [2022-12-06 05:22:41,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163696 conditions, 45201 events. 34422/45201 cut-off events. For 138636/138636 co-relation queries the response was YES. Maximal size of possible extension queue 2348. Compared 268343 event pairs, 9501 based on Foata normal form. 2/38977 useless extension candidates. Maximal degree in co-relation 157899. Up to 27438 conditions per place. [2022-12-06 05:22:42,015 INFO L137 encePairwiseOnDemand]: 27/40 looper letters, 197 selfloop transitions, 85 changer transitions 6/293 dead transitions. [2022-12-06 05:22:42,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 293 transitions, 3011 flow [2022-12-06 05:22:42,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:22:42,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:22:42,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2022-12-06 05:22:42,017 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5107142857142857 [2022-12-06 05:22:42,017 INFO L175 Difference]: Start difference. First operand has 93 places, 186 transitions, 1748 flow. Second operand 7 states and 143 transitions. [2022-12-06 05:22:42,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 293 transitions, 3011 flow [2022-12-06 05:22:42,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 293 transitions, 2969 flow, removed 21 selfloop flow, removed 1 redundant places. [2022-12-06 05:22:42,736 INFO L231 Difference]: Finished difference. Result has 100 places, 213 transitions, 2269 flow [2022-12-06 05:22:42,736 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1714, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2269, PETRI_PLACES=100, PETRI_TRANSITIONS=213} [2022-12-06 05:22:42,736 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 58 predicate places. [2022-12-06 05:22:42,737 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:42,737 INFO L89 Accepts]: Start accepts. Operand has 100 places, 213 transitions, 2269 flow [2022-12-06 05:22:42,740 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:42,740 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:42,740 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 213 transitions, 2269 flow [2022-12-06 05:22:42,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 213 transitions, 2269 flow [2022-12-06 05:22:42,871 INFO L130 PetriNetUnfolder]: 498/1635 cut-off events. [2022-12-06 05:22:42,872 INFO L131 PetriNetUnfolder]: For 5312/5352 co-relation queries the response was YES. [2022-12-06 05:22:42,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5707 conditions, 1635 events. 498/1635 cut-off events. For 5312/5352 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 13749 event pairs, 37 based on Foata normal form. 13/1611 useless extension candidates. Maximal degree in co-relation 5522. Up to 317 conditions per place. [2022-12-06 05:22:42,896 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 213 transitions, 2269 flow [2022-12-06 05:22:42,896 INFO L188 LiptonReduction]: Number of co-enabled transitions 3970 [2022-12-06 05:22:42,903 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:22:42,904 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 05:22:42,904 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 213 transitions, 2269 flow [2022-12-06 05:22:42,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:42,904 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:42,904 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:42,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-06 05:22:43,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:22:43,109 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 2 more)] === [2022-12-06 05:22:43,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:43,110 INFO L85 PathProgramCache]: Analyzing trace with hash -923831064, now seen corresponding path program 2 times [2022-12-06 05:22:43,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:43,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6387228] [2022-12-06 05:22:43,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:43,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:44,224 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-06 05:22:44,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:44,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6387228] [2022-12-06 05:22:44,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6387228] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:22:44,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767295030] [2022-12-06 05:22:44,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:22:44,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:22:44,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:22:44,226 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-06 05:22:44,228 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-06 05:22:44,352 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:22:44,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:22:44,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 05:22:44,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:22:44,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:22:44,500 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-06 05:22:44,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:22:44,541 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-06 05:22:44,563 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-06 05:22:44,576 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-06 05:22:44,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:22:44,617 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 (Array Int Int))) (< 0 (+ c_~total~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_500) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset))))) is different from false [2022-12-06 05:22:46,673 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:22:46,673 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 88 treesize of output 84 [2022-12-06 05:22:46,677 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 68 treesize of output 56 [2022-12-06 05:22:46,681 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 30 treesize of output 24 [2022-12-06 05:22:46,802 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-06 05:22:46,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767295030] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:22:46,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:22:46,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-06 05:22:46,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109997466] [2022-12-06 05:22:46,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:22:46,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 05:22:46,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:46,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 05:22:46,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=221, Unknown=3, NotChecked=30, Total=306 [2022-12-06 05:22:46,803 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 40 [2022-12-06 05:22:46,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 213 transitions, 2269 flow. Second operand has 18 states, 18 states have (on average 6.888888888888889) internal successors, (124), 18 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:46,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:46,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 40 [2022-12-06 05:22:46,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:54,224 INFO L130 PetriNetUnfolder]: 48184/63237 cut-off events. [2022-12-06 05:22:54,224 INFO L131 PetriNetUnfolder]: For 245434/245494 co-relation queries the response was YES. [2022-12-06 05:22:54,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242546 conditions, 63237 events. 48184/63237 cut-off events. For 245434/245494 co-relation queries the response was YES. Maximal size of possible extension queue 3256. Compared 391342 event pairs, 10655 based on Foata normal form. 62/54577 useless extension candidates. Maximal degree in co-relation 236399. Up to 24476 conditions per place. [2022-12-06 05:22:54,657 INFO L137 encePairwiseOnDemand]: 27/40 looper letters, 247 selfloop transitions, 178 changer transitions 11/441 dead transitions. [2022-12-06 05:22:54,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 441 transitions, 4997 flow [2022-12-06 05:22:54,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:22:54,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:22:54,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 216 transitions. [2022-12-06 05:22:54,659 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.54 [2022-12-06 05:22:54,659 INFO L175 Difference]: Start difference. First operand has 100 places, 213 transitions, 2269 flow. Second operand 10 states and 216 transitions. [2022-12-06 05:22:54,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 441 transitions, 4997 flow [2022-12-06 05:22:56,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 441 transitions, 4866 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:56,839 INFO L231 Difference]: Finished difference. Result has 111 places, 298 transitions, 3885 flow [2022-12-06 05:22:56,840 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2193, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3885, PETRI_PLACES=111, PETRI_TRANSITIONS=298} [2022-12-06 05:22:56,840 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 69 predicate places. [2022-12-06 05:22:56,840 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:56,840 INFO L89 Accepts]: Start accepts. Operand has 111 places, 298 transitions, 3885 flow [2022-12-06 05:22:56,841 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:56,841 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:56,842 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 298 transitions, 3885 flow [2022-12-06 05:22:56,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 298 transitions, 3885 flow [2022-12-06 05:22:57,050 INFO L130 PetriNetUnfolder]: 732/2398 cut-off events. [2022-12-06 05:22:57,051 INFO L131 PetriNetUnfolder]: For 12766/12838 co-relation queries the response was YES. [2022-12-06 05:22:57,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9392 conditions, 2398 events. 732/2398 cut-off events. For 12766/12838 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 22021 event pairs, 56 based on Foata normal form. 25/2360 useless extension candidates. Maximal degree in co-relation 9184. Up to 465 conditions per place. [2022-12-06 05:22:57,094 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 298 transitions, 3885 flow [2022-12-06 05:22:57,094 INFO L188 LiptonReduction]: Number of co-enabled transitions 5692 [2022-12-06 05:22:59,752 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:59,752 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2912 [2022-12-06 05:22:59,752 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 298 transitions, 3886 flow [2022-12-06 05:22:59,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.888888888888889) internal successors, (124), 18 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:59,753 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:59,753 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:59,760 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-06 05:22:59,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:22:59,960 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 2 more)] === [2022-12-06 05:22:59,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:59,961 INFO L85 PathProgramCache]: Analyzing trace with hash -136415937, now seen corresponding path program 1 times [2022-12-06 05:22:59,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:59,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205285140] [2022-12-06 05:22:59,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:59,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:01,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:01,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:01,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205285140] [2022-12-06 05:23:01,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205285140] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:23:01,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60456450] [2022-12-06 05:23:01,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:01,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:23:01,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:23:01,217 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-06 05:23:01,218 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-06 05:23:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:01,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 05:23:01,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:23:01,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:23:01,525 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 19 treesize of output 21 [2022-12-06 05:23:01,635 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 25 treesize of output 7 [2022-12-06 05:23:01,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:01,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:23:01,941 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 05:23:01,941 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 46 treesize of output 34 [2022-12-06 05:23:01,945 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 11 treesize of output 5 [2022-12-06 05:23:02,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:02,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60456450] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:23:02,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:23:02,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-12-06 05:23:02,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339040867] [2022-12-06 05:23:02,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:23:02,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 05:23:02,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:02,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 05:23:02,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=464, Unknown=1, NotChecked=0, Total=552 [2022-12-06 05:23:02,099 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 41 [2022-12-06 05:23:02,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 298 transitions, 3886 flow. Second operand has 24 states, 24 states have (on average 5.708333333333333) internal successors, (137), 24 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:02,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:02,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 41 [2022-12-06 05:23:02,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:28,559 INFO L130 PetriNetUnfolder]: 137103/180810 cut-off events. [2022-12-06 05:23:28,560 INFO L131 PetriNetUnfolder]: For 908183/908365 co-relation queries the response was YES. [2022-12-06 05:23:29,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 738534 conditions, 180810 events. 137103/180810 cut-off events. For 908183/908365 co-relation queries the response was YES. Maximal size of possible extension queue 9210. Compared 1260848 event pairs, 9852 based on Foata normal form. 553/156367 useless extension candidates. Maximal degree in co-relation 720622. Up to 35326 conditions per place. [2022-12-06 05:23:30,239 INFO L137 encePairwiseOnDemand]: 19/41 looper letters, 900 selfloop transitions, 933 changer transitions 59/1895 dead transitions. [2022-12-06 05:23:30,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 1895 transitions, 21042 flow [2022-12-06 05:23:30,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-12-06 05:23:30,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2022-12-06 05:23:30,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 1178 transitions. [2022-12-06 05:23:30,255 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2022-12-06 05:23:30,256 INFO L175 Difference]: Start difference. First operand has 111 places, 298 transitions, 3886 flow. Second operand 62 states and 1178 transitions. [2022-12-06 05:23:30,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 1895 transitions, 21042 flow [2022-12-06 05:23:59,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 1895 transitions, 20192 flow, removed 128 selfloop flow, removed 3 redundant places. [2022-12-06 05:23:59,935 INFO L231 Difference]: Finished difference. Result has 196 places, 1096 transitions, 16904 flow [2022-12-06 05:23:59,935 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3605, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=236, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=62, PETRI_FLOW=16904, PETRI_PLACES=196, PETRI_TRANSITIONS=1096} [2022-12-06 05:23:59,936 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 154 predicate places. [2022-12-06 05:23:59,936 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:59,936 INFO L89 Accepts]: Start accepts. Operand has 196 places, 1096 transitions, 16904 flow [2022-12-06 05:23:59,940 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:59,940 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:59,940 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 1096 transitions, 16904 flow [2022-12-06 05:23:59,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 196 places, 1096 transitions, 16904 flow [2022-12-06 05:24:00,914 INFO L130 PetriNetUnfolder]: 2222/7216 cut-off events. [2022-12-06 05:24:00,914 INFO L131 PetriNetUnfolder]: For 51568/51887 co-relation queries the response was YES. [2022-12-06 05:24:00,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31914 conditions, 7216 events. 2222/7216 cut-off events. For 51568/51887 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 81659 event pairs, 47 based on Foata normal form. 72/7137 useless extension candidates. Maximal degree in co-relation 31696. Up to 1266 conditions per place. [2022-12-06 05:24:01,076 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 196 places, 1096 transitions, 16904 flow [2022-12-06 05:24:01,077 INFO L188 LiptonReduction]: Number of co-enabled transitions 21138 [2022-12-06 05:24:01,084 WARN L322 ript$VariableManager]: TermVariable LBE521 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:24:01,085 WARN L322 ript$VariableManager]: TermVariable LBE506 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:24:01,085 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:24:01,085 WARN L322 ript$VariableManager]: TermVariable LBE27 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:24:01,089 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-06 05:24:01,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:24:01,286 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Function c_aux_v_thread1_#t~short2#1_60 is already defined. at de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.declareFun(Scriptor.java:115) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.declareFun(HistoryRecordingScript.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.declareFun(ManagedScript.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:117) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToTransFormula(BranchEncoderRenaming.java:114) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToIcfgEdge(BranchEncoderRenaming.java:134) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:119) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:1) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:67) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.executeComposition(SequenceRule.java:724) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.applyInternal(SequenceRule.java:150) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.sequenceRuleWrapper(LiptonReduction.java:252) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:199) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 05:24:01,289 INFO L158 Benchmark]: Toolchain (without parser) took 126589.45ms. Allocated memory was 190.8MB in the beginning and 6.5GB in the end (delta: 6.3GB). Free memory was 167.1MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2022-12-06 05:24:01,289 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 190.8MB. Free memory is still 167.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:24:01,289 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.01ms. Allocated memory is still 190.8MB. Free memory was 167.1MB in the beginning and 151.4MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-12-06 05:24:01,289 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.30ms. Allocated memory is still 190.8MB. Free memory was 151.4MB in the beginning and 148.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 05:24:01,289 INFO L158 Benchmark]: Boogie Preprocessor took 48.88ms. Allocated memory is still 190.8MB. Free memory was 148.2MB in the beginning and 146.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:24:01,289 INFO L158 Benchmark]: RCFGBuilder took 693.01ms. Allocated memory is still 190.8MB. Free memory was 146.1MB in the beginning and 101.6MB in the end (delta: 44.6MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. [2022-12-06 05:24:01,290 INFO L158 Benchmark]: TraceAbstraction took 125525.79ms. Allocated memory was 190.8MB in the beginning and 6.5GB in the end (delta: 6.3GB). Free memory was 101.0MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2022-12-06 05:24:01,290 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 190.8MB. Free memory is still 167.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 268.01ms. Allocated memory is still 190.8MB. Free memory was 167.1MB in the beginning and 151.4MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.30ms. Allocated memory is still 190.8MB. Free memory was 151.4MB in the beginning and 148.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.88ms. Allocated memory is still 190.8MB. Free memory was 148.2MB in the beginning and 146.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 693.01ms. Allocated memory is still 190.8MB. Free memory was 146.1MB in the beginning and 101.6MB in the end (delta: 44.6MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. * TraceAbstraction took 125525.79ms. Allocated memory was 190.8MB in the beginning and 6.5GB in the end (delta: 6.3GB). Free memory was 101.0MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.6s, 204 PlacesBefore, 42 PlacesAfterwards, 210 TransitionsBefore, 35 TransitionsAfterwards, 1824 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 131 TrivialYvCompositions, 31 ConcurrentYvCompositions, 13 ChoiceCompositions, 175 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 962, independent: 948, independent conditional: 948, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 962, independent: 948, independent conditional: 0, independent unconditional: 948, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 962, independent: 948, independent conditional: 0, independent unconditional: 948, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 962, independent: 948, independent conditional: 0, independent unconditional: 948, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 899, independent: 890, independent conditional: 0, independent unconditional: 890, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 899, independent: 889, independent conditional: 0, independent unconditional: 889, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 53, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 962, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 899, unknown conditional: 0, unknown unconditional: 899] , Statistics on independence cache: Total cache size (in pairs): 1352, Positive cache size: 1343, Positive conditional cache size: 0, Positive unconditional cache size: 1343, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 448 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 46, independent conditional: 7, independent unconditional: 39, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, independent: 46, independent conditional: 7, independent unconditional: 39, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 46, independent conditional: 7, independent unconditional: 39, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 39, independent: 36, independent conditional: 6, independent unconditional: 30, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 39, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, independent: 17, independent conditional: 8, independent unconditional: 9, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50, independent: 10, independent conditional: 1, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 39, unknown conditional: 6, unknown unconditional: 33] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 36, Positive conditional cache size: 6, Positive unconditional cache size: 30, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 45 PlacesBefore, 44 PlacesAfterwards, 40 TransitionsBefore, 39 TransitionsAfterwards, 446 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 96, independent: 88, independent conditional: 88, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 96, independent: 88, independent conditional: 12, independent unconditional: 76, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 96, independent: 88, independent conditional: 8, independent unconditional: 80, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 96, independent: 88, independent conditional: 8, independent unconditional: 80, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 96, independent: 76, independent conditional: 8, independent unconditional: 68, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 48, Positive conditional cache size: 6, Positive unconditional cache size: 42, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 660 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 9, independent unconditional: 11, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, independent: 20, independent conditional: 9, independent unconditional: 11, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 9, independent unconditional: 11, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, independent: 20, independent conditional: 9, independent unconditional: 11, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 48, Positive conditional cache size: 6, Positive unconditional cache size: 42, Negative cache size: 5, Negative conditional cache size: 1, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 78 PlacesBefore, 77 PlacesAfterwards, 114 TransitionsBefore, 113 TransitionsAfterwards, 1870 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 236, independent: 216, independent conditional: 216, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 236, independent: 216, independent conditional: 116, independent unconditional: 100, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 236, independent: 216, independent conditional: 116, independent unconditional: 100, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 236, independent: 216, independent conditional: 116, independent unconditional: 100, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, 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: 17, independent: 17, independent conditional: 0, independent unconditional: 17, 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: 236, independent: 199, independent conditional: 99, independent unconditional: 100, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 71, Positive conditional cache size: 27, Positive unconditional cache size: 44, Negative cache size: 5, Negative conditional cache size: 1, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1s, 84 PlacesBefore, 84 PlacesAfterwards, 119 TransitionsBefore, 119 TransitionsAfterwards, 1972 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 286, independent: 260, independent conditional: 260, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 286, independent: 260, independent conditional: 104, independent unconditional: 156, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 286, independent: 260, independent conditional: 104, independent unconditional: 156, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 286, independent: 260, independent conditional: 104, independent unconditional: 156, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 286, independent: 257, independent conditional: 102, independent unconditional: 155, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 74, Positive conditional cache size: 29, Positive unconditional cache size: 45, Negative cache size: 5, Negative conditional cache size: 1, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 93 PlacesBefore, 93 PlacesAfterwards, 186 TransitionsBefore, 186 TransitionsAfterwards, 3368 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1136, independent: 1074, independent conditional: 1074, independent unconditional: 0, dependent: 62, dependent conditional: 62, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1136, independent: 1074, independent conditional: 640, independent unconditional: 434, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1136, independent: 1074, independent conditional: 516, independent unconditional: 558, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1136, independent: 1074, independent conditional: 516, independent unconditional: 558, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1136, independent: 1069, independent conditional: 512, independent unconditional: 557, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 82, Positive conditional cache size: 35, Positive unconditional cache size: 47, Negative cache size: 5, Negative conditional cache size: 1, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 124, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 100 PlacesBefore, 100 PlacesAfterwards, 213 TransitionsBefore, 213 TransitionsAfterwards, 3970 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 897, independent: 858, independent conditional: 858, independent unconditional: 0, dependent: 39, dependent conditional: 39, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 897, independent: 858, independent conditional: 429, independent unconditional: 429, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 897, independent: 858, independent conditional: 390, independent unconditional: 468, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 897, independent: 858, independent conditional: 390, independent unconditional: 468, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 897, independent: 857, independent conditional: 389, independent unconditional: 468, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 83, Positive conditional cache size: 36, Positive unconditional cache size: 47, Negative cache size: 5, Negative conditional cache size: 1, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 39, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 111 PlacesBefore, 111 PlacesAfterwards, 298 TransitionsBefore, 298 TransitionsAfterwards, 5692 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3640, independent: 3510, independent conditional: 3510, independent unconditional: 0, dependent: 130, dependent conditional: 130, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3640, independent: 3510, independent conditional: 1820, independent unconditional: 1690, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3640, independent: 3510, independent conditional: 1560, independent unconditional: 1950, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3640, independent: 3510, independent conditional: 1560, independent unconditional: 1950, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3640, independent: 3509, independent conditional: 1560, independent unconditional: 1949, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 84, Positive conditional cache size: 36, Positive unconditional cache size: 48, Negative cache size: 5, Negative conditional cache size: 1, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 260, Maximal queried relation: 0 - ExceptionOrErrorResult: SMTLIBException: Function c_aux_v_thread1_#t~short2#1_60 is already defined. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Function c_aux_v_thread1_#t~short2#1_60 is already defined.: de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 05:24:01,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...