/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 --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-prod-cons3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 03:10:13,186 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 03:10:13,188 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 03:10:13,217 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 03:10:13,218 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 03:10:13,219 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 03:10:13,220 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 03:10:13,221 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 03:10:13,222 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 03:10:13,223 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 03:10:13,224 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 03:10:13,225 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 03:10:13,225 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 03:10:13,226 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 03:10:13,227 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 03:10:13,228 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 03:10:13,229 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 03:10:13,229 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 03:10:13,231 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 03:10:13,232 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 03:10:13,234 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 03:10:13,237 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 03:10:13,238 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 03:10:13,239 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 03:10:13,242 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 03:10:13,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 03:10:13,243 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 03:10:13,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 03:10:13,244 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 03:10:13,245 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 03:10:13,245 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 03:10:13,246 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 03:10:13,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 03:10:13,247 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 03:10:13,248 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 03:10:13,248 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 03:10:13,249 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 03:10:13,249 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 03:10:13,250 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 03:10:13,251 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 03:10:13,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 03:10:13,264 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 03:10:13,304 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 03:10:13,304 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 03:10:13,306 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 03:10:13,306 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 03:10:13,306 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 03:10:13,306 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 03:10:13,306 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 03:10:13,306 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 03:10:13,306 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 03:10:13,307 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 03:10:13,307 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 03:10:13,307 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 03:10:13,307 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 03:10:13,307 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 03:10:13,307 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 03:10:13,307 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 03:10:13,307 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 03:10:13,308 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 03:10:13,308 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 03:10:13,308 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 03:10:13,308 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 03:10:13,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:10:13,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 03:10:13,309 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 03:10:13,309 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 03:10:13,309 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 03:10:13,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 03:10:13,309 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 03:10:13,309 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 03:10:13,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 03:10:13,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 03:10:13,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 03:10:13,660 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 03:10:13,663 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 03:10:13,665 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-prod-cons3.wvr.c [2022-12-06 03:10:14,823 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 03:10:15,040 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 03:10:15,041 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons3.wvr.c [2022-12-06 03:10:15,050 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/326288c05/741bb5a9ba95403384263a3add9c3d5d/FLAG4df09fe3a [2022-12-06 03:10:15,065 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/326288c05/741bb5a9ba95403384263a3add9c3d5d [2022-12-06 03:10:15,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 03:10:15,069 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 03:10:15,072 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 03:10:15,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 03:10:15,074 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 03:10:15,075 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:10:15" (1/1) ... [2022-12-06 03:10:15,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60e064b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:15, skipping insertion in model container [2022-12-06 03:10:15,076 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:10:15" (1/1) ... [2022-12-06 03:10:15,082 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 03:10:15,113 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 03:10:15,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:15,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:15,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:15,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:15,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:15,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:15,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:15,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:15,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:15,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:15,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:15,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:15,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:15,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:15,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:15,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:15,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:15,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:15,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:15,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:15,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:15,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:15,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:15,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:15,273 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-prod-cons3.wvr.c[4007,4020] [2022-12-06 03:10:15,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:10:15,288 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 03:10:15,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:15,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:15,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:15,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:15,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:15,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:15,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:15,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:15,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:15,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:15,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:15,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:15,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:15,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:15,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:15,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:15,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:15,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:15,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:15,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:15,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:15,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:15,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:15,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:15,325 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-prod-cons3.wvr.c[4007,4020] [2022-12-06 03:10:15,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:10:15,365 INFO L208 MainTranslator]: Completed translation [2022-12-06 03:10:15,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:15 WrapperNode [2022-12-06 03:10:15,366 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 03:10:15,367 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 03:10:15,368 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 03:10:15,368 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 03:10:15,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:15" (1/1) ... [2022-12-06 03:10:15,398 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:15" (1/1) ... [2022-12-06 03:10:15,436 INFO L138 Inliner]: procedures = 26, calls = 73, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 267 [2022-12-06 03:10:15,437 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 03:10:15,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 03:10:15,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 03:10:15,438 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 03:10:15,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:15" (1/1) ... [2022-12-06 03:10:15,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:15" (1/1) ... [2022-12-06 03:10:15,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:15" (1/1) ... [2022-12-06 03:10:15,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:15" (1/1) ... [2022-12-06 03:10:15,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:15" (1/1) ... [2022-12-06 03:10:15,470 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:15" (1/1) ... [2022-12-06 03:10:15,472 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:15" (1/1) ... [2022-12-06 03:10:15,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:15" (1/1) ... [2022-12-06 03:10:15,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 03:10:15,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 03:10:15,477 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 03:10:15,477 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 03:10:15,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:15" (1/1) ... [2022-12-06 03:10:15,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:10:15,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:10:15,516 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 03:10:15,542 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 03:10:15,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 03:10:15,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 03:10:15,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 03:10:15,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 03:10:15,562 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 03:10:15,562 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 03:10:15,563 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 03:10:15,563 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 03:10:15,564 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 03:10:15,564 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 03:10:15,564 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 03:10:15,564 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 03:10:15,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 03:10:15,564 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 03:10:15,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 03:10:15,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 03:10:15,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 03:10:15,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 03:10:15,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 03:10:15,567 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 03:10:15,732 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 03:10:15,734 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 03:10:16,130 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 03:10:16,218 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 03:10:16,218 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-06 03:10:16,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:10:16 BoogieIcfgContainer [2022-12-06 03:10:16,220 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 03:10:16,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 03:10:16,222 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 03:10:16,225 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 03:10:16,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 03:10:15" (1/3) ... [2022-12-06 03:10:16,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f6332c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:10:16, skipping insertion in model container [2022-12-06 03:10:16,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:15" (2/3) ... [2022-12-06 03:10:16,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f6332c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:10:16, skipping insertion in model container [2022-12-06 03:10:16,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:10:16" (3/3) ... [2022-12-06 03:10:16,228 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons3.wvr.c [2022-12-06 03:10:16,245 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 03:10:16,245 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 03:10:16,245 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 03:10:16,350 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-06 03:10:16,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 215 places, 220 transitions, 472 flow [2022-12-06 03:10:16,476 INFO L130 PetriNetUnfolder]: 18/216 cut-off events. [2022-12-06 03:10:16,476 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 03:10:16,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 216 events. 18/216 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 126 event pairs, 0 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 184. Up to 3 conditions per place. [2022-12-06 03:10:16,481 INFO L82 GeneralOperation]: Start removeDead. Operand has 215 places, 220 transitions, 472 flow [2022-12-06 03:10:16,487 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 199 places, 204 transitions, 432 flow [2022-12-06 03:10:16,488 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:10:16,504 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 199 places, 204 transitions, 432 flow [2022-12-06 03:10:16,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 204 transitions, 432 flow [2022-12-06 03:10:16,566 INFO L130 PetriNetUnfolder]: 18/204 cut-off events. [2022-12-06 03:10:16,566 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 03:10:16,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 204 events. 18/204 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 126 event pairs, 0 based on Foata normal form. 0/186 useless extension candidates. Maximal degree in co-relation 184. Up to 3 conditions per place. [2022-12-06 03:10:16,571 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 204 transitions, 432 flow [2022-12-06 03:10:16,571 INFO L188 LiptonReduction]: Number of co-enabled transitions 2284 [2022-12-06 03:10:25,535 INFO L203 LiptonReduction]: Total number of compositions: 168 [2022-12-06 03:10:25,548 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 03:10:25,553 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;@134f0aed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 03:10:25,553 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 03:10:25,561 INFO L130 PetriNetUnfolder]: 5/35 cut-off events. [2022-12-06 03:10:25,561 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 03:10:25,561 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:10:25,562 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] [2022-12-06 03:10:25,562 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 03:10:25,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:10:25,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1148675820, now seen corresponding path program 1 times [2022-12-06 03:10:25,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:10:25,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327188290] [2022-12-06 03:10:25,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:10:25,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:10:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:10:26,097 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 03:10:26,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:10:26,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327188290] [2022-12-06 03:10:26,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327188290] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:10:26,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:10:26,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 03:10:26,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727801108] [2022-12-06 03:10:26,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:10:26,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:10:26,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:10:26,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:10:26,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 03:10:26,137 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2022-12-06 03:10:26,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 03:10:26,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:10:26,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2022-12-06 03:10:26,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:10:26,502 INFO L130 PetriNetUnfolder]: 1835/2622 cut-off events. [2022-12-06 03:10:26,502 INFO L131 PetriNetUnfolder]: For 207/207 co-relation queries the response was YES. [2022-12-06 03:10:26,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5331 conditions, 2622 events. 1835/2622 cut-off events. For 207/207 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 11882 event pairs, 180 based on Foata normal form. 0/2182 useless extension candidates. Maximal degree in co-relation 4539. Up to 845 conditions per place. [2022-12-06 03:10:26,526 INFO L137 encePairwiseOnDemand]: 31/36 looper letters, 76 selfloop transitions, 5 changer transitions 0/83 dead transitions. [2022-12-06 03:10:26,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 83 transitions, 373 flow [2022-12-06 03:10:26,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:10:26,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:10:26,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2022-12-06 03:10:26,536 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2022-12-06 03:10:26,539 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2022-12-06 03:10:26,540 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:10:26,540 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 83 transitions, 373 flow [2022-12-06 03:10:26,554 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 83 transitions, 373 flow [2022-12-06 03:10:26,554 INFO L188 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-06 03:10:26,630 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:10:26,632 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-06 03:10:26,632 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 83 transitions, 373 flow [2022-12-06 03:10:26,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 03:10:26,632 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:10:26,632 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] [2022-12-06 03:10:26,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 03:10:26,633 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 03:10:26,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:10:26,633 INFO L85 PathProgramCache]: Analyzing trace with hash -400163974, now seen corresponding path program 2 times [2022-12-06 03:10:26,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:10:26,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296244859] [2022-12-06 03:10:26,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:10:26,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:10:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:10:26,835 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 03:10:26,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:10:26,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296244859] [2022-12-06 03:10:26,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296244859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:10:26,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:10:26,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 03:10:26,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287040630] [2022-12-06 03:10:26,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:10:26,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:10:26,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:10:26,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:10:26,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 03:10:26,839 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 37 [2022-12-06 03:10:26,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 83 transitions, 373 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 03:10:26,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:10:26,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 37 [2022-12-06 03:10:26,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:10:27,231 INFO L130 PetriNetUnfolder]: 2297/3276 cut-off events. [2022-12-06 03:10:27,231 INFO L131 PetriNetUnfolder]: For 415/415 co-relation queries the response was YES. [2022-12-06 03:10:27,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9764 conditions, 3276 events. 2297/3276 cut-off events. For 415/415 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 15594 event pairs, 188 based on Foata normal form. 0/2783 useless extension candidates. Maximal degree in co-relation 8246. Up to 1393 conditions per place. [2022-12-06 03:10:27,249 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 113 selfloop transitions, 9 changer transitions 0/124 dead transitions. [2022-12-06 03:10:27,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 124 transitions, 796 flow [2022-12-06 03:10:27,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:10:27,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:10:27,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-12-06 03:10:27,250 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4756756756756757 [2022-12-06 03:10:27,251 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places. [2022-12-06 03:10:27,252 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:10:27,252 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 124 transitions, 796 flow [2022-12-06 03:10:27,268 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 124 transitions, 796 flow [2022-12-06 03:10:27,268 INFO L188 LiptonReduction]: Number of co-enabled transitions 270 [2022-12-06 03:10:27,271 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:10:27,272 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 03:10:27,272 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 124 transitions, 796 flow [2022-12-06 03:10:27,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 03:10:27,272 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:10:27,273 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] [2022-12-06 03:10:27,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 03:10:27,273 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 03:10:27,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:10:27,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1037304448, now seen corresponding path program 3 times [2022-12-06 03:10:27,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:10:27,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530300911] [2022-12-06 03:10:27,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:10:27,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:10:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:10:27,594 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 03:10:27,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:10:27,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530300911] [2022-12-06 03:10:27,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530300911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:10:27,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:10:27,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 03:10:27,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620806517] [2022-12-06 03:10:27,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:10:27,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 03:10:27,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:10:27,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 03:10:27,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 03:10:27,597 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 03:10:27,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 124 transitions, 796 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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 03:10:27,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:10:27,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 03:10:27,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:10:28,358 INFO L130 PetriNetUnfolder]: 4673/6496 cut-off events. [2022-12-06 03:10:28,358 INFO L131 PetriNetUnfolder]: For 2186/2186 co-relation queries the response was YES. [2022-12-06 03:10:28,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24612 conditions, 6496 events. 4673/6496 cut-off events. For 2186/2186 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 29740 event pairs, 41 based on Foata normal form. 0/5830 useless extension candidates. Maximal degree in co-relation 20512. Up to 2807 conditions per place. [2022-12-06 03:10:28,395 INFO L137 encePairwiseOnDemand]: 29/37 looper letters, 141 selfloop transitions, 11 changer transitions 128/280 dead transitions. [2022-12-06 03:10:28,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 280 transitions, 2300 flow [2022-12-06 03:10:28,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 03:10:28,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 03:10:28,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 118 transitions. [2022-12-06 03:10:28,397 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39864864864864863 [2022-12-06 03:10:28,398 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 15 predicate places. [2022-12-06 03:10:28,398 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:10:28,399 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 280 transitions, 2300 flow [2022-12-06 03:10:28,431 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 280 transitions, 2300 flow [2022-12-06 03:10:28,431 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:10:28,435 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:10:28,436 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-06 03:10:28,436 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 280 transitions, 2300 flow [2022-12-06 03:10:28,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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 03:10:28,436 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:10:28,436 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 03:10:28,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 03:10:28,437 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 03:10:28,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:10:28,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1070654779, now seen corresponding path program 1 times [2022-12-06 03:10:28,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:10:28,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940890278] [2022-12-06 03:10:28,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:10:28,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:10:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:10:28,599 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 03:10:28,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:10:28,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940890278] [2022-12-06 03:10:28,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940890278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:10:28,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:10:28,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 03:10:28,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025183956] [2022-12-06 03:10:28,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:10:28,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 03:10:28,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:10:28,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 03:10:28,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 03:10:28,603 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2022-12-06 03:10:28,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 280 transitions, 2300 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:10:28,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:10:28,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2022-12-06 03:10:28,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:10:29,279 INFO L130 PetriNetUnfolder]: 4599/6458 cut-off events. [2022-12-06 03:10:29,279 INFO L131 PetriNetUnfolder]: For 3291/3291 co-relation queries the response was YES. [2022-12-06 03:10:29,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29487 conditions, 6458 events. 4599/6458 cut-off events. For 3291/3291 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 29068 event pairs, 33 based on Foata normal form. 104/5918 useless extension candidates. Maximal degree in co-relation 24624. Up to 3973 conditions per place. [2022-12-06 03:10:29,316 INFO L137 encePairwiseOnDemand]: 33/37 looper letters, 133 selfloop transitions, 3 changer transitions 146/303 dead transitions. [2022-12-06 03:10:29,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 303 transitions, 3051 flow [2022-12-06 03:10:29,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 03:10:29,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 03:10:29,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-12-06 03:10:29,318 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5585585585585585 [2022-12-06 03:10:29,319 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 16 predicate places. [2022-12-06 03:10:29,320 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:10:29,320 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 303 transitions, 3051 flow [2022-12-06 03:10:29,354 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 303 transitions, 3051 flow [2022-12-06 03:10:29,354 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:10:29,357 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:10:29,364 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-06 03:10:29,364 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 303 transitions, 3051 flow [2022-12-06 03:10:29,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:10:29,365 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:10:29,365 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, 1, 1] [2022-12-06 03:10:29,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 03:10:29,365 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 03:10:29,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:10:29,366 INFO L85 PathProgramCache]: Analyzing trace with hash 941679291, now seen corresponding path program 1 times [2022-12-06 03:10:29,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:10:29,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081173158] [2022-12-06 03:10:29,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:10:29,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:10:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:10:29,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:10:29,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:10:29,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081173158] [2022-12-06 03:10:29,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081173158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:10:29,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:10:29,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 03:10:29,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760084002] [2022-12-06 03:10:29,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:10:29,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:10:29,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:10:29,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:10:29,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 03:10:29,527 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2022-12-06 03:10:29,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 303 transitions, 3051 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 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 03:10:29,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:10:29,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2022-12-06 03:10:29,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:10:30,394 INFO L130 PetriNetUnfolder]: 5206/7407 cut-off events. [2022-12-06 03:10:30,394 INFO L131 PetriNetUnfolder]: For 6025/6025 co-relation queries the response was YES. [2022-12-06 03:10:30,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39854 conditions, 7407 events. 5206/7407 cut-off events. For 6025/6025 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 34516 event pairs, 66 based on Foata normal form. 124/6814 useless extension candidates. Maximal degree in co-relation 28688. Up to 4853 conditions per place. [2022-12-06 03:10:30,428 INFO L137 encePairwiseOnDemand]: 33/37 looper letters, 135 selfloop transitions, 2 changer transitions 244/402 dead transitions. [2022-12-06 03:10:30,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 402 transitions, 4833 flow [2022-12-06 03:10:30,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:10:30,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:10:30,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-12-06 03:10:30,431 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47297297297297297 [2022-12-06 03:10:30,433 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places. [2022-12-06 03:10:30,434 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:10:30,434 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 402 transitions, 4833 flow [2022-12-06 03:10:30,479 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 402 transitions, 4833 flow [2022-12-06 03:10:30,479 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:10:31,255 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:10:31,255 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 822 [2022-12-06 03:10:31,256 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 401 transitions, 4821 flow [2022-12-06 03:10:31,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 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 03:10:31,256 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:10:31,256 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, 1, 1] [2022-12-06 03:10:31,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 03:10:31,256 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 03:10:31,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:10:31,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1994079102, now seen corresponding path program 1 times [2022-12-06 03:10:31,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:10:31,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175923178] [2022-12-06 03:10:31,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:10:31,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:10:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:10:31,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:10:31,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:10:31,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175923178] [2022-12-06 03:10:31,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175923178] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:10:31,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:10:31,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 03:10:31,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553108058] [2022-12-06 03:10:31,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:10:31,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 03:10:31,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:10:31,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 03:10:31,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 03:10:31,488 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2022-12-06 03:10:31,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 401 transitions, 4821 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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 03:10:31,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:10:31,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2022-12-06 03:10:31,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:10:32,384 INFO L130 PetriNetUnfolder]: 4771/6951 cut-off events. [2022-12-06 03:10:32,384 INFO L131 PetriNetUnfolder]: For 8415/8415 co-relation queries the response was YES. [2022-12-06 03:10:32,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45180 conditions, 6951 events. 4771/6951 cut-off events. For 8415/8415 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 32756 event pairs, 66 based on Foata normal form. 248/6442 useless extension candidates. Maximal degree in co-relation 32922. Up to 4948 conditions per place. [2022-12-06 03:10:32,417 INFO L137 encePairwiseOnDemand]: 35/38 looper letters, 161 selfloop transitions, 5 changer transitions 394/578 dead transitions. [2022-12-06 03:10:32,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 578 transitions, 8167 flow [2022-12-06 03:10:32,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 03:10:32,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 03:10:32,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-12-06 03:10:32,418 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5526315789473685 [2022-12-06 03:10:32,421 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 20 predicate places. [2022-12-06 03:10:32,423 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:10:32,424 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 578 transitions, 8167 flow [2022-12-06 03:10:32,472 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 578 transitions, 8167 flow [2022-12-06 03:10:32,473 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:10:32,476 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:10:32,477 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-06 03:10:32,478 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 578 transitions, 8167 flow [2022-12-06 03:10:32,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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 03:10:32,478 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:10:32,478 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, 1, 1, 1, 1] [2022-12-06 03:10:32,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 03:10:32,478 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 03:10:32,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:10:32,479 INFO L85 PathProgramCache]: Analyzing trace with hash -357871025, now seen corresponding path program 1 times [2022-12-06 03:10:32,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:10:32,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425330062] [2022-12-06 03:10:32,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:10:32,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:10:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:10:32,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 03:10:32,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:10:32,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425330062] [2022-12-06 03:10:32,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425330062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:10:32,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:10:32,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 03:10:32,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528511752] [2022-12-06 03:10:32,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:10:32,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:10:32,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:10:32,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:10:32,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 03:10:32,668 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2022-12-06 03:10:32,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 578 transitions, 8167 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 03:10:32,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:10:32,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2022-12-06 03:10:32,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:10:33,897 INFO L130 PetriNetUnfolder]: 5362/7978 cut-off events. [2022-12-06 03:10:33,897 INFO L131 PetriNetUnfolder]: For 12663/12663 co-relation queries the response was YES. [2022-12-06 03:10:33,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58876 conditions, 7978 events. 5362/7978 cut-off events. For 12663/12663 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 40083 event pairs, 132 based on Foata normal form. 92/7218 useless extension candidates. Maximal degree in co-relation 37119. Up to 5884 conditions per place. [2022-12-06 03:10:33,930 INFO L137 encePairwiseOnDemand]: 33/38 looper letters, 165 selfloop transitions, 2 changer transitions 560/745 dead transitions. [2022-12-06 03:10:33,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 745 transitions, 12043 flow [2022-12-06 03:10:33,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:10:33,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:10:33,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-06 03:10:33,932 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2022-12-06 03:10:33,933 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 23 predicate places. [2022-12-06 03:10:33,934 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:10:33,934 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 745 transitions, 12043 flow [2022-12-06 03:10:33,984 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 745 transitions, 12043 flow [2022-12-06 03:10:33,985 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:10:41,359 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:10:41,360 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7427 [2022-12-06 03:10:41,360 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 744 transitions, 12027 flow [2022-12-06 03:10:41,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 03:10:41,360 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:10:41,361 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, 1, 1, 1, 1] [2022-12-06 03:10:41,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 03:10:41,361 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 03:10:41,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:10:41,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1769361624, now seen corresponding path program 1 times [2022-12-06 03:10:41,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:10:41,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291625902] [2022-12-06 03:10:41,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:10:41,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:10:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:10:42,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:10:42,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:10:42,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291625902] [2022-12-06 03:10:42,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291625902] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:10:42,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127834558] [2022-12-06 03:10:42,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:10:42,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:10:42,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:10:42,899 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 03:10:42,942 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 03:10:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:10:43,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 72 conjunts are in the unsatisfiable core [2022-12-06 03:10:43,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:10:43,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:10:43,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:10:43,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:10:43,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:10:43,194 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-12-06 03:10:43,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 47 [2022-12-06 03:10:43,217 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 03:10:43,292 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 03:10:43,301 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-06 03:10:43,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-12-06 03:10:43,387 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 03:10:43,539 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 03:10:43,671 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 03:10:43,732 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 03:10:44,081 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:10:44,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 32 [2022-12-06 03:10:44,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:10:44,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:10:45,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:10:45,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127834558] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:10:45,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:10:45,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 16] total 41 [2022-12-06 03:10:45,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072261993] [2022-12-06 03:10:45,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:10:45,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-06 03:10:45,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:10:45,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-06 03:10:45,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1507, Unknown=17, NotChecked=0, Total=1722 [2022-12-06 03:10:45,639 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 03:10:45,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 744 transitions, 12027 flow. Second operand has 42 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 41 states have internal predecessors, (86), 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 03:10:45,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:10:45,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 03:10:45,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:11:15,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:11:33,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:11:35,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:11:37,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:11:39,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:11:46,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:11:55,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 03:12:01,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 03:12:03,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 03:12:14,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:12:20,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 03:12:22,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 03:12:28,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 03:12:30,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 03:12:35,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:12:56,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 03:12:58,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 03:13:14,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 03:13:56,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 03:13:58,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 03:14:05,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 03:14:07,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 03:14:36,318 WARN L233 SmtUtils]: Spent 5.56s on a formula simplification. DAG size of input: 201 DAG size of output: 185 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:14:38,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 03:14:40,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 03:14:48,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:15:17,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 03:15:19,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 03:15:24,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 03:15:36,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:15:40,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 03:15:48,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:15:50,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:15:54,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 03:15:56,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 03:15:58,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 03:16:31,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 03:16:33,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 03:16:43,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:16:47,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 03:16:52,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:16:58,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 03:17:20,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:17:22,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:17:40,744 WARN L233 SmtUtils]: Spent 6.48s on a formula simplification. DAG size of input: 195 DAG size of output: 193 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:18:15,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 03:18:29,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:18:36,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:19:01,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:19:03,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:19:12,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:19:16,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:19:57,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:19:59,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:21:15,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:21:22,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:21:30,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:21:34,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:21:36,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:21:43,851 INFO L130 PetriNetUnfolder]: 58087/84588 cut-off events. [2022-12-06 03:21:43,851 INFO L131 PetriNetUnfolder]: For 115336/115336 co-relation queries the response was YES. [2022-12-06 03:21:44,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 686796 conditions, 84588 events. 58087/84588 cut-off events. For 115336/115336 co-relation queries the response was YES. Maximal size of possible extension queue 2784. Compared 595335 event pairs, 90 based on Foata normal form. 792/79183 useless extension candidates. Maximal degree in co-relation 485001. Up to 66183 conditions per place. [2022-12-06 03:21:44,328 INFO L137 encePairwiseOnDemand]: 14/40 looper letters, 1940 selfloop transitions, 1198 changer transitions 11085/14223 dead transitions. [2022-12-06 03:21:44,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 14223 transitions, 252052 flow [2022-12-06 03:21:44,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 406 states. [2022-12-06 03:21:44,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2022-12-06 03:21:44,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 3987 transitions. [2022-12-06 03:21:44,348 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24550492610837438 [2022-12-06 03:21:44,350 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 427 predicate places. [2022-12-06 03:21:44,351 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:21:44,351 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 471 places, 14223 transitions, 252052 flow [2022-12-06 03:21:45,801 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 471 places, 14223 transitions, 252052 flow [2022-12-06 03:21:45,801 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:21:45,832 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [888] L48-4-->thread1EXIT: Formula: (let ((.cse0 (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0)) (.cse2 (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) (.cse1 (< 0 |v_thread1Thread1of1ForFork0_~w~0#1_In_2|))) (or (and (= |v_thread1Thread1of1ForFork0_~cond~0#1_Out_4| v_~v_assert~0_In_7) .cse0 .cse1 (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_Out_4| 256) 0) .cse2) (and .cse0 (= |v_thread1Thread1of1ForFork0_~cond~0#1_In_1| |v_thread1Thread1of1ForFork0_~cond~0#1_Out_4|) .cse2 (not .cse1)))) InVars {~v_assert~0=v_~v_assert~0_In_7, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_In_2|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_In_1|} OutVars{~v_assert~0=v_~v_assert~0_In_7, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_In_2|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_Out_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] and [853] L140-3-->L141-3: Formula: (and (= |v_#pthreadsForks_61| (+ |v_#pthreadsForks_62| 1)) (= |v_ULTIMATE.start_main_#t~pre19#1_29| |v_#pthreadsForks_62|) (= |v_#memory_int_155| (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_21| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre19#1_29|)))) InVars {#pthreadsForks=|v_#pthreadsForks_62|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} OutVars{#pthreadsForks=|v_#pthreadsForks_61|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_29|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~pre19#1] [2022-12-06 03:21:46,830 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [764] L48-4-->L51: Formula: (and (< 0 |v_thread1Thread1of1ForFork0_~w~0#1_15|) (= v_~v_assert~0_37 |v_thread1Thread1of1ForFork0_~cond~0#1_15|)) InVars {~v_assert~0=v_~v_assert~0_37, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_15|} OutVars{~v_assert~0=v_~v_assert~0_37, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_15|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] and [853] L140-3-->L141-3: Formula: (and (= |v_#pthreadsForks_61| (+ |v_#pthreadsForks_62| 1)) (= |v_ULTIMATE.start_main_#t~pre19#1_29| |v_#pthreadsForks_62|) (= |v_#memory_int_155| (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_21| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre19#1_29|)))) InVars {#pthreadsForks=|v_#pthreadsForks_62|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} OutVars{#pthreadsForks=|v_#pthreadsForks_61|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_29|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~pre19#1] [2022-12-06 03:21:47,033 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [888] L48-4-->thread1EXIT: Formula: (let ((.cse0 (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0)) (.cse2 (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) (.cse1 (< 0 |v_thread1Thread1of1ForFork0_~w~0#1_In_2|))) (or (and (= |v_thread1Thread1of1ForFork0_~cond~0#1_Out_4| v_~v_assert~0_In_7) .cse0 .cse1 (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_Out_4| 256) 0) .cse2) (and .cse0 (= |v_thread1Thread1of1ForFork0_~cond~0#1_In_1| |v_thread1Thread1of1ForFork0_~cond~0#1_Out_4|) .cse2 (not .cse1)))) InVars {~v_assert~0=v_~v_assert~0_In_7, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_In_2|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_In_1|} OutVars{~v_assert~0=v_~v_assert~0_In_7, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_In_2|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_Out_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] and [853] L140-3-->L141-3: Formula: (and (= |v_#pthreadsForks_61| (+ |v_#pthreadsForks_62| 1)) (= |v_ULTIMATE.start_main_#t~pre19#1_29| |v_#pthreadsForks_62|) (= |v_#memory_int_155| (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_21| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre19#1_29|)))) InVars {#pthreadsForks=|v_#pthreadsForks_62|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} OutVars{#pthreadsForks=|v_#pthreadsForks_61|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_29|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~pre19#1] [2022-12-06 03:22:02,020 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [888] L48-4-->thread1EXIT: Formula: (let ((.cse0 (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0)) (.cse2 (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) (.cse1 (< 0 |v_thread1Thread1of1ForFork0_~w~0#1_In_2|))) (or (and (= |v_thread1Thread1of1ForFork0_~cond~0#1_Out_4| v_~v_assert~0_In_7) .cse0 .cse1 (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_Out_4| 256) 0) .cse2) (and .cse0 (= |v_thread1Thread1of1ForFork0_~cond~0#1_In_1| |v_thread1Thread1of1ForFork0_~cond~0#1_Out_4|) .cse2 (not .cse1)))) InVars {~v_assert~0=v_~v_assert~0_In_7, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_In_2|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_In_1|} OutVars{~v_assert~0=v_~v_assert~0_In_7, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_In_2|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_Out_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] and [853] L140-3-->L141-3: Formula: (and (= |v_#pthreadsForks_61| (+ |v_#pthreadsForks_62| 1)) (= |v_ULTIMATE.start_main_#t~pre19#1_29| |v_#pthreadsForks_62|) (= |v_#memory_int_155| (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_21| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre19#1_29|)))) InVars {#pthreadsForks=|v_#pthreadsForks_62|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} OutVars{#pthreadsForks=|v_#pthreadsForks_61|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_29|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~pre19#1] [2022-12-06 03:22:06,064 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [764] L48-4-->L51: Formula: (and (< 0 |v_thread1Thread1of1ForFork0_~w~0#1_15|) (= v_~v_assert~0_37 |v_thread1Thread1of1ForFork0_~cond~0#1_15|)) InVars {~v_assert~0=v_~v_assert~0_37, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_15|} OutVars{~v_assert~0=v_~v_assert~0_37, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_15|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] and [853] L140-3-->L141-3: Formula: (and (= |v_#pthreadsForks_61| (+ |v_#pthreadsForks_62| 1)) (= |v_ULTIMATE.start_main_#t~pre19#1_29| |v_#pthreadsForks_62|) (= |v_#memory_int_155| (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_21| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre19#1_29|)))) InVars {#pthreadsForks=|v_#pthreadsForks_62|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} OutVars{#pthreadsForks=|v_#pthreadsForks_61|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_29|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~pre19#1] [2022-12-06 03:22:32,634 INFO L203 LiptonReduction]: Total number of compositions: 9 [2022-12-06 03:22:32,635 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48285 [2022-12-06 03:22:32,635 INFO L495 AbstractCegarLoop]: Abstraction has has 462 places, 14214 transitions, 251900 flow [2022-12-06 03:22:32,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 41 states have internal predecessors, (86), 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 03:22:32,635 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:22:32,635 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, 1, 1] [2022-12-06 03:22:32,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 03:22:32,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:22:32,843 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 03:22:32,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:22:32,843 INFO L85 PathProgramCache]: Analyzing trace with hash 815705413, now seen corresponding path program 1 times [2022-12-06 03:22:32,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:22:32,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992519529] [2022-12-06 03:22:32,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:22:32,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:22:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:22:36,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:22:36,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:22:36,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992519529] [2022-12-06 03:22:36,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992519529] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:22:36,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450569304] [2022-12-06 03:22:36,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:22:36,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:22:36,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:22:36,044 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 03:22:36,051 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 03:22:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:22:36,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 67 conjunts are in the unsatisfiable core [2022-12-06 03:22:36,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:22:36,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:22:36,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:22:36,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:22:36,302 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 03:22:36,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2022-12-06 03:22:36,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-12-06 03:22:36,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:22:36,331 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 22 treesize of output 20 [2022-12-06 03:22:36,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 03:22:37,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 03:22:38,686 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 03:22:38,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 46 [2022-12-06 03:22:38,708 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 29 treesize of output 17 [2022-12-06 03:22:38,940 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 03:22:39,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:22:39,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:22:41,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:22:41,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450569304] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:22:41,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:22:41,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 36 [2022-12-06 03:22:41,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058053685] [2022-12-06 03:22:41,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:22:41,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-06 03:22:41,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:22:41,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-06 03:22:41,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1172, Unknown=6, NotChecked=0, Total=1332 [2022-12-06 03:22:41,874 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 03:22:41,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 14214 transitions, 251900 flow. Second operand has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 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 03:22:41,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:22:41,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 03:22:41,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:23:13,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2022-12-06 03:23:49,760 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 03:23:49,760 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 03:23:49,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-12-06 03:23:49,768 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 03:23:49,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 03:23:49,968 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,SelfDestructingSolverStorable8 [2022-12-06 03:23:49,969 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (37states, 0/52 universal loopers) in iteration 9,while PetriNetUnfolder was constructing finite prefix that currently has 84791 conditions, 8511 events (5297/8510 cut-off events. For 3930/3930 co-relation queries the response was YES. Maximal size of possible extension queue 1112. Compared 62561 event pairs, 46 based on Foata normal form. 0/8693 useless extension candidates. Maximal degree in co-relation 42459. Up to 7628 conditions per place.). [2022-12-06 03:23:49,970 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-06 03:23:49,970 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 03:23:49,970 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 03:23:49,970 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-06 03:23:49,971 INFO L458 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2022-12-06 03:23:49,973 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 03:23:49,973 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 03:23:49,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 03:23:49 BasicIcfg [2022-12-06 03:23:49,974 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 03:23:49,975 INFO L158 Benchmark]: Toolchain (without parser) took 814905.89ms. Allocated memory was 206.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 182.1MB in the beginning and 184.9MB in the end (delta: -2.7MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-12-06 03:23:49,975 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 206.6MB. Free memory is still 183.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 03:23:49,975 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.50ms. Allocated memory is still 206.6MB. Free memory was 181.9MB in the beginning and 166.7MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-12-06 03:23:49,975 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.46ms. Allocated memory is still 206.6MB. Free memory was 166.7MB in the beginning and 164.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 03:23:49,976 INFO L158 Benchmark]: Boogie Preprocessor took 38.35ms. Allocated memory is still 206.6MB. Free memory was 164.6MB in the beginning and 162.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 03:23:49,976 INFO L158 Benchmark]: RCFGBuilder took 744.06ms. Allocated memory is still 206.6MB. Free memory was 162.5MB in the beginning and 131.6MB in the end (delta: 30.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-06 03:23:49,976 INFO L158 Benchmark]: TraceAbstraction took 813752.20ms. Allocated memory was 206.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 130.5MB in the beginning and 184.9MB in the end (delta: -54.3MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-12-06 03:23:49,977 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 206.6MB. Free memory is still 183.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 294.50ms. Allocated memory is still 206.6MB. Free memory was 181.9MB in the beginning and 166.7MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 69.46ms. Allocated memory is still 206.6MB. Free memory was 166.7MB in the beginning and 164.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.35ms. Allocated memory is still 206.6MB. Free memory was 164.6MB in the beginning and 162.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 744.06ms. Allocated memory is still 206.6MB. Free memory was 162.5MB in the beginning and 131.6MB in the end (delta: 30.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 813752.20ms. Allocated memory was 206.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 130.5MB in the beginning and 184.9MB in the end (delta: -54.3MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.0s, 199 PlacesBefore, 44 PlacesAfterwards, 204 TransitionsBefore, 36 TransitionsAfterwards, 2284 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 120 TrivialYvCompositions, 35 ConcurrentYvCompositions, 12 ChoiceCompositions, 168 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1411, independent: 1374, independent conditional: 1374, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1411, independent: 1374, independent conditional: 0, independent unconditional: 1374, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1411, independent: 1374, independent conditional: 0, independent unconditional: 1374, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1411, independent: 1374, independent conditional: 0, independent unconditional: 1374, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1204, independent: 1186, independent conditional: 0, independent unconditional: 1186, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1204, independent: 1186, independent conditional: 0, independent unconditional: 1186, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 51, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1411, independent: 188, independent conditional: 0, independent unconditional: 188, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 1204, unknown conditional: 0, unknown unconditional: 1204] , Statistics on independence cache: Total cache size (in pairs): 1818, Positive cache size: 1800, Positive conditional cache size: 0, Positive unconditional cache size: 1800, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 48 PlacesBefore, 48 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 172 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 124 TransitionsBefore, 124 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 280 TransitionsBefore, 280 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 303 TransitionsBefore, 303 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 63 PlacesBefore, 62 PlacesAfterwards, 402 TransitionsBefore, 401 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 64 PlacesBefore, 64 PlacesAfterwards, 578 TransitionsBefore, 578 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.4s, 67 PlacesBefore, 66 PlacesAfterwards, 745 TransitionsBefore, 744 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 46.8s, 471 PlacesBefore, 462 PlacesAfterwards, 14223 TransitionsBefore, 14214 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 9 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 150]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (37states, 0/52 universal loopers) in iteration 9,while PetriNetUnfolder was constructing finite prefix that currently has 84791 conditions, 8511 events (5297/8510 cut-off events. For 3930/3930 co-relation queries the response was YES. Maximal size of possible extension queue 1112. Compared 62561 event pairs, 46 based on Foata normal form. 0/8693 useless extension candidates. Maximal degree in co-relation 42459. Up to 7628 conditions per place.). - TimeoutResultAtElement [Line: 142]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (37states, 0/52 universal loopers) in iteration 9,while PetriNetUnfolder was constructing finite prefix that currently has 84791 conditions, 8511 events (5297/8510 cut-off events. For 3930/3930 co-relation queries the response was YES. Maximal size of possible extension queue 1112. Compared 62561 event pairs, 46 based on Foata normal form. 0/8693 useless extension candidates. Maximal degree in co-relation 42459. Up to 7628 conditions per place.). - TimeoutResultAtElement [Line: 141]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (37states, 0/52 universal loopers) in iteration 9,while PetriNetUnfolder was constructing finite prefix that currently has 84791 conditions, 8511 events (5297/8510 cut-off events. For 3930/3930 co-relation queries the response was YES. Maximal size of possible extension queue 1112. Compared 62561 event pairs, 46 based on Foata normal form. 0/8693 useless extension candidates. Maximal degree in co-relation 42459. Up to 7628 conditions per place.). - TimeoutResultAtElement [Line: 143]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (37states, 0/52 universal loopers) in iteration 9,while PetriNetUnfolder was constructing finite prefix that currently has 84791 conditions, 8511 events (5297/8510 cut-off events. For 3930/3930 co-relation queries the response was YES. Maximal size of possible extension queue 1112. Compared 62561 event pairs, 46 based on Foata normal form. 0/8693 useless extension candidates. Maximal degree in co-relation 42459. Up to 7628 conditions per place.). - TimeoutResultAtElement [Line: 140]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (37states, 0/52 universal loopers) in iteration 9,while PetriNetUnfolder was constructing finite prefix that currently has 84791 conditions, 8511 events (5297/8510 cut-off events. For 3930/3930 co-relation queries the response was YES. Maximal size of possible extension queue 1112. Compared 62561 event pairs, 46 based on Foata normal form. 0/8693 useless extension candidates. Maximal degree in co-relation 42459. Up to 7628 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 241 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 813.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 732.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.2s, HoareTripleCheckerStatistics: 2792 mSolverCounterUnknown, 5474 SdHoareTripleChecker+Valid, 240.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5474 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 235.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 756 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28692 IncrementalHoareTripleChecker+Invalid, 32240 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 756 mSolverCounterUnsat, 0 mSDtfsCounter, 28692 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 2792 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 641 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 555 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77137 ImplicationChecksByTransitivity, 452.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=252052occurred in iteration=8, InterpolantAutomatonStates: 438, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 14.1s InterpolantComputationTime, 337 NumberOfCodeBlocks, 337 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 390 ConstructedInterpolants, 38 QuantifiedInterpolants, 6873 SizeOfPredicates, 71 NumberOfNonLiveVariables, 704 ConjunctsInSsa, 139 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 17/26 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown