/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 00:07:50,045 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:07:50,047 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:07:50,092 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:07:50,093 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:07:50,096 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:07:50,098 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:07:50,102 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:07:50,106 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:07:50,112 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:07:50,113 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:07:50,114 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:07:50,115 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:07:50,117 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:07:50,117 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:07:50,118 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:07:50,119 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:07:50,119 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:07:50,121 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:07:50,122 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:07:50,123 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:07:50,125 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:07:50,126 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:07:50,127 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:07:50,133 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:07:50,133 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:07:50,133 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:07:50,134 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:07:50,134 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:07:50,135 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:07:50,135 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:07:50,136 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:07:50,137 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:07:50,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:07:50,138 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:07:50,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:07:50,139 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:07:50,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:07:50,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:07:50,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:07:50,140 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:07:50,145 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 00:07:50,172 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:07:50,172 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:07:50,174 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:07:50,174 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:07:50,174 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:07:50,175 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:07:50,175 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:07:50,175 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:07:50,175 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:07:50,176 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:07:50,176 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:07:50,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:07:50,177 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:07:50,177 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:07:50,177 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:07:50,177 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:07:50,177 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:07:50,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:07:50,177 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:07:50,178 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:07:50,178 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:07:50,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:07:50,178 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:07:50,178 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:07:50,178 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:07:50,178 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:07:50,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:07:50,179 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:07:50,179 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 00:07:50,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:07:50,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:07:50,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:07:50,512 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:07:50,512 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:07:50,513 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 00:07:51,777 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:07:52,022 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:07:52,023 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2022-12-06 00:07:52,031 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a2f3ab54/b9da2e6e382d4135927ae66c91bb49ab/FLAG1456b86eb [2022-12-06 00:07:52,053 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a2f3ab54/b9da2e6e382d4135927ae66c91bb49ab [2022-12-06 00:07:52,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:07:52,056 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:07:52,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:07:52,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:07:52,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:07:52,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:07:52" (1/1) ... [2022-12-06 00:07:52,063 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16b979b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:07:52, skipping insertion in model container [2022-12-06 00:07:52,064 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:07:52" (1/1) ... [2022-12-06 00:07:52,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:07:52,098 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:07:52,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:52,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:52,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:52,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:52,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:52,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:52,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:52,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:52,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:52,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:52,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:52,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:52,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:52,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:52,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:52,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:52,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:52,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:52,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:52,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:52,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:52,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:52,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:52,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:52,309 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 00:07:52,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:07:52,330 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:07:52,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:52,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:52,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:52,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:52,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:52,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:52,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:52,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:52,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:52,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:52,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:52,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:52,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:52,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:52,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:52,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:52,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:52,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:52,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:52,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:52,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:52,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:52,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:52,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:52,375 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 00:07:52,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:07:52,391 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:07:52,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:07:52 WrapperNode [2022-12-06 00:07:52,391 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:07:52,392 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:07:52,392 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:07:52,392 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:07:52,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:07:52" (1/1) ... [2022-12-06 00:07:52,416 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:07:52" (1/1) ... [2022-12-06 00:07:52,451 INFO L138 Inliner]: procedures = 26, calls = 75, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 315 [2022-12-06 00:07:52,451 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:07:52,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:07:52,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:07:52,452 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:07:52,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:07:52" (1/1) ... [2022-12-06 00:07:52,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:07:52" (1/1) ... [2022-12-06 00:07:52,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:07:52" (1/1) ... [2022-12-06 00:07:52,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:07:52" (1/1) ... [2022-12-06 00:07:52,483 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:07:52" (1/1) ... [2022-12-06 00:07:52,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:07:52" (1/1) ... [2022-12-06 00:07:52,491 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:07:52" (1/1) ... [2022-12-06 00:07:52,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:07:52" (1/1) ... [2022-12-06 00:07:52,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:07:52,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:07:52,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:07:52,506 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:07:52,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:07:52" (1/1) ... [2022-12-06 00:07:52,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:07:52,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:07:52,534 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 00:07:52,552 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 00:07:52,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:07:52,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:07:52,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:07:52,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:07:52,574 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 00:07:52,574 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 00:07:52,575 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 00:07:52,575 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 00:07:52,575 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 00:07:52,575 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 00:07:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 00:07:52,576 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 00:07:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:07:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 00:07:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 00:07:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 00:07:52,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:07:52,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:07:52,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:07:52,579 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 00:07:52,728 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:07:52,730 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:07:53,176 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:07:53,306 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:07:53,306 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 00:07:53,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:07:53 BoogieIcfgContainer [2022-12-06 00:07:53,308 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:07:53,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:07:53,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:07:53,313 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:07:53,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:07:52" (1/3) ... [2022-12-06 00:07:53,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79721a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:07:53, skipping insertion in model container [2022-12-06 00:07:53,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:07:52" (2/3) ... [2022-12-06 00:07:53,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79721a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:07:53, skipping insertion in model container [2022-12-06 00:07:53,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:07:53" (3/3) ... [2022-12-06 00:07:53,315 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt2.wvr.c [2022-12-06 00:07:53,330 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:07:53,330 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 00:07:53,331 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:07:53,407 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-06 00:07:53,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 226 transitions, 484 flow [2022-12-06 00:07:53,508 INFO L130 PetriNetUnfolder]: 19/222 cut-off events. [2022-12-06 00:07:53,509 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 00:07:53,515 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 00:07:53,515 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 226 transitions, 484 flow [2022-12-06 00:07:53,519 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 204 places, 210 transitions, 444 flow [2022-12-06 00:07:53,521 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:53,542 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 204 places, 210 transitions, 444 flow [2022-12-06 00:07:53,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 210 transitions, 444 flow [2022-12-06 00:07:53,620 INFO L130 PetriNetUnfolder]: 19/210 cut-off events. [2022-12-06 00:07:53,620 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 00:07:53,621 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 00:07:53,624 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 210 transitions, 444 flow [2022-12-06 00:07:53,624 INFO L188 LiptonReduction]: Number of co-enabled transitions 1824 [2022-12-06 00:08:04,631 INFO L203 LiptonReduction]: Total number of compositions: 175 [2022-12-06 00:08:04,642 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:08:04,648 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;@3dda6b15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:08:04,648 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 00:08:04,655 INFO L130 PetriNetUnfolder]: 6/34 cut-off events. [2022-12-06 00:08:04,655 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 00:08:04,655 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:04,656 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 00:08:04,656 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 00:08:04,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:04,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1402613233, now seen corresponding path program 1 times [2022-12-06 00:08:04,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:04,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339199097] [2022-12-06 00:08:04,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:04,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:05,373 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 00:08:05,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:05,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339199097] [2022-12-06 00:08:05,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339199097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:05,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:05,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:05,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530452748] [2022-12-06 00:08:05,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:05,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:08:05,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:05,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:08:05,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:08:05,417 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-06 00:08:05,419 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 00:08:05,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:05,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-06 00:08:05,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:05,976 INFO L130 PetriNetUnfolder]: 2592/3424 cut-off events. [2022-12-06 00:08:05,976 INFO L131 PetriNetUnfolder]: For 281/281 co-relation queries the response was YES. [2022-12-06 00:08:05,986 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 00:08:06,007 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 66 selfloop transitions, 6 changer transitions 9/84 dead transitions. [2022-12-06 00:08:06,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 84 transitions, 387 flow [2022-12-06 00:08:06,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:08:06,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:08:06,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2022-12-06 00:08:06,020 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2022-12-06 00:08:06,021 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 94 flow. Second operand 6 states and 101 transitions. [2022-12-06 00:08:06,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 84 transitions, 387 flow [2022-12-06 00:08:06,031 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 00:08:06,033 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 117 flow [2022-12-06 00:08:06,035 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 00:08:06,039 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2022-12-06 00:08:06,039 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:06,040 INFO L89 Accepts]: Start accepts. Operand has 42 places, 39 transitions, 117 flow [2022-12-06 00:08:06,044 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:06,044 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:06,044 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 39 transitions, 117 flow [2022-12-06 00:08:06,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 39 transitions, 117 flow [2022-12-06 00:08:06,056 INFO L130 PetriNetUnfolder]: 11/54 cut-off events. [2022-12-06 00:08:06,056 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 00:08:06,057 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 00:08:06,057 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 39 transitions, 117 flow [2022-12-06 00:08:06,058 INFO L188 LiptonReduction]: Number of co-enabled transitions 448 [2022-12-06 00:08:06,093 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:08:06,096 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-06 00:08:06,096 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 117 flow [2022-12-06 00:08:06,096 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 00:08:06,096 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:06,096 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 00:08:06,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:08:06,099 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 00:08:06,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:06,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1996718852, now seen corresponding path program 1 times [2022-12-06 00:08:06,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:06,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781024491] [2022-12-06 00:08:06,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:06,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:06,278 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 00:08:06,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:06,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781024491] [2022-12-06 00:08:06,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781024491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:06,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:06,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:08:06,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20538172] [2022-12-06 00:08:06,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:06,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:06,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:06,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:06,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:06,282 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2022-12-06 00:08:06,283 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 00:08:06,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:06,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2022-12-06 00:08:06,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:06,753 INFO L130 PetriNetUnfolder]: 2170/3051 cut-off events. [2022-12-06 00:08:06,754 INFO L131 PetriNetUnfolder]: For 1299/1560 co-relation queries the response was YES. [2022-12-06 00:08:06,761 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 00:08:06,774 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 30 selfloop transitions, 2 changer transitions 39/79 dead transitions. [2022-12-06 00:08:06,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 79 transitions, 357 flow [2022-12-06 00:08:06,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:08:06,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:08:06,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2022-12-06 00:08:06,777 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5885714285714285 [2022-12-06 00:08:06,777 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 117 flow. Second operand 5 states and 103 transitions. [2022-12-06 00:08:06,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 79 transitions, 357 flow [2022-12-06 00:08:06,781 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 00:08:06,783 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 138 flow [2022-12-06 00:08:06,783 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 00:08:06,784 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2022-12-06 00:08:06,784 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:06,784 INFO L89 Accepts]: Start accepts. Operand has 47 places, 40 transitions, 138 flow [2022-12-06 00:08:06,786 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:06,787 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:06,787 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 40 transitions, 138 flow [2022-12-06 00:08:06,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 40 transitions, 138 flow [2022-12-06 00:08:06,796 INFO L130 PetriNetUnfolder]: 12/57 cut-off events. [2022-12-06 00:08:06,797 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 00:08:06,798 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 00:08:06,799 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 40 transitions, 138 flow [2022-12-06 00:08:06,799 INFO L188 LiptonReduction]: Number of co-enabled transitions 446 [2022-12-06 00:08:08,218 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:08,219 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1435 [2022-12-06 00:08:08,220 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 134 flow [2022-12-06 00:08:08,220 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 00:08:08,220 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:08,220 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 00:08:08,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:08:08,221 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 00:08:08,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:08,223 INFO L85 PathProgramCache]: Analyzing trace with hash 377684187, now seen corresponding path program 1 times [2022-12-06 00:08:08,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:08,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316004545] [2022-12-06 00:08:08,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:08,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:08,557 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 00:08:08,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:08,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316004545] [2022-12-06 00:08:08,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316004545] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:08:08,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002328303] [2022-12-06 00:08:08,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:08,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:08:08,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:08:08,567 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 00:08:08,599 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 00:08:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:08,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 00:08:08,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:08:08,929 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 00:08:08,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:08:09,050 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 00:08:09,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002328303] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 00:08:09,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 00:08:09,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 14 [2022-12-06 00:08:09,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987382522] [2022-12-06 00:08:09,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:09,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:08:09,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:09,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:08:09,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-12-06 00:08:09,058 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-06 00:08:09,058 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 00:08:09,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:09,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-06 00:08:09,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:09,715 INFO L130 PetriNetUnfolder]: 3646/4815 cut-off events. [2022-12-06 00:08:09,715 INFO L131 PetriNetUnfolder]: For 2376/2376 co-relation queries the response was YES. [2022-12-06 00:08:09,727 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 00:08:09,752 INFO L137 encePairwiseOnDemand]: 27/35 looper letters, 89 selfloop transitions, 15 changer transitions 0/107 dead transitions. [2022-12-06 00:08:09,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 107 transitions, 538 flow [2022-12-06 00:08:09,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:08:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:08:09,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2022-12-06 00:08:09,756 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49387755102040815 [2022-12-06 00:08:09,756 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 134 flow. Second operand 7 states and 121 transitions. [2022-12-06 00:08:09,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 107 transitions, 538 flow [2022-12-06 00:08:09,764 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 00:08:09,765 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 224 flow [2022-12-06 00:08:09,765 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 00:08:09,767 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2022-12-06 00:08:09,767 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:09,767 INFO L89 Accepts]: Start accepts. Operand has 51 places, 48 transitions, 224 flow [2022-12-06 00:08:09,768 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:09,768 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:09,769 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 48 transitions, 224 flow [2022-12-06 00:08:09,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 48 transitions, 224 flow [2022-12-06 00:08:09,781 INFO L130 PetriNetUnfolder]: 22/93 cut-off events. [2022-12-06 00:08:09,781 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-12-06 00:08:09,782 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 00:08:09,783 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 48 transitions, 224 flow [2022-12-06 00:08:09,783 INFO L188 LiptonReduction]: Number of co-enabled transitions 660 [2022-12-06 00:08:09,790 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:08:09,791 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 00:08:09,792 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 224 flow [2022-12-06 00:08:09,792 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 00:08:09,792 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:09,792 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 00:08:09,801 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 00:08:09,998 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 00:08:09,999 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 00:08:09,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:09,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1892802076, now seen corresponding path program 1 times [2022-12-06 00:08:09,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:09,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345088759] [2022-12-06 00:08:10,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:10,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:10,975 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 00:08:10,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:10,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345088759] [2022-12-06 00:08:10,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345088759] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:08:10,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035799637] [2022-12-06 00:08:10,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:10,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:08:10,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:08:10,977 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 00:08:10,982 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 00:08:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:11,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-06 00:08:11,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:08:11,360 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 00:08:11,373 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 00:08:11,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:08:11,422 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:08:11,423 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 00:08:11,610 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 00:08:11,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035799637] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:08:11,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:08:11,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 00:08:11,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984614852] [2022-12-06 00:08:11,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:08:11,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 00:08:11,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:11,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 00:08:11,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-12-06 00:08:11,613 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2022-12-06 00:08:11,614 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 00:08:11,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:11,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2022-12-06 00:08:11,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:14,223 INFO L130 PetriNetUnfolder]: 13822/18183 cut-off events. [2022-12-06 00:08:14,223 INFO L131 PetriNetUnfolder]: For 20140/20140 co-relation queries the response was YES. [2022-12-06 00:08:14,267 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 00:08:14,364 INFO L137 encePairwiseOnDemand]: 24/35 looper letters, 242 selfloop transitions, 65 changer transitions 14/326 dead transitions. [2022-12-06 00:08:14,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 326 transitions, 1958 flow [2022-12-06 00:08:14,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 00:08:14,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 00:08:14,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 350 transitions. [2022-12-06 00:08:14,367 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2022-12-06 00:08:14,367 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 224 flow. Second operand 17 states and 350 transitions. [2022-12-06 00:08:14,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 326 transitions, 1958 flow [2022-12-06 00:08:14,521 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 00:08:14,527 INFO L231 Difference]: Finished difference. Result has 78 places, 114 transitions, 833 flow [2022-12-06 00:08:14,527 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 00:08:14,528 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places. [2022-12-06 00:08:14,528 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:14,529 INFO L89 Accepts]: Start accepts. Operand has 78 places, 114 transitions, 833 flow [2022-12-06 00:08:14,531 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:14,532 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:14,532 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 114 transitions, 833 flow [2022-12-06 00:08:14,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 114 transitions, 833 flow [2022-12-06 00:08:14,696 INFO L130 PetriNetUnfolder]: 230/688 cut-off events. [2022-12-06 00:08:14,696 INFO L131 PetriNetUnfolder]: For 1464/1471 co-relation queries the response was YES. [2022-12-06 00:08:14,701 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 00:08:14,708 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 114 transitions, 833 flow [2022-12-06 00:08:14,708 INFO L188 LiptonReduction]: Number of co-enabled transitions 1870 [2022-12-06 00:08:14,710 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 00:08:14,813 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 00:08:19,944 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:08:19,945 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5417 [2022-12-06 00:08:19,945 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 113 transitions, 838 flow [2022-12-06 00:08:19,945 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 00:08:19,945 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:19,945 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 00:08:19,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 00:08:20,153 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 00:08:20,153 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 00:08:20,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:20,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1417993986, now seen corresponding path program 1 times [2022-12-06 00:08:20,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:20,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022468052] [2022-12-06 00:08:20,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:20,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:20,820 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 00:08:20,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:20,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022468052] [2022-12-06 00:08:20,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022468052] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:08:20,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910125263] [2022-12-06 00:08:20,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:20,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:08:20,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:08:20,822 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 00:08:20,838 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 00:08:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:20,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-06 00:08:20,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:08:20,991 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 00:08:21,027 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 00:08:21,094 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 00:08:21,149 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 00:08:21,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:08:21,240 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 00:08:21,335 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 00:08:21,344 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 00:08:21,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:08:21,826 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 00:08:21,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910125263] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:08:21,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:08:21,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 17 [2022-12-06 00:08:21,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465266363] [2022-12-06 00:08:21,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:08:21,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 00:08:21,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:21,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 00:08:21,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=269, Unknown=5, NotChecked=0, Total=342 [2022-12-06 00:08:21,828 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2022-12-06 00:08:21,829 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 00:08:21,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:21,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2022-12-06 00:08:21,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:24,747 INFO L130 PetriNetUnfolder]: 16708/21973 cut-off events. [2022-12-06 00:08:24,748 INFO L131 PetriNetUnfolder]: For 43034/43036 co-relation queries the response was YES. [2022-12-06 00:08:24,850 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 00:08:24,929 INFO L137 encePairwiseOnDemand]: 28/38 looper letters, 149 selfloop transitions, 24 changer transitions 9/187 dead transitions. [2022-12-06 00:08:24,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 187 transitions, 1585 flow [2022-12-06 00:08:24,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:08:24,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:08:24,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2022-12-06 00:08:24,930 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46616541353383456 [2022-12-06 00:08:24,930 INFO L175 Difference]: Start difference. First operand has 77 places, 113 transitions, 838 flow. Second operand 7 states and 124 transitions. [2022-12-06 00:08:24,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 187 transitions, 1585 flow [2022-12-06 00:08:25,077 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 00:08:25,081 INFO L231 Difference]: Finished difference. Result has 84 places, 119 transitions, 913 flow [2022-12-06 00:08:25,082 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 00:08:25,083 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 42 predicate places. [2022-12-06 00:08:25,083 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:25,083 INFO L89 Accepts]: Start accepts. Operand has 84 places, 119 transitions, 913 flow [2022-12-06 00:08:25,085 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:25,085 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:25,085 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 119 transitions, 913 flow [2022-12-06 00:08:25,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 119 transitions, 913 flow [2022-12-06 00:08:25,165 INFO L130 PetriNetUnfolder]: 263/809 cut-off events. [2022-12-06 00:08:25,165 INFO L131 PetriNetUnfolder]: For 1651/1665 co-relation queries the response was YES. [2022-12-06 00:08:25,170 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 00:08:25,179 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 119 transitions, 913 flow [2022-12-06 00:08:25,179 INFO L188 LiptonReduction]: Number of co-enabled transitions 1972 [2022-12-06 00:08:31,646 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:31,647 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6564 [2022-12-06 00:08:31,647 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 119 transitions, 919 flow [2022-12-06 00:08:31,648 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 00:08:31,648 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:31,648 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 00:08:31,653 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 00:08:31,851 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 00:08:31,852 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 00:08:31,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:31,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1972099819, now seen corresponding path program 1 times [2022-12-06 00:08:31,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:31,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094270589] [2022-12-06 00:08:31,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:31,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:32,789 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 00:08:32,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:32,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094270589] [2022-12-06 00:08:32,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094270589] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:08:32,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539788177] [2022-12-06 00:08:32,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:32,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:08:32,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:08:32,792 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 00:08:32,813 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 00:08:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:32,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 00:08:32,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:08:33,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:08:33,085 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 00:08:33,130 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 00:08:33,142 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 00:08:33,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:08:33,219 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:08:33,219 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 00:08:33,238 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 00:08:33,321 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 00:08:33,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539788177] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:08:33,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:08:33,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 00:08:33,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182719106] [2022-12-06 00:08:33,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:08:33,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 00:08:33,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:33,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 00:08:33,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=162, Unknown=3, NotChecked=0, Total=210 [2022-12-06 00:08:33,324 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 40 [2022-12-06 00:08:33,325 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 00:08:33,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:33,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 40 [2022-12-06 00:08:33,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:37,230 INFO L130 PetriNetUnfolder]: 28364/37199 cut-off events. [2022-12-06 00:08:37,230 INFO L131 PetriNetUnfolder]: For 80283/80287 co-relation queries the response was YES. [2022-12-06 00:08:37,417 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 00:08:37,567 INFO L137 encePairwiseOnDemand]: 26/40 looper letters, 199 selfloop transitions, 89 changer transitions 13/306 dead transitions. [2022-12-06 00:08:37,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 306 transitions, 2626 flow [2022-12-06 00:08:37,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 00:08:37,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 00:08:37,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 208 transitions. [2022-12-06 00:08:37,569 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4727272727272727 [2022-12-06 00:08:37,569 INFO L175 Difference]: Start difference. First operand has 84 places, 119 transitions, 919 flow. Second operand 11 states and 208 transitions. [2022-12-06 00:08:37,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 306 transitions, 2626 flow [2022-12-06 00:08:37,979 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 00:08:37,982 INFO L231 Difference]: Finished difference. Result has 94 places, 186 transitions, 1744 flow [2022-12-06 00:08:37,982 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 00:08:37,983 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 52 predicate places. [2022-12-06 00:08:37,983 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:37,983 INFO L89 Accepts]: Start accepts. Operand has 94 places, 186 transitions, 1744 flow [2022-12-06 00:08:37,985 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:37,985 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:37,986 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 186 transitions, 1744 flow [2022-12-06 00:08:37,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 186 transitions, 1744 flow [2022-12-06 00:08:38,206 INFO L130 PetriNetUnfolder]: 430/1344 cut-off events. [2022-12-06 00:08:38,207 INFO L131 PetriNetUnfolder]: For 3684/3732 co-relation queries the response was YES. [2022-12-06 00:08:38,213 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 00:08:38,228 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 186 transitions, 1744 flow [2022-12-06 00:08:38,228 INFO L188 LiptonReduction]: Number of co-enabled transitions 3368 [2022-12-06 00:08:38,230 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 00:08:38,328 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:38,329 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 346 [2022-12-06 00:08:38,329 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 186 transitions, 1748 flow [2022-12-06 00:08:38,329 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 00:08:38,330 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:38,330 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 00:08:38,341 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 00:08:38,536 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 00:08:38,536 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 00:08:38,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:38,536 INFO L85 PathProgramCache]: Analyzing trace with hash 414610100, now seen corresponding path program 1 times [2022-12-06 00:08:38,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:38,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479701578] [2022-12-06 00:08:38,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:38,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:39,701 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 00:08:39,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:39,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479701578] [2022-12-06 00:08:39,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479701578] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:08:39,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677078874] [2022-12-06 00:08:39,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:39,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:08:39,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:08:39,703 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 00:08:39,706 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 00:08:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:39,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 00:08:39,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:08:39,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:08:39,995 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 00:08:40,035 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 00:08:40,050 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 00:08:40,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:08:40,100 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 00:08:40,110 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:08:40,111 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 00:08:40,113 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 00:08:40,194 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 00:08:40,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677078874] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:08:40,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:08:40,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2022-12-06 00:08:40,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307395303] [2022-12-06 00:08:40,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:08:40,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 00:08:40,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:40,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 00:08:40,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=170, Unknown=1, NotChecked=26, Total=240 [2022-12-06 00:08:40,196 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 40 [2022-12-06 00:08:40,196 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 00:08:40,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:40,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 40 [2022-12-06 00:08:40,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:45,575 INFO L130 PetriNetUnfolder]: 34422/45201 cut-off events. [2022-12-06 00:08:45,575 INFO L131 PetriNetUnfolder]: For 138636/138636 co-relation queries the response was YES. [2022-12-06 00:08:45,790 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 00:08:45,962 INFO L137 encePairwiseOnDemand]: 27/40 looper letters, 197 selfloop transitions, 85 changer transitions 6/293 dead transitions. [2022-12-06 00:08:45,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 293 transitions, 3011 flow [2022-12-06 00:08:45,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:08:45,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:08:45,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2022-12-06 00:08:45,964 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5107142857142857 [2022-12-06 00:08:45,964 INFO L175 Difference]: Start difference. First operand has 93 places, 186 transitions, 1748 flow. Second operand 7 states and 143 transitions. [2022-12-06 00:08:45,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 293 transitions, 3011 flow [2022-12-06 00:08:46,676 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 00:08:46,680 INFO L231 Difference]: Finished difference. Result has 100 places, 213 transitions, 2269 flow [2022-12-06 00:08:46,680 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 00:08:46,681 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 58 predicate places. [2022-12-06 00:08:46,681 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:46,681 INFO L89 Accepts]: Start accepts. Operand has 100 places, 213 transitions, 2269 flow [2022-12-06 00:08:46,683 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:46,683 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:46,683 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 213 transitions, 2269 flow [2022-12-06 00:08:46,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 213 transitions, 2269 flow [2022-12-06 00:08:46,803 INFO L130 PetriNetUnfolder]: 498/1635 cut-off events. [2022-12-06 00:08:46,803 INFO L131 PetriNetUnfolder]: For 5312/5352 co-relation queries the response was YES. [2022-12-06 00:08:46,811 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 00:08:46,960 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 213 transitions, 2269 flow [2022-12-06 00:08:46,960 INFO L188 LiptonReduction]: Number of co-enabled transitions 3970 [2022-12-06 00:08:46,983 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:08:46,984 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 303 [2022-12-06 00:08:46,984 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 213 transitions, 2269 flow [2022-12-06 00:08:46,985 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 00:08:46,985 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:46,985 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 00:08:46,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 00:08:47,191 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 00:08:47,191 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 00:08:47,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:47,192 INFO L85 PathProgramCache]: Analyzing trace with hash -923831064, now seen corresponding path program 2 times [2022-12-06 00:08:47,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:47,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479068427] [2022-12-06 00:08:47,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:47,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:48,442 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 00:08:48,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:48,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479068427] [2022-12-06 00:08:48,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479068427] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:08:48,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960681183] [2022-12-06 00:08:48,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 00:08:48,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:08:48,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:08:48,444 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 00:08:48,447 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 00:08:48,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 00:08:48,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:08:48,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 00:08:48,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:08:48,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:08:48,776 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 00:08:48,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:08:48,822 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 00:08:48,850 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 00:08:48,866 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 00:08:48,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:08:48,917 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 00:08:50,989 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:08:50,990 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 00:08:50,993 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 00:08:50,998 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 00:08:51,139 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 00:08:51,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960681183] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:08:51,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:08:51,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-06 00:08:51,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135433749] [2022-12-06 00:08:51,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:08:51,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 00:08:51,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:51,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 00:08:51,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=221, Unknown=3, NotChecked=30, Total=306 [2022-12-06 00:08:51,141 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 40 [2022-12-06 00:08:51,141 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 00:08:51,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:51,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 40 [2022-12-06 00:08:51,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:02,029 INFO L130 PetriNetUnfolder]: 48184/63237 cut-off events. [2022-12-06 00:09:02,029 INFO L131 PetriNetUnfolder]: For 245434/245494 co-relation queries the response was YES. [2022-12-06 00:09:02,473 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 00:09:03,012 INFO L137 encePairwiseOnDemand]: 27/40 looper letters, 247 selfloop transitions, 178 changer transitions 11/441 dead transitions. [2022-12-06 00:09:03,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 441 transitions, 4997 flow [2022-12-06 00:09:03,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 00:09:03,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 00:09:03,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 216 transitions. [2022-12-06 00:09:03,015 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.54 [2022-12-06 00:09:03,016 INFO L175 Difference]: Start difference. First operand has 100 places, 213 transitions, 2269 flow. Second operand 10 states and 216 transitions. [2022-12-06 00:09:03,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 441 transitions, 4997 flow [2022-12-06 00:09:05,676 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 00:09:05,683 INFO L231 Difference]: Finished difference. Result has 111 places, 298 transitions, 3885 flow [2022-12-06 00:09:05,683 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 00:09:05,685 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 69 predicate places. [2022-12-06 00:09:05,685 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:05,685 INFO L89 Accepts]: Start accepts. Operand has 111 places, 298 transitions, 3885 flow [2022-12-06 00:09:05,690 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:05,690 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:05,691 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 298 transitions, 3885 flow [2022-12-06 00:09:05,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 298 transitions, 3885 flow [2022-12-06 00:09:05,963 INFO L130 PetriNetUnfolder]: 732/2398 cut-off events. [2022-12-06 00:09:05,963 INFO L131 PetriNetUnfolder]: For 12766/12838 co-relation queries the response was YES. [2022-12-06 00:09:05,983 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 00:09:06,073 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 298 transitions, 3885 flow [2022-12-06 00:09:06,073 INFO L188 LiptonReduction]: Number of co-enabled transitions 5692 [2022-12-06 00:09:09,625 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:09,630 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3945 [2022-12-06 00:09:09,630 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 298 transitions, 3886 flow [2022-12-06 00:09:09,630 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 00:09:09,630 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:09,630 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 00:09:09,655 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 00:09:09,837 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 00:09:09,837 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 00:09:09,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:09,837 INFO L85 PathProgramCache]: Analyzing trace with hash -136415937, now seen corresponding path program 1 times [2022-12-06 00:09:09,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:09,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454139061] [2022-12-06 00:09:09,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:09,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:11,353 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 00:09:11,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:11,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454139061] [2022-12-06 00:09:11,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454139061] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:09:11,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393416339] [2022-12-06 00:09:11,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:11,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:09:11,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:09:11,355 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 00:09:11,357 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 00:09:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:11,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 00:09:11,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:09:11,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:09:11,744 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 00:09:11,892 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 00:09:11,961 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 00:09:11,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:09:12,289 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 00:09:12,290 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 00:09:12,295 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 00:09:12,497 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 00:09:12,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393416339] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:09:12,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:09:12,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-12-06 00:09:12,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376569496] [2022-12-06 00:09:12,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:09:12,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 00:09:12,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:12,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 00:09:12,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=464, Unknown=1, NotChecked=0, Total=552 [2022-12-06 00:09:12,501 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 41 [2022-12-06 00:09:12,501 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 00:09:12,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:12,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 41 [2022-12-06 00:09:12,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:51,198 INFO L130 PetriNetUnfolder]: 138755/183260 cut-off events. [2022-12-06 00:09:51,199 INFO L131 PetriNetUnfolder]: For 916757/916939 co-relation queries the response was YES. [2022-12-06 00:09:52,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 746586 conditions, 183260 events. 138755/183260 cut-off events. For 916757/916939 co-relation queries the response was YES. Maximal size of possible extension queue 9317. Compared 1284720 event pairs, 10076 based on Foata normal form. 555/158427 useless extension candidates. Maximal degree in co-relation 728674. Up to 35634 conditions per place. [2022-12-06 00:09:54,073 INFO L137 encePairwiseOnDemand]: 19/41 looper letters, 909 selfloop transitions, 950 changer transitions 61/1923 dead transitions. [2022-12-06 00:09:54,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 1923 transitions, 21320 flow [2022-12-06 00:09:54,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-12-06 00:09:54,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2022-12-06 00:09:54,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 1197 transitions. [2022-12-06 00:09:54,083 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2022-12-06 00:09:54,083 INFO L175 Difference]: Start difference. First operand has 111 places, 298 transitions, 3886 flow. Second operand 63 states and 1197 transitions. [2022-12-06 00:09:54,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 1923 transitions, 21320 flow [2022-12-06 00:10:20,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 1923 transitions, 20459 flow, removed 131 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:20,505 INFO L231 Difference]: Finished difference. Result has 198 places, 1113 transitions, 17178 flow [2022-12-06 00:10:20,506 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=63, PETRI_FLOW=17178, PETRI_PLACES=198, PETRI_TRANSITIONS=1113} [2022-12-06 00:10:20,506 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 156 predicate places. [2022-12-06 00:10:20,506 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:20,506 INFO L89 Accepts]: Start accepts. Operand has 198 places, 1113 transitions, 17178 flow [2022-12-06 00:10:20,512 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:20,512 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:20,512 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 198 places, 1113 transitions, 17178 flow [2022-12-06 00:10:20,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 1113 transitions, 17178 flow [2022-12-06 00:10:21,632 INFO L130 PetriNetUnfolder]: 2253/7424 cut-off events. [2022-12-06 00:10:21,633 INFO L131 PetriNetUnfolder]: For 53395/53714 co-relation queries the response was YES. [2022-12-06 00:10:21,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32657 conditions, 7424 events. 2253/7424 cut-off events. For 53395/53714 co-relation queries the response was YES. Maximal size of possible extension queue 599. Compared 84901 event pairs, 47 based on Foata normal form. 73/7336 useless extension candidates. Maximal degree in co-relation 32432. Up to 1283 conditions per place. [2022-12-06 00:10:21,928 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 1113 transitions, 17178 flow [2022-12-06 00:10:21,928 INFO L188 LiptonReduction]: Number of co-enabled transitions 21424 [2022-12-06 00:10:21,938 WARN L322 ript$VariableManager]: TermVariable LBE521 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:10:21,939 WARN L322 ript$VariableManager]: TermVariable LBE506 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:10:21,939 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:10:21,939 WARN L322 ript$VariableManager]: TermVariable LBE27 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:10:21,949 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 00:10:22,146 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 00:10:22,147 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 00:10:22,152 INFO L158 Benchmark]: Toolchain (without parser) took 150095.23ms. Allocated memory was 195.0MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 171.7MB in the beginning and 4.5GB in the end (delta: -4.3GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. [2022-12-06 00:10:22,152 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 195.0MB. Free memory was 171.5MB in the beginning and 171.4MB in the end (delta: 104.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 00:10:22,152 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.35ms. Allocated memory is still 195.0MB. Free memory was 171.5MB in the beginning and 155.8MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-12-06 00:10:22,160 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.77ms. Allocated memory is still 195.0MB. Free memory was 155.8MB in the beginning and 153.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 00:10:22,160 INFO L158 Benchmark]: Boogie Preprocessor took 53.68ms. Allocated memory is still 195.0MB. Free memory was 153.2MB in the beginning and 151.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:10:22,161 INFO L158 Benchmark]: RCFGBuilder took 802.29ms. Allocated memory is still 195.0MB. Free memory was 151.1MB in the beginning and 105.5MB in the end (delta: 45.6MB). Peak memory consumption was 45.1MB. Max. memory is 8.0GB. [2022-12-06 00:10:22,162 INFO L158 Benchmark]: TraceAbstraction took 148841.19ms. Allocated memory was 195.0MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 104.9MB in the beginning and 4.5GB in the end (delta: -4.4GB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. [2022-12-06 00:10:22,168 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.13ms. Allocated memory is still 195.0MB. Free memory was 171.5MB in the beginning and 171.4MB in the end (delta: 104.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 332.35ms. Allocated memory is still 195.0MB. Free memory was 171.5MB in the beginning and 155.8MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.77ms. Allocated memory is still 195.0MB. Free memory was 155.8MB in the beginning and 153.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.68ms. Allocated memory is still 195.0MB. Free memory was 153.2MB in the beginning and 151.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 802.29ms. Allocated memory is still 195.0MB. Free memory was 151.1MB in the beginning and 105.5MB in the end (delta: 45.6MB). Peak memory consumption was 45.1MB. Max. memory is 8.0GB. * TraceAbstraction took 148841.19ms. Allocated memory was 195.0MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 104.9MB in the beginning and 4.5GB in the end (delta: -4.4GB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.0s, 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: 66, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 60, dependent conditional: 0, dependent unconditional: 60, 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: 31, independent: 21, independent conditional: 10, independent unconditional: 11, dependent: 10, dependent conditional: 0, dependent unconditional: 10, 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.4s, 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: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, 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.2s, 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.5s, 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: 3.6s, 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 00:10:22,226 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...