/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-bad-dot-product.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 02:27:57,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 02:27:57,424 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 02:27:57,474 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 02:27:57,475 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 02:27:57,476 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 02:27:57,477 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 02:27:57,478 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 02:27:57,480 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 02:27:57,480 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 02:27:57,481 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 02:27:57,482 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 02:27:57,482 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 02:27:57,483 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 02:27:57,484 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 02:27:57,485 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 02:27:57,486 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 02:27:57,486 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 02:27:57,488 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 02:27:57,489 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 02:27:57,491 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 02:27:57,492 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 02:27:57,493 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 02:27:57,494 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 02:27:57,497 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 02:27:57,497 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 02:27:57,497 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 02:27:57,498 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 02:27:57,499 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 02:27:57,499 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 02:27:57,500 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 02:27:57,500 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 02:27:57,501 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 02:27:57,502 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 02:27:57,503 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 02:27:57,503 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 02:27:57,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 02:27:57,504 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 02:27:57,504 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 02:27:57,504 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 02:27:57,505 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 02:27:57,506 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 02:27:57,527 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 02:27:57,527 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 02:27:57,529 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 02:27:57,529 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 02:27:57,529 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 02:27:57,529 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 02:27:57,529 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 02:27:57,529 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 02:27:57,530 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 02:27:57,530 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 02:27:57,530 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 02:27:57,530 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 02:27:57,530 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 02:27:57,530 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 02:27:57,530 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 02:27:57,531 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 02:27:57,531 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 02:27:57,531 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 02:27:57,531 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 02:27:57,531 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 02:27:57,531 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 02:27:57,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:27:57,532 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 02:27:57,532 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 02:27:57,532 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 02:27:57,532 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 02:27:57,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 02:27:57,532 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 02:27:57,533 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 02:27:57,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 02:27:57,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 02:27:57,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 02:27:57,877 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 02:27:57,877 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 02:27:57,878 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-dot-product.wvr.c [2022-12-06 02:27:59,016 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 02:27:59,209 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 02:27:59,210 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product.wvr.c [2022-12-06 02:27:59,219 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2dc6a362/4df204d8ef374028ae3baa709b7c38cf/FLAGfc0fbed2b [2022-12-06 02:27:59,236 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2dc6a362/4df204d8ef374028ae3baa709b7c38cf [2022-12-06 02:27:59,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 02:27:59,239 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 02:27:59,242 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 02:27:59,242 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 02:27:59,245 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 02:27:59,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:27:59" (1/1) ... [2022-12-06 02:27:59,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ebee20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:59, skipping insertion in model container [2022-12-06 02:27:59,247 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:27:59" (1/1) ... [2022-12-06 02:27:59,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 02:27:59,278 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 02:27:59,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:27:59,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:27:59,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:27:59,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:27:59,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:27:59,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:27:59,477 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product.wvr.c[2865,2878] [2022-12-06 02:27:59,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:27:59,500 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 02:27:59,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:27:59,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:27:59,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:27:59,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:27:59,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:27:59,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:27:59,542 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product.wvr.c[2865,2878] [2022-12-06 02:27:59,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:27:59,558 INFO L208 MainTranslator]: Completed translation [2022-12-06 02:27:59,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:59 WrapperNode [2022-12-06 02:27:59,560 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 02:27:59,561 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 02:27:59,561 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 02:27:59,561 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 02:27:59,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:59" (1/1) ... [2022-12-06 02:27:59,585 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:59" (1/1) ... [2022-12-06 02:27:59,625 INFO L138 Inliner]: procedures = 26, calls = 55, calls flagged for inlining = 16, calls inlined = 22, statements flattened = 275 [2022-12-06 02:27:59,626 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 02:27:59,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 02:27:59,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 02:27:59,626 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 02:27:59,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:59" (1/1) ... [2022-12-06 02:27:59,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:59" (1/1) ... [2022-12-06 02:27:59,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:59" (1/1) ... [2022-12-06 02:27:59,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:59" (1/1) ... [2022-12-06 02:27:59,657 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:59" (1/1) ... [2022-12-06 02:27:59,661 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:59" (1/1) ... [2022-12-06 02:27:59,662 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:59" (1/1) ... [2022-12-06 02:27:59,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:59" (1/1) ... [2022-12-06 02:27:59,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 02:27:59,668 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 02:27:59,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 02:27:59,668 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 02:27:59,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:59" (1/1) ... [2022-12-06 02:27:59,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:27:59,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:27:59,708 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 02:27:59,725 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 02:27:59,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 02:27:59,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 02:27:59,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 02:27:59,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 02:27:59,748 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 02:27:59,748 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 02:27:59,748 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 02:27:59,749 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 02:27:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 02:27:59,749 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 02:27:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 02:27:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 02:27:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 02:27:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 02:27:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 02:27:59,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 02:27:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 02:27:59,752 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 02:27:59,844 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 02:27:59,846 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 02:28:00,256 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 02:28:00,399 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 02:28:00,399 INFO L302 CfgBuilder]: Removed 8 assume(true) statements. [2022-12-06 02:28:00,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:28:00 BoogieIcfgContainer [2022-12-06 02:28:00,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 02:28:00,406 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 02:28:00,408 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 02:28:00,410 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 02:28:00,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 02:27:59" (1/3) ... [2022-12-06 02:28:00,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a14f03c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:28:00, skipping insertion in model container [2022-12-06 02:28:00,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:59" (2/3) ... [2022-12-06 02:28:00,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a14f03c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:28:00, skipping insertion in model container [2022-12-06 02:28:00,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:28:00" (3/3) ... [2022-12-06 02:28:00,413 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-dot-product.wvr.c [2022-12-06 02:28:00,430 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 02:28:00,430 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 02:28:00,430 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 02:28:00,535 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 02:28:00,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 219 places, 234 transitions, 492 flow [2022-12-06 02:28:00,691 INFO L130 PetriNetUnfolder]: 25/231 cut-off events. [2022-12-06 02:28:00,691 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 02:28:00,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 231 events. 25/231 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 297 event pairs, 0 based on Foata normal form. 0/205 useless extension candidates. Maximal degree in co-relation 177. Up to 2 conditions per place. [2022-12-06 02:28:00,699 INFO L82 GeneralOperation]: Start removeDead. Operand has 219 places, 234 transitions, 492 flow [2022-12-06 02:28:00,706 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 206 places, 221 transitions, 460 flow [2022-12-06 02:28:00,707 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:00,725 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 206 places, 221 transitions, 460 flow [2022-12-06 02:28:00,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 206 places, 221 transitions, 460 flow [2022-12-06 02:28:00,798 INFO L130 PetriNetUnfolder]: 25/221 cut-off events. [2022-12-06 02:28:00,798 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 02:28:00,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 221 events. 25/221 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 296 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 177. Up to 2 conditions per place. [2022-12-06 02:28:00,805 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 206 places, 221 transitions, 460 flow [2022-12-06 02:28:00,805 INFO L188 LiptonReduction]: Number of co-enabled transitions 6720 [2022-12-06 02:28:09,622 INFO L203 LiptonReduction]: Total number of compositions: 188 [2022-12-06 02:28:09,635 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 02:28:09,641 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;@6490b371, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 02:28:09,641 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 02:28:09,648 INFO L130 PetriNetUnfolder]: 8/33 cut-off events. [2022-12-06 02:28:09,648 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 02:28:09,648 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:09,649 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] [2022-12-06 02:28:09,649 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:28:09,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:09,654 INFO L85 PathProgramCache]: Analyzing trace with hash 419614350, now seen corresponding path program 1 times [2022-12-06 02:28:09,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:09,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861064383] [2022-12-06 02:28:09,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:09,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:10,201 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 02:28:10,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:10,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861064383] [2022-12-06 02:28:10,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861064383] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:28:10,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:28:10,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:28:10,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996626013] [2022-12-06 02:28:10,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:28:10,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:28:10,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:10,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:28:10,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:28:10,233 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2022-12-06 02:28:10,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 02:28:10,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:10,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2022-12-06 02:28:10,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:10,475 INFO L130 PetriNetUnfolder]: 961/1269 cut-off events. [2022-12-06 02:28:10,476 INFO L131 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2022-12-06 02:28:10,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2614 conditions, 1269 events. 961/1269 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4445 event pairs, 307 based on Foata normal form. 0/873 useless extension candidates. Maximal degree in co-relation 2225. Up to 742 conditions per place. [2022-12-06 02:28:10,488 INFO L137 encePairwiseOnDemand]: 29/34 looper letters, 42 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2022-12-06 02:28:10,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 214 flow [2022-12-06 02:28:10,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:28:10,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:28:10,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-06 02:28:10,499 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4338235294117647 [2022-12-06 02:28:10,503 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2022-12-06 02:28:10,505 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:10,505 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 49 transitions, 214 flow [2022-12-06 02:28:10,513 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 49 transitions, 214 flow [2022-12-06 02:28:10,514 INFO L188 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-06 02:28:10,722 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:28:10,723 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 220 [2022-12-06 02:28:10,724 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 48 transitions, 212 flow [2022-12-06 02:28:10,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 02:28:10,724 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:10,724 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] [2022-12-06 02:28:10,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 02:28:10,725 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:28:10,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:10,725 INFO L85 PathProgramCache]: Analyzing trace with hash -552178727, now seen corresponding path program 1 times [2022-12-06 02:28:10,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:10,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544328088] [2022-12-06 02:28:10,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:10,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:10,918 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 02:28:10,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:10,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544328088] [2022-12-06 02:28:10,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544328088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:28:10,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:28:10,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:28:10,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957448946] [2022-12-06 02:28:10,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:28:10,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:28:10,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:10,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:28:10,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:28:10,921 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2022-12-06 02:28:10,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 48 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 02:28:10,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:10,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2022-12-06 02:28:10,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:11,159 INFO L130 PetriNetUnfolder]: 962/1269 cut-off events. [2022-12-06 02:28:11,160 INFO L131 PetriNetUnfolder]: For 87/95 co-relation queries the response was YES. [2022-12-06 02:28:11,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3883 conditions, 1269 events. 962/1269 cut-off events. For 87/95 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4341 event pairs, 209 based on Foata normal form. 0/808 useless extension candidates. Maximal degree in co-relation 3306. Up to 1053 conditions per place. [2022-12-06 02:28:11,167 INFO L137 encePairwiseOnDemand]: 29/34 looper letters, 58 selfloop transitions, 3 changer transitions 2/65 dead transitions. [2022-12-06 02:28:11,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 65 transitions, 412 flow [2022-12-06 02:28:11,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:28:11,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:28:11,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-12-06 02:28:11,169 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35294117647058826 [2022-12-06 02:28:11,170 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2022-12-06 02:28:11,170 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:11,171 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 65 transitions, 412 flow [2022-12-06 02:28:11,176 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 65 transitions, 412 flow [2022-12-06 02:28:11,176 INFO L188 LiptonReduction]: Number of co-enabled transitions 116 [2022-12-06 02:28:14,032 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:28:14,033 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2863 [2022-12-06 02:28:14,033 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 64 transitions, 406 flow [2022-12-06 02:28:14,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 02:28:14,034 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:14,034 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] [2022-12-06 02:28:14,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 02:28:14,034 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:28:14,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:14,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1078118500, now seen corresponding path program 1 times [2022-12-06 02:28:14,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:14,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158209896] [2022-12-06 02:28:14,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:14,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:14,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:28:14,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:14,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158209896] [2022-12-06 02:28:14,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158209896] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:28:14,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:28:14,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:28:14,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775181648] [2022-12-06 02:28:14,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:28:14,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:28:14,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:14,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:28:14,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:28:14,168 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 35 [2022-12-06 02:28:14,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 64 transitions, 406 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 02:28:14,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:14,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 35 [2022-12-06 02:28:14,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:14,455 INFO L130 PetriNetUnfolder]: 1413/1869 cut-off events. [2022-12-06 02:28:14,456 INFO L131 PetriNetUnfolder]: For 286/288 co-relation queries the response was YES. [2022-12-06 02:28:14,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7431 conditions, 1869 events. 1413/1869 cut-off events. For 286/288 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6580 event pairs, 167 based on Foata normal form. 2/1253 useless extension candidates. Maximal degree in co-relation 6678. Up to 1527 conditions per place. [2022-12-06 02:28:14,471 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 91 selfloop transitions, 7 changer transitions 2/102 dead transitions. [2022-12-06 02:28:14,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 102 transitions, 840 flow [2022-12-06 02:28:14,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:28:14,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:28:14,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-12-06 02:28:14,475 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37142857142857144 [2022-12-06 02:28:14,476 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2022-12-06 02:28:14,477 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:14,477 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 102 transitions, 840 flow [2022-12-06 02:28:14,491 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 102 transitions, 840 flow [2022-12-06 02:28:14,491 INFO L188 LiptonReduction]: Number of co-enabled transitions 112 [2022-12-06 02:28:17,594 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:28:17,596 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3120 [2022-12-06 02:28:17,596 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 101 transitions, 832 flow [2022-12-06 02:28:17,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 02:28:17,596 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:17,596 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] [2022-12-06 02:28:17,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 02:28:17,597 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:28:17,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:17,597 INFO L85 PathProgramCache]: Analyzing trace with hash -708540724, now seen corresponding path program 1 times [2022-12-06 02:28:17,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:17,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429715660] [2022-12-06 02:28:17,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:17,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:17,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:28:17,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:17,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429715660] [2022-12-06 02:28:17,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429715660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:28:17,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:28:17,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 02:28:17,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591251731] [2022-12-06 02:28:17,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:28:17,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:28:17,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:17,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:28:17,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:28:17,730 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 36 [2022-12-06 02:28:17,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 101 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 02:28:17,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:17,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 36 [2022-12-06 02:28:17,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:17,896 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L62-5-->L64-8: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|) (= |v_thread2Thread1of1ForFork2_~j~1#1_Out_14| 0) (< |v_thread2Thread1of1ForFork2_~i~1#1_In_3| v_~M~0_In_3) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14| 0)) (= (ite (< (select (select |v_#memory_int_In_28| v_~A~0.base_In_6) (+ v_~A~0.offset_In_6 (* |v_thread2Thread1of1ForFork2_~i~1#1_In_3| 4))) v_~size~0_In_6) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|)) InVars {~A~0.base=v_~A~0.base_In_6, ~A~0.offset=v_~A~0.offset_In_6, ~size~0=v_~size~0_In_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, ~M~0=v_~M~0_In_3, #memory_int=|v_#memory_int_In_28|} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_Out_8|, ~A~0.base=v_~A~0.base_In_6, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14|, ~A~0.offset=v_~A~0.offset_In_6, ~size~0=v_~size~0_In_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, ~M~0=v_~M~0_In_3, #memory_int=|v_#memory_int_In_28|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|, thread2Thread1of1ForFork2_~j~1#1=|v_thread2Thread1of1ForFork2_~j~1#1_Out_14|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~1#1][42], [225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 235#(and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 15#L102-1true, thread3Thread1of1ForFork0InUse, 135#L64-8true, thread2Thread1of1ForFork2InUse, 117#L49-5true, 238#(= ~res2~0 ~res1~0), 226#true, 184#L75-5true, thread1Thread1of1ForFork1InUse]) [2022-12-06 02:28:17,897 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 02:28:17,897 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 02:28:17,897 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 02:28:17,897 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 02:28:17,897 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1045] L62-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_4| 0) (not (< |v_thread2Thread1of1ForFork2_~i~1#1_In_5| v_~M~0_In_5))) InVars {~M~0=v_~M~0_In_5, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_5|} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_4|, ~M~0=v_~M~0_In_5, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_5|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][43], [225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 235#(and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 15#L102-1true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 117#L49-5true, 238#(= ~res2~0 ~res1~0), 184#L75-5true, thread1Thread1of1ForFork1InUse, 105#thread2EXITtrue, 226#true]) [2022-12-06 02:28:17,898 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 02:28:17,898 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 02:28:17,898 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 02:28:17,898 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 02:28:18,165 INFO L130 PetriNetUnfolder]: 2814/3704 cut-off events. [2022-12-06 02:28:18,165 INFO L131 PetriNetUnfolder]: For 1715/1742 co-relation queries the response was YES. [2022-12-06 02:28:18,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18231 conditions, 3704 events. 2814/3704 cut-off events. For 1715/1742 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 14873 event pairs, 188 based on Foata normal form. 13/2485 useless extension candidates. Maximal degree in co-relation 16449. Up to 3029 conditions per place. [2022-12-06 02:28:18,198 INFO L137 encePairwiseOnDemand]: 28/36 looper letters, 165 selfloop transitions, 16 changer transitions 5/189 dead transitions. [2022-12-06 02:28:18,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 189 transitions, 1941 flow [2022-12-06 02:28:18,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:28:18,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:28:18,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-06 02:28:18,201 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6203703703703703 [2022-12-06 02:28:18,203 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2022-12-06 02:28:18,203 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:18,206 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 189 transitions, 1941 flow [2022-12-06 02:28:18,231 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 189 transitions, 1941 flow [2022-12-06 02:28:18,236 INFO L188 LiptonReduction]: Number of co-enabled transitions 218 [2022-12-06 02:28:18,238 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:18,244 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-06 02:28:18,244 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 189 transitions, 1941 flow [2022-12-06 02:28:18,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 02:28:18,245 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:18,245 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] [2022-12-06 02:28:18,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 02:28:18,245 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:28:18,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:18,246 INFO L85 PathProgramCache]: Analyzing trace with hash 833194989, now seen corresponding path program 1 times [2022-12-06 02:28:18,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:18,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314523757] [2022-12-06 02:28:18,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:18,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:28:18,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:18,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314523757] [2022-12-06 02:28:18,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314523757] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:28:18,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:28:18,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:28:18,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551105137] [2022-12-06 02:28:18,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:28:18,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:28:18,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:18,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:28:18,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:28:18,424 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2022-12-06 02:28:18,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 189 transitions, 1941 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 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 02:28:18,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:18,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2022-12-06 02:28:18,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:18,731 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L62-5-->L64-8: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|) (= |v_thread2Thread1of1ForFork2_~j~1#1_Out_14| 0) (< |v_thread2Thread1of1ForFork2_~i~1#1_In_3| v_~M~0_In_3) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14| 0)) (= (ite (< (select (select |v_#memory_int_In_28| v_~A~0.base_In_6) (+ v_~A~0.offset_In_6 (* |v_thread2Thread1of1ForFork2_~i~1#1_In_3| 4))) v_~size~0_In_6) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|)) InVars {~A~0.base=v_~A~0.base_In_6, ~A~0.offset=v_~A~0.offset_In_6, ~size~0=v_~size~0_In_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, ~M~0=v_~M~0_In_3, #memory_int=|v_#memory_int_In_28|} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_Out_8|, ~A~0.base=v_~A~0.base_In_6, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14|, ~A~0.offset=v_~A~0.offset_In_6, ~size~0=v_~size~0_In_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, ~M~0=v_~M~0_In_3, #memory_int=|v_#memory_int_In_28|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|, thread2Thread1of1ForFork2_~j~1#1=|v_thread2Thread1of1ForFork2_~j~1#1_Out_14|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~1#1][69], [225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 235#(and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 15#L102-1true, thread3Thread1of1ForFork0InUse, 135#L64-8true, thread2Thread1of1ForFork2InUse, 245#(and (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 117#L49-5true, 238#(= ~res2~0 ~res1~0), 184#L75-5true, thread1Thread1of1ForFork1InUse, 226#true]) [2022-12-06 02:28:18,731 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 02:28:18,731 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 02:28:18,731 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 02:28:18,731 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 02:28:18,731 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1045] L62-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_4| 0) (not (< |v_thread2Thread1of1ForFork2_~i~1#1_In_5| v_~M~0_In_5))) InVars {~M~0=v_~M~0_In_5, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_5|} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_4|, ~M~0=v_~M~0_In_5, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_5|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][70], [225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 235#(and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 15#L102-1true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 238#(= ~res2~0 ~res1~0), 245#(and (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 117#L49-5true, 184#L75-5true, thread1Thread1of1ForFork1InUse, 105#thread2EXITtrue, 226#true]) [2022-12-06 02:28:18,731 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 02:28:18,732 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 02:28:18,732 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 02:28:18,732 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 02:28:18,822 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L62-5-->L64-8: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|) (= |v_thread2Thread1of1ForFork2_~j~1#1_Out_14| 0) (< |v_thread2Thread1of1ForFork2_~i~1#1_In_3| v_~M~0_In_3) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14| 0)) (= (ite (< (select (select |v_#memory_int_In_28| v_~A~0.base_In_6) (+ v_~A~0.offset_In_6 (* |v_thread2Thread1of1ForFork2_~i~1#1_In_3| 4))) v_~size~0_In_6) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|)) InVars {~A~0.base=v_~A~0.base_In_6, ~A~0.offset=v_~A~0.offset_In_6, ~size~0=v_~size~0_In_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, ~M~0=v_~M~0_In_3, #memory_int=|v_#memory_int_In_28|} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_Out_8|, ~A~0.base=v_~A~0.base_In_6, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14|, ~A~0.offset=v_~A~0.offset_In_6, ~size~0=v_~size~0_In_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, ~M~0=v_~M~0_In_3, #memory_int=|v_#memory_int_In_28|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|, thread2Thread1of1ForFork2_~j~1#1=|v_thread2Thread1of1ForFork2_~j~1#1_Out_14|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~1#1][124], [225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 235#(and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 15#L102-1true, thread3Thread1of1ForFork0InUse, 135#L64-8true, thread2Thread1of1ForFork2InUse, 117#L49-5true, 238#(= ~res2~0 ~res1~0), 184#L75-5true, 226#true, thread1Thread1of1ForFork1InUse, 239#true]) [2022-12-06 02:28:18,823 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 02:28:18,823 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 02:28:18,823 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 02:28:18,823 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 02:28:18,823 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1045] L62-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_4| 0) (not (< |v_thread2Thread1of1ForFork2_~i~1#1_In_5| v_~M~0_In_5))) InVars {~M~0=v_~M~0_In_5, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_5|} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_4|, ~M~0=v_~M~0_In_5, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_5|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][125], [225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 235#(and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 15#L102-1true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 238#(= ~res2~0 ~res1~0), 117#L49-5true, 105#thread2EXITtrue, 226#true, 239#true, 184#L75-5true, thread1Thread1of1ForFork1InUse]) [2022-12-06 02:28:18,823 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 02:28:18,823 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 02:28:18,823 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 02:28:18,824 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 02:28:19,305 INFO L130 PetriNetUnfolder]: 5434/7201 cut-off events. [2022-12-06 02:28:19,305 INFO L131 PetriNetUnfolder]: For 5632/5677 co-relation queries the response was YES. [2022-12-06 02:28:19,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42487 conditions, 7201 events. 5434/7201 cut-off events. For 5632/5677 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 32597 event pairs, 428 based on Foata normal form. 24/4930 useless extension candidates. Maximal degree in co-relation 19722. Up to 5873 conditions per place. [2022-12-06 02:28:19,360 INFO L137 encePairwiseOnDemand]: 28/36 looper letters, 380 selfloop transitions, 16 changer transitions 15/413 dead transitions. [2022-12-06 02:28:19,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 413 transitions, 5080 flow [2022-12-06 02:28:19,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:28:19,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:28:19,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-06 02:28:19,362 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2022-12-06 02:28:19,362 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places. [2022-12-06 02:28:19,363 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:19,363 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 413 transitions, 5080 flow [2022-12-06 02:28:19,408 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 413 transitions, 5080 flow [2022-12-06 02:28:19,408 INFO L188 LiptonReduction]: Number of co-enabled transitions 470 [2022-12-06 02:28:19,411 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:19,411 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 02:28:19,412 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 413 transitions, 5080 flow [2022-12-06 02:28:19,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 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 02:28:19,412 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:19,412 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 02:28:19,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 02:28:19,412 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:28:19,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:19,413 INFO L85 PathProgramCache]: Analyzing trace with hash 650286438, now seen corresponding path program 1 times [2022-12-06 02:28:19,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:19,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159042405] [2022-12-06 02:28:19,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:19,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:19,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:19,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:19,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159042405] [2022-12-06 02:28:19,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159042405] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:28:19,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:28:19,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:28:19,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96968856] [2022-12-06 02:28:19,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:28:19,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:28:19,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:19,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:28:19,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:28:19,601 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2022-12-06 02:28:19,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 413 transitions, 5080 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 02:28:19,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:19,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2022-12-06 02:28:19,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:20,101 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L62-5-->L64-8: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|) (= |v_thread2Thread1of1ForFork2_~j~1#1_Out_14| 0) (< |v_thread2Thread1of1ForFork2_~i~1#1_In_3| v_~M~0_In_3) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14| 0)) (= (ite (< (select (select |v_#memory_int_In_28| v_~A~0.base_In_6) (+ v_~A~0.offset_In_6 (* |v_thread2Thread1of1ForFork2_~i~1#1_In_3| 4))) v_~size~0_In_6) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|)) InVars {~A~0.base=v_~A~0.base_In_6, ~A~0.offset=v_~A~0.offset_In_6, ~size~0=v_~size~0_In_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, ~M~0=v_~M~0_In_3, #memory_int=|v_#memory_int_In_28|} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_Out_8|, ~A~0.base=v_~A~0.base_In_6, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14|, ~A~0.offset=v_~A~0.offset_In_6, ~size~0=v_~size~0_In_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, ~M~0=v_~M~0_In_3, #memory_int=|v_#memory_int_In_28|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|, thread2Thread1of1ForFork2_~j~1#1=|v_thread2Thread1of1ForFork2_~j~1#1_Out_14|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~1#1][132], [248#true, 235#(and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 117#L49-5true, 239#true, 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 15#L102-1true, thread3Thread1of1ForFork0InUse, 135#L64-8true, thread2Thread1of1ForFork2InUse, 238#(= ~res2~0 ~res1~0), thread1Thread1of1ForFork1InUse, 226#true, 184#L75-5true]) [2022-12-06 02:28:20,102 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 02:28:20,102 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 02:28:20,102 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 02:28:20,102 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 02:28:20,102 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1045] L62-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_4| 0) (not (< |v_thread2Thread1of1ForFork2_~i~1#1_In_5| v_~M~0_In_5))) InVars {~M~0=v_~M~0_In_5, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_5|} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_4|, ~M~0=v_~M~0_In_5, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_5|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][133], [248#true, 235#(and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 117#L49-5true, 239#true, 105#thread2EXITtrue, 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 15#L102-1true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 238#(= ~res2~0 ~res1~0), thread1Thread1of1ForFork1InUse, 184#L75-5true, 226#true]) [2022-12-06 02:28:20,102 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 02:28:20,102 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 02:28:20,102 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 02:28:20,103 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 02:28:20,693 INFO L130 PetriNetUnfolder]: 5905/7847 cut-off events. [2022-12-06 02:28:20,693 INFO L131 PetriNetUnfolder]: For 7583/7727 co-relation queries the response was YES. [2022-12-06 02:28:20,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53847 conditions, 7847 events. 5905/7847 cut-off events. For 7583/7727 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 36396 event pairs, 395 based on Foata normal form. 14/5421 useless extension candidates. Maximal degree in co-relation 26136. Up to 6398 conditions per place. [2022-12-06 02:28:20,743 INFO L137 encePairwiseOnDemand]: 26/36 looper letters, 471 selfloop transitions, 42 changer transitions 21/537 dead transitions. [2022-12-06 02:28:20,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 537 transitions, 7649 flow [2022-12-06 02:28:20,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:28:20,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:28:20,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-06 02:28:20,744 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2022-12-06 02:28:20,745 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 18 predicate places. [2022-12-06 02:28:20,745 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:20,746 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 537 transitions, 7649 flow [2022-12-06 02:28:20,791 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 537 transitions, 7649 flow [2022-12-06 02:28:20,792 INFO L188 LiptonReduction]: Number of co-enabled transitions 556 [2022-12-06 02:28:20,795 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:20,796 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-06 02:28:20,796 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 537 transitions, 7649 flow [2022-12-06 02:28:20,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 02:28:20,797 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:20,797 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 02:28:20,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 02:28:20,797 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:28:20,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:20,798 INFO L85 PathProgramCache]: Analyzing trace with hash 914370322, now seen corresponding path program 2 times [2022-12-06 02:28:20,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:20,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093199887] [2022-12-06 02:28:20,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:20,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:21,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:28:21,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:21,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093199887] [2022-12-06 02:28:21,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093199887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:28:21,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:28:21,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 02:28:21,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496898226] [2022-12-06 02:28:21,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:28:21,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 02:28:21,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:21,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 02:28:21,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 02:28:21,089 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2022-12-06 02:28:21,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 537 transitions, 7649 flow. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 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 02:28:21,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:21,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2022-12-06 02:28:21,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:21,648 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L62-5-->L64-8: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|) (= |v_thread2Thread1of1ForFork2_~j~1#1_Out_14| 0) (< |v_thread2Thread1of1ForFork2_~i~1#1_In_3| v_~M~0_In_3) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14| 0)) (= (ite (< (select (select |v_#memory_int_In_28| v_~A~0.base_In_6) (+ v_~A~0.offset_In_6 (* |v_thread2Thread1of1ForFork2_~i~1#1_In_3| 4))) v_~size~0_In_6) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|)) InVars {~A~0.base=v_~A~0.base_In_6, ~A~0.offset=v_~A~0.offset_In_6, ~size~0=v_~size~0_In_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, ~M~0=v_~M~0_In_3, #memory_int=|v_#memory_int_In_28|} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_Out_8|, ~A~0.base=v_~A~0.base_In_6, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14|, ~A~0.offset=v_~A~0.offset_In_6, ~size~0=v_~size~0_In_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, ~M~0=v_~M~0_In_3, #memory_int=|v_#memory_int_In_28|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|, thread2Thread1of1ForFork2_~j~1#1=|v_thread2Thread1of1ForFork2_~j~1#1_Out_14|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~1#1][110], [235#(and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 254#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~size~0) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 117#L49-5true, 265#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~size~0) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 15#L102-1true, thread3Thread1of1ForFork0InUse, 135#L64-8true, thread2Thread1of1ForFork2InUse, 238#(= ~res2~0 ~res1~0), 245#(and (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), thread1Thread1of1ForFork1InUse, 226#true, 184#L75-5true]) [2022-12-06 02:28:21,649 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 02:28:21,649 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 02:28:21,649 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 02:28:21,649 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 02:28:21,649 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1045] L62-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_4| 0) (not (< |v_thread2Thread1of1ForFork2_~i~1#1_In_5| v_~M~0_In_5))) InVars {~M~0=v_~M~0_In_5, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_5|} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_4|, ~M~0=v_~M~0_In_5, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_5|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][111], [235#(and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 254#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~size~0) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 117#L49-5true, 105#thread2EXITtrue, 265#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~size~0) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 15#L102-1true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 238#(= ~res2~0 ~res1~0), 245#(and (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), thread1Thread1of1ForFork1InUse, 226#true, 184#L75-5true]) [2022-12-06 02:28:21,649 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 02:28:21,649 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 02:28:21,649 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 02:28:21,650 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 02:28:21,755 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L62-5-->L64-8: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|) (= |v_thread2Thread1of1ForFork2_~j~1#1_Out_14| 0) (< |v_thread2Thread1of1ForFork2_~i~1#1_In_3| v_~M~0_In_3) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14| 0)) (= (ite (< (select (select |v_#memory_int_In_28| v_~A~0.base_In_6) (+ v_~A~0.offset_In_6 (* |v_thread2Thread1of1ForFork2_~i~1#1_In_3| 4))) v_~size~0_In_6) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|)) InVars {~A~0.base=v_~A~0.base_In_6, ~A~0.offset=v_~A~0.offset_In_6, ~size~0=v_~size~0_In_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, ~M~0=v_~M~0_In_3, #memory_int=|v_#memory_int_In_28|} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_Out_8|, ~A~0.base=v_~A~0.base_In_6, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14|, ~A~0.offset=v_~A~0.offset_In_6, ~size~0=v_~size~0_In_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, ~M~0=v_~M~0_In_3, #memory_int=|v_#memory_int_In_28|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|, thread2Thread1of1ForFork2_~j~1#1=|v_thread2Thread1of1ForFork2_~j~1#1_Out_14|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~1#1][145], [235#(and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 254#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~size~0) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 117#L49-5true, 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 15#L102-1true, thread3Thread1of1ForFork0InUse, 257#true, 135#L64-8true, thread2Thread1of1ForFork2InUse, 245#(and (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 238#(= ~res2~0 ~res1~0), 226#true, thread1Thread1of1ForFork1InUse, 184#L75-5true]) [2022-12-06 02:28:21,756 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 02:28:21,756 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 02:28:21,756 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 02:28:21,756 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 02:28:21,756 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1045] L62-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_4| 0) (not (< |v_thread2Thread1of1ForFork2_~i~1#1_In_5| v_~M~0_In_5))) InVars {~M~0=v_~M~0_In_5, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_5|} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_4|, ~M~0=v_~M~0_In_5, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_5|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][146], [235#(and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 117#L49-5true, 254#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~size~0) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 105#thread2EXITtrue, 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 15#L102-1true, thread3Thread1of1ForFork0InUse, 257#true, thread2Thread1of1ForFork2InUse, 238#(= ~res2~0 ~res1~0), 245#(and (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), thread1Thread1of1ForFork1InUse, 184#L75-5true, 226#true]) [2022-12-06 02:28:21,756 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 02:28:21,756 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 02:28:21,756 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 02:28:21,756 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 02:28:22,745 INFO L130 PetriNetUnfolder]: 9515/12673 cut-off events. [2022-12-06 02:28:22,745 INFO L131 PetriNetUnfolder]: For 19282/19966 co-relation queries the response was YES. [2022-12-06 02:28:22,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99201 conditions, 12673 events. 9515/12673 cut-off events. For 19282/19966 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 63580 event pairs, 660 based on Foata normal form. 30/8895 useless extension candidates. Maximal degree in co-relation 35202. Up to 10332 conditions per place. [2022-12-06 02:28:22,975 INFO L137 encePairwiseOnDemand]: 28/36 looper letters, 897 selfloop transitions, 53 changer transitions 46/999 dead transitions. [2022-12-06 02:28:22,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 999 transitions, 16215 flow [2022-12-06 02:28:22,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:28:22,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:28:22,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-06 02:28:22,979 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2022-12-06 02:28:22,980 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2022-12-06 02:28:22,981 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:22,981 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 999 transitions, 16215 flow [2022-12-06 02:28:23,065 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 999 transitions, 16215 flow [2022-12-06 02:28:23,066 INFO L188 LiptonReduction]: Number of co-enabled transitions 970 [2022-12-06 02:28:23,071 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:23,072 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-06 02:28:23,072 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 999 transitions, 16215 flow [2022-12-06 02:28:23,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 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 02:28:23,072 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:23,073 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 02:28:23,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 02:28:23,073 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:28:23,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:23,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1601488448, now seen corresponding path program 3 times [2022-12-06 02:28:23,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:23,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664818214] [2022-12-06 02:28:23,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:23,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:23,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:28:23,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:23,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664818214] [2022-12-06 02:28:23,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664818214] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:28:23,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:28:23,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 02:28:23,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992143360] [2022-12-06 02:28:23,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:28:23,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 02:28:23,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:23,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 02:28:23,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 02:28:23,466 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2022-12-06 02:28:23,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 999 transitions, 16215 flow. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 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 02:28:23,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:23,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2022-12-06 02:28:23,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:24,094 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L62-5-->L64-8: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|) (= |v_thread2Thread1of1ForFork2_~j~1#1_Out_14| 0) (< |v_thread2Thread1of1ForFork2_~i~1#1_In_3| v_~M~0_In_3) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14| 0)) (= (ite (< (select (select |v_#memory_int_In_28| v_~A~0.base_In_6) (+ v_~A~0.offset_In_6 (* |v_thread2Thread1of1ForFork2_~i~1#1_In_3| 4))) v_~size~0_In_6) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|)) InVars {~A~0.base=v_~A~0.base_In_6, ~A~0.offset=v_~A~0.offset_In_6, ~size~0=v_~size~0_In_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, ~M~0=v_~M~0_In_3, #memory_int=|v_#memory_int_In_28|} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_Out_8|, ~A~0.base=v_~A~0.base_In_6, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14|, ~A~0.offset=v_~A~0.offset_In_6, ~size~0=v_~size~0_In_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, ~M~0=v_~M~0_In_3, #memory_int=|v_#memory_int_In_28|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|, thread2Thread1of1ForFork2_~j~1#1=|v_thread2Thread1of1ForFork2_~j~1#1_Out_14|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~1#1][112], [235#(and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 117#L49-5true, 254#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~size~0) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 265#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~size~0) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 277#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 15#L102-1true, thread3Thread1of1ForFork0InUse, 135#L64-8true, thread2Thread1of1ForFork2InUse, 238#(= ~res2~0 ~res1~0), 245#(and (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 184#L75-5true, 226#true, thread1Thread1of1ForFork1InUse]) [2022-12-06 02:28:24,094 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 02:28:24,094 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 02:28:24,094 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 02:28:24,094 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 02:28:24,094 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1045] L62-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_4| 0) (not (< |v_thread2Thread1of1ForFork2_~i~1#1_In_5| v_~M~0_In_5))) InVars {~M~0=v_~M~0_In_5, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_5|} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_4|, ~M~0=v_~M~0_In_5, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_5|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][113], [235#(and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 117#L49-5true, 254#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~size~0) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 105#thread2EXITtrue, 265#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~size~0) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 277#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 15#L102-1true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 238#(= ~res2~0 ~res1~0), 245#(and (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 184#L75-5true, 226#true, thread1Thread1of1ForFork1InUse]) [2022-12-06 02:28:24,094 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 02:28:24,094 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 02:28:24,094 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 02:28:24,094 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 02:28:24,178 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L62-5-->L64-8: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|) (= |v_thread2Thread1of1ForFork2_~j~1#1_Out_14| 0) (< |v_thread2Thread1of1ForFork2_~i~1#1_In_3| v_~M~0_In_3) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14| 0)) (= (ite (< (select (select |v_#memory_int_In_28| v_~A~0.base_In_6) (+ v_~A~0.offset_In_6 (* |v_thread2Thread1of1ForFork2_~i~1#1_In_3| 4))) v_~size~0_In_6) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|)) InVars {~A~0.base=v_~A~0.base_In_6, ~A~0.offset=v_~A~0.offset_In_6, ~size~0=v_~size~0_In_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, ~M~0=v_~M~0_In_3, #memory_int=|v_#memory_int_In_28|} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_Out_8|, ~A~0.base=v_~A~0.base_In_6, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14|, ~A~0.offset=v_~A~0.offset_In_6, ~size~0=v_~size~0_In_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, ~M~0=v_~M~0_In_3, #memory_int=|v_#memory_int_In_28|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|, thread2Thread1of1ForFork2_~j~1#1=|v_thread2Thread1of1ForFork2_~j~1#1_Out_14|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~1#1][140], [235#(and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 117#L49-5true, 254#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~size~0) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 15#L102-1true, 268#true, thread3Thread1of1ForFork0InUse, 135#L64-8true, 257#true, thread2Thread1of1ForFork2InUse, 238#(= ~res2~0 ~res1~0), 245#(and (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), thread1Thread1of1ForFork1InUse, 226#true, 184#L75-5true]) [2022-12-06 02:28:24,178 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 02:28:24,178 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 02:28:24,178 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 02:28:24,178 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 02:28:24,178 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1045] L62-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_4| 0) (not (< |v_thread2Thread1of1ForFork2_~i~1#1_In_5| v_~M~0_In_5))) InVars {~M~0=v_~M~0_In_5, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_5|} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_4|, ~M~0=v_~M~0_In_5, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_5|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][141], [235#(and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 117#L49-5true, 254#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~size~0) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 105#thread2EXITtrue, 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 15#L102-1true, 268#true, thread3Thread1of1ForFork0InUse, 257#true, thread2Thread1of1ForFork2InUse, 238#(= ~res2~0 ~res1~0), 245#(and (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), thread1Thread1of1ForFork1InUse, 226#true, 184#L75-5true]) [2022-12-06 02:28:24,179 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 02:28:24,179 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 02:28:24,179 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 02:28:24,179 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 02:28:24,263 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L62-5-->L64-8: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|) (= |v_thread2Thread1of1ForFork2_~j~1#1_Out_14| 0) (< |v_thread2Thread1of1ForFork2_~i~1#1_In_3| v_~M~0_In_3) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14| 0)) (= (ite (< (select (select |v_#memory_int_In_28| v_~A~0.base_In_6) (+ v_~A~0.offset_In_6 (* |v_thread2Thread1of1ForFork2_~i~1#1_In_3| 4))) v_~size~0_In_6) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|)) InVars {~A~0.base=v_~A~0.base_In_6, ~A~0.offset=v_~A~0.offset_In_6, ~size~0=v_~size~0_In_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, ~M~0=v_~M~0_In_3, #memory_int=|v_#memory_int_In_28|} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_Out_8|, ~A~0.base=v_~A~0.base_In_6, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14|, ~A~0.offset=v_~A~0.offset_In_6, ~size~0=v_~size~0_In_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, ~M~0=v_~M~0_In_3, #memory_int=|v_#memory_int_In_28|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|, thread2Thread1of1ForFork2_~j~1#1=|v_thread2Thread1of1ForFork2_~j~1#1_Out_14|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~1#1][192], [248#true, 235#(and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 117#L49-5true, 239#true, 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 15#L102-1true, 268#true, thread3Thread1of1ForFork0InUse, 135#L64-8true, 257#true, thread2Thread1of1ForFork2InUse, 238#(= ~res2~0 ~res1~0), 184#L75-5true, thread1Thread1of1ForFork1InUse, 226#true]) [2022-12-06 02:28:24,263 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 02:28:24,264 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 02:28:24,264 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 02:28:24,264 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 02:28:24,264 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1045] L62-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_4| 0) (not (< |v_thread2Thread1of1ForFork2_~i~1#1_In_5| v_~M~0_In_5))) InVars {~M~0=v_~M~0_In_5, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_5|} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_4|, ~M~0=v_~M~0_In_5, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_5|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][193], [248#true, 235#(and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 117#L49-5true, 105#thread2EXITtrue, 239#true, 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 15#L102-1true, 268#true, thread3Thread1of1ForFork0InUse, 257#true, thread2Thread1of1ForFork2InUse, 238#(= ~res2~0 ~res1~0), 184#L75-5true, thread1Thread1of1ForFork1InUse, 226#true]) [2022-12-06 02:28:24,264 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 02:28:24,264 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 02:28:24,264 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 02:28:24,264 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 02:28:25,234 INFO L130 PetriNetUnfolder]: 8510/11386 cut-off events. [2022-12-06 02:28:25,234 INFO L131 PetriNetUnfolder]: For 26112/27482 co-relation queries the response was YES. [2022-12-06 02:28:25,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100003 conditions, 11386 events. 8510/11386 cut-off events. For 26112/27482 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 56718 event pairs, 575 based on Foata normal form. 40/8091 useless extension candidates. Maximal degree in co-relation 33822. Up to 9267 conditions per place. [2022-12-06 02:28:25,343 INFO L137 encePairwiseOnDemand]: 29/36 looper letters, 938 selfloop transitions, 67 changer transitions 62/1070 dead transitions. [2022-12-06 02:28:25,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 1070 transitions, 19494 flow [2022-12-06 02:28:25,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:28:25,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:28:25,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2022-12-06 02:28:25,345 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-06 02:28:25,346 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 26 predicate places. [2022-12-06 02:28:25,346 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:25,346 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 1070 transitions, 19494 flow [2022-12-06 02:28:25,456 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 1070 transitions, 19494 flow [2022-12-06 02:28:25,457 INFO L188 LiptonReduction]: Number of co-enabled transitions 804 [2022-12-06 02:28:25,464 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:25,466 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-06 02:28:25,467 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 1070 transitions, 19494 flow [2022-12-06 02:28:25,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 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 02:28:25,467 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:25,467 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 02:28:25,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 02:28:25,467 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:28:25,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:25,468 INFO L85 PathProgramCache]: Analyzing trace with hash -133446214, now seen corresponding path program 1 times [2022-12-06 02:28:25,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:25,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570619612] [2022-12-06 02:28:25,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:25,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:25,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:28:25,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:25,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570619612] [2022-12-06 02:28:25,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570619612] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:28:25,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974464940] [2022-12-06 02:28:25,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:25,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:25,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:28:25,679 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 02:28:25,695 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 02:28:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:25,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 02:28:25,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:28:25,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:28:25,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:28:26,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 02:28:26,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:28:26,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974464940] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:28:26,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:28:26,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-12-06 02:28:26,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017142841] [2022-12-06 02:28:26,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:28:26,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 02:28:26,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:26,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 02:28:26,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-12-06 02:28:26,064 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2022-12-06 02:28:26,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 1070 transitions, 19494 flow. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 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 02:28:26,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:26,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2022-12-06 02:28:26,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:26,916 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L62-5-->L64-8: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|) (= |v_thread2Thread1of1ForFork2_~j~1#1_Out_14| 0) (< |v_thread2Thread1of1ForFork2_~i~1#1_In_3| v_~M~0_In_3) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14| 0)) (= (ite (< (select (select |v_#memory_int_In_28| v_~A~0.base_In_6) (+ v_~A~0.offset_In_6 (* |v_thread2Thread1of1ForFork2_~i~1#1_In_3| 4))) v_~size~0_In_6) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|)) InVars {~A~0.base=v_~A~0.base_In_6, ~A~0.offset=v_~A~0.offset_In_6, ~size~0=v_~size~0_In_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, ~M~0=v_~M~0_In_3, #memory_int=|v_#memory_int_In_28|} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_Out_8|, ~A~0.base=v_~A~0.base_In_6, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14|, ~A~0.offset=v_~A~0.offset_In_6, ~size~0=v_~size~0_In_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, ~M~0=v_~M~0_In_3, #memory_int=|v_#memory_int_In_28|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|, thread2Thread1of1ForFork2_~j~1#1=|v_thread2Thread1of1ForFork2_~j~1#1_Out_14|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~1#1][124], [235#(and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 117#L49-5true, 254#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~size~0) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 265#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~size~0) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 277#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 15#L102-1true, 444#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~size~0) (<= ~size~0 1) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), thread3Thread1of1ForFork0InUse, 135#L64-8true, thread2Thread1of1ForFork2InUse, 238#(= ~res2~0 ~res1~0), 245#(and (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), thread1Thread1of1ForFork1InUse, 226#true, 184#L75-5true]) [2022-12-06 02:28:26,916 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 02:28:26,916 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 02:28:26,916 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 02:28:26,916 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 02:28:26,916 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1045] L62-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_4| 0) (not (< |v_thread2Thread1of1ForFork2_~i~1#1_In_5| v_~M~0_In_5))) InVars {~M~0=v_~M~0_In_5, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_5|} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_4|, ~M~0=v_~M~0_In_5, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_5|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][125], [235#(and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 117#L49-5true, 254#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~size~0) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 105#thread2EXITtrue, 265#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~size~0) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 277#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 15#L102-1true, 444#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~size~0) (<= ~size~0 1) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 238#(= ~res2~0 ~res1~0), 245#(and (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), thread1Thread1of1ForFork1InUse, 226#true, 184#L75-5true]) [2022-12-06 02:28:26,916 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 02:28:26,917 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 02:28:26,917 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 02:28:26,917 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 02:28:27,037 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L62-5-->L64-8: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|) (= |v_thread2Thread1of1ForFork2_~j~1#1_Out_14| 0) (< |v_thread2Thread1of1ForFork2_~i~1#1_In_3| v_~M~0_In_3) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14| 0)) (= (ite (< (select (select |v_#memory_int_In_28| v_~A~0.base_In_6) (+ v_~A~0.offset_In_6 (* |v_thread2Thread1of1ForFork2_~i~1#1_In_3| 4))) v_~size~0_In_6) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|)) InVars {~A~0.base=v_~A~0.base_In_6, ~A~0.offset=v_~A~0.offset_In_6, ~size~0=v_~size~0_In_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, ~M~0=v_~M~0_In_3, #memory_int=|v_#memory_int_In_28|} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_Out_8|, ~A~0.base=v_~A~0.base_In_6, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14|, ~A~0.offset=v_~A~0.offset_In_6, ~size~0=v_~size~0_In_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, ~M~0=v_~M~0_In_3, #memory_int=|v_#memory_int_In_28|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|, thread2Thread1of1ForFork2_~j~1#1=|v_thread2Thread1of1ForFork2_~j~1#1_Out_14|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~1#1][161], [235#(and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 254#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~size~0) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 117#L49-5true, 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 268#true, 15#L102-1true, 444#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~size~0) (<= ~size~0 1) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), thread3Thread1of1ForFork0InUse, 135#L64-8true, 257#true, thread2Thread1of1ForFork2InUse, 238#(= ~res2~0 ~res1~0), 245#(and (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 226#true, thread1Thread1of1ForFork1InUse, 184#L75-5true]) [2022-12-06 02:28:27,038 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 02:28:27,038 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 02:28:27,038 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 02:28:27,038 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 02:28:27,038 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1045] L62-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_4| 0) (not (< |v_thread2Thread1of1ForFork2_~i~1#1_In_5| v_~M~0_In_5))) InVars {~M~0=v_~M~0_In_5, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_5|} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_4|, ~M~0=v_~M~0_In_5, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_5|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][162], [235#(and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 254#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~size~0) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 117#L49-5true, 105#thread2EXITtrue, 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 15#L102-1true, 268#true, 444#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~size~0) (<= ~size~0 1) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), thread3Thread1of1ForFork0InUse, 257#true, thread2Thread1of1ForFork2InUse, 238#(= ~res2~0 ~res1~0), 245#(and (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 226#true, thread1Thread1of1ForFork1InUse, 184#L75-5true]) [2022-12-06 02:28:27,038 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 02:28:27,038 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 02:28:27,038 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 02:28:27,039 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 02:28:28,503 INFO L130 PetriNetUnfolder]: 11068/14821 cut-off events. [2022-12-06 02:28:28,503 INFO L131 PetriNetUnfolder]: For 32764/33936 co-relation queries the response was YES. [2022-12-06 02:28:28,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144584 conditions, 14821 events. 11068/14821 cut-off events. For 32764/33936 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 76137 event pairs, 735 based on Foata normal form. 32/10469 useless extension candidates. Maximal degree in co-relation 37597. Up to 12049 conditions per place. [2022-12-06 02:28:28,619 INFO L137 encePairwiseOnDemand]: 28/36 looper letters, 1126 selfloop transitions, 92 changer transitions 72/1294 dead transitions. [2022-12-06 02:28:28,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 1294 transitions, 26177 flow [2022-12-06 02:28:28,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 02:28:28,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 02:28:28,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2022-12-06 02:28:28,621 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46875 [2022-12-06 02:28:28,622 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 33 predicate places. [2022-12-06 02:28:28,624 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:28,624 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 1294 transitions, 26177 flow [2022-12-06 02:28:28,741 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 1294 transitions, 26177 flow [2022-12-06 02:28:28,742 INFO L188 LiptonReduction]: Number of co-enabled transitions 1056 [2022-12-06 02:28:28,890 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:28,891 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 269 [2022-12-06 02:28:28,891 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 1294 transitions, 26177 flow [2022-12-06 02:28:28,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 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 02:28:28,891 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:28,891 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:28,899 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 02:28:29,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:29,092 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:28:29,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:29,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1643589264, now seen corresponding path program 1 times [2022-12-06 02:28:29,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:29,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917281499] [2022-12-06 02:28:29,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:29,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:29,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:28:29,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:29,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917281499] [2022-12-06 02:28:29,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917281499] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:28:29,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644159721] [2022-12-06 02:28:29,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:29,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:29,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:28:29,219 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 02:28:29,222 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 02:28:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:29,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:28:29,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:28:29,393 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:28:29,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:28:29,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:28:29,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644159721] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:28:29,429 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:28:29,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-12-06 02:28:29,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872559162] [2022-12-06 02:28:29,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:28:29,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 02:28:29,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:29,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 02:28:29,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-06 02:28:29,432 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2022-12-06 02:28:29,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 1294 transitions, 26177 flow. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 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 02:28:29,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:29,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2022-12-06 02:28:29,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:30,251 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L62-5-->L64-8: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|) (= |v_thread2Thread1of1ForFork2_~j~1#1_Out_14| 0) (< |v_thread2Thread1of1ForFork2_~i~1#1_In_3| v_~M~0_In_3) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14| 0)) (= (ite (< (select (select |v_#memory_int_In_28| v_~A~0.base_In_6) (+ v_~A~0.offset_In_6 (* |v_thread2Thread1of1ForFork2_~i~1#1_In_3| 4))) v_~size~0_In_6) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|)) InVars {~A~0.base=v_~A~0.base_In_6, ~A~0.offset=v_~A~0.offset_In_6, ~size~0=v_~size~0_In_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, ~M~0=v_~M~0_In_3, #memory_int=|v_#memory_int_In_28|} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_Out_8|, ~A~0.base=v_~A~0.base_In_6, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14|, ~A~0.offset=v_~A~0.offset_In_6, ~size~0=v_~size~0_In_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, ~M~0=v_~M~0_In_3, #memory_int=|v_#memory_int_In_28|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|, thread2Thread1of1ForFork2_~j~1#1=|v_thread2Thread1of1ForFork2_~j~1#1_Out_14|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~1#1][156], [451#true, 235#(and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 117#L49-5true, 254#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~size~0) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 265#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~size~0) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 277#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 15#L102-1true, 444#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~size~0) (<= ~size~0 1) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), thread3Thread1of1ForFork0InUse, 135#L64-8true, thread2Thread1of1ForFork2InUse, 238#(= ~res2~0 ~res1~0), 245#(and (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 226#true, thread1Thread1of1ForFork1InUse, 184#L75-5true]) [2022-12-06 02:28:30,251 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 02:28:30,251 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 02:28:30,251 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 02:28:30,252 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 02:28:30,255 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1045] L62-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_4| 0) (not (< |v_thread2Thread1of1ForFork2_~i~1#1_In_5| v_~M~0_In_5))) InVars {~M~0=v_~M~0_In_5, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_5|} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_4|, ~M~0=v_~M~0_In_5, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_5|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][157], [451#true, 235#(and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 117#L49-5true, 254#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~size~0) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 105#thread2EXITtrue, 265#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~size~0) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 277#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 15#L102-1true, 444#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~size~0) (<= ~size~0 1) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 238#(= ~res2~0 ~res1~0), 245#(and (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 226#true, thread1Thread1of1ForFork1InUse, 184#L75-5true]) [2022-12-06 02:28:30,255 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 02:28:30,255 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 02:28:30,255 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 02:28:30,255 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 02:28:30,579 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L62-5-->L64-8: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|) (= |v_thread2Thread1of1ForFork2_~j~1#1_Out_14| 0) (< |v_thread2Thread1of1ForFork2_~i~1#1_In_3| v_~M~0_In_3) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14| 0)) (= (ite (< (select (select |v_#memory_int_In_28| v_~A~0.base_In_6) (+ v_~A~0.offset_In_6 (* |v_thread2Thread1of1ForFork2_~i~1#1_In_3| 4))) v_~size~0_In_6) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|)) InVars {~A~0.base=v_~A~0.base_In_6, ~A~0.offset=v_~A~0.offset_In_6, ~size~0=v_~size~0_In_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, ~M~0=v_~M~0_In_3, #memory_int=|v_#memory_int_In_28|} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_Out_8|, ~A~0.base=v_~A~0.base_In_6, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14|, ~A~0.offset=v_~A~0.offset_In_6, ~size~0=v_~size~0_In_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, ~M~0=v_~M~0_In_3, #memory_int=|v_#memory_int_In_28|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|, thread2Thread1of1ForFork2_~j~1#1=|v_thread2Thread1of1ForFork2_~j~1#1_Out_14|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~1#1][274], [248#true, 451#true, 235#(and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 117#L49-5true, 239#true, 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 15#L102-1true, 268#true, thread3Thread1of1ForFork0InUse, 135#L64-8true, 257#true, thread2Thread1of1ForFork2InUse, 238#(= ~res2~0 ~res1~0), 184#L75-5true, thread1Thread1of1ForFork1InUse, 226#true, 446#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~size~0) (<= ~size~0 1))]) [2022-12-06 02:28:30,579 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 02:28:30,583 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 02:28:30,583 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 02:28:30,583 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 02:28:30,584 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1045] L62-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_4| 0) (not (< |v_thread2Thread1of1ForFork2_~i~1#1_In_5| v_~M~0_In_5))) InVars {~M~0=v_~M~0_In_5, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_5|} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_4|, ~M~0=v_~M~0_In_5, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_5|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][275], [451#true, 248#true, 235#(and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 117#L49-5true, 105#thread2EXITtrue, 239#true, 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 268#true, 15#L102-1true, thread3Thread1of1ForFork0InUse, 257#true, thread2Thread1of1ForFork2InUse, 238#(= ~res2~0 ~res1~0), 184#L75-5true, 226#true, thread1Thread1of1ForFork1InUse, 446#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~size~0) (<= ~size~0 1))]) [2022-12-06 02:28:30,584 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 02:28:30,584 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 02:28:30,584 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 02:28:30,584 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 02:28:30,928 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L62-5-->L64-8: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|) (= |v_thread2Thread1of1ForFork2_~j~1#1_Out_14| 0) (< |v_thread2Thread1of1ForFork2_~i~1#1_In_3| v_~M~0_In_3) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14| 0)) (= (ite (< (select (select |v_#memory_int_In_28| v_~A~0.base_In_6) (+ v_~A~0.offset_In_6 (* |v_thread2Thread1of1ForFork2_~i~1#1_In_3| 4))) v_~size~0_In_6) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|)) InVars {~A~0.base=v_~A~0.base_In_6, ~A~0.offset=v_~A~0.offset_In_6, ~size~0=v_~size~0_In_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, ~M~0=v_~M~0_In_3, #memory_int=|v_#memory_int_In_28|} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_Out_8|, ~A~0.base=v_~A~0.base_In_6, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14|, ~A~0.offset=v_~A~0.offset_In_6, ~size~0=v_~size~0_In_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, ~M~0=v_~M~0_In_3, #memory_int=|v_#memory_int_In_28|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|, thread2Thread1of1ForFork2_~j~1#1=|v_thread2Thread1of1ForFork2_~j~1#1_Out_14|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~1#1][338], [248#true, 235#(and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 117#L49-5true, 239#true, 455#(and (<= 2 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 15#L102-1true, 268#true, thread3Thread1of1ForFork0InUse, 257#true, 135#L64-8true, thread2Thread1of1ForFork2InUse, 238#(= ~res2~0 ~res1~0), 226#true, thread1Thread1of1ForFork1InUse, 184#L75-5true, 446#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~size~0) (<= ~size~0 1))]) [2022-12-06 02:28:30,928 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-06 02:28:30,928 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 02:28:30,928 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 02:28:30,929 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 02:28:30,929 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1045] L62-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_4| 0) (not (< |v_thread2Thread1of1ForFork2_~i~1#1_In_5| v_~M~0_In_5))) InVars {~M~0=v_~M~0_In_5, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_5|} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_4|, ~M~0=v_~M~0_In_5, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_5|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][339], [248#true, 235#(and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 117#L49-5true, 105#thread2EXITtrue, 239#true, 455#(and (<= 2 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 15#L102-1true, 268#true, thread3Thread1of1ForFork0InUse, 257#true, thread2Thread1of1ForFork2InUse, 238#(= ~res2~0 ~res1~0), thread1Thread1of1ForFork1InUse, 226#true, 184#L75-5true, 446#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~size~0) (<= ~size~0 1))]) [2022-12-06 02:28:30,929 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-06 02:28:30,929 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 02:28:30,929 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 02:28:30,929 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 02:28:31,179 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L62-5-->L64-8: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|) (= |v_thread2Thread1of1ForFork2_~j~1#1_Out_14| 0) (< |v_thread2Thread1of1ForFork2_~i~1#1_In_3| v_~M~0_In_3) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14| 0)) (= (ite (< (select (select |v_#memory_int_In_28| v_~A~0.base_In_6) (+ v_~A~0.offset_In_6 (* |v_thread2Thread1of1ForFork2_~i~1#1_In_3| 4))) v_~size~0_In_6) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|)) InVars {~A~0.base=v_~A~0.base_In_6, ~A~0.offset=v_~A~0.offset_In_6, ~size~0=v_~size~0_In_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, ~M~0=v_~M~0_In_3, #memory_int=|v_#memory_int_In_28|} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_Out_8|, ~A~0.base=v_~A~0.base_In_6, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14|, ~A~0.offset=v_~A~0.offset_In_6, ~size~0=v_~size~0_In_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, ~M~0=v_~M~0_In_3, #memory_int=|v_#memory_int_In_28|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|, thread2Thread1of1ForFork2_~j~1#1=|v_thread2Thread1of1ForFork2_~j~1#1_Out_14|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~1#1][446], [248#true, 451#true, 235#(and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 117#L49-5true, 239#true, 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 268#true, 15#L102-1true, thread3Thread1of1ForFork0InUse, 135#L64-8true, 257#true, thread2Thread1of1ForFork2InUse, 238#(= ~res2~0 ~res1~0), 280#true, thread1Thread1of1ForFork1InUse, 226#true, 184#L75-5true]) [2022-12-06 02:28:31,180 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-06 02:28:31,180 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 02:28:31,180 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 02:28:31,180 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 02:28:31,180 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1045] L62-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_4| 0) (not (< |v_thread2Thread1of1ForFork2_~i~1#1_In_5| v_~M~0_In_5))) InVars {~M~0=v_~M~0_In_5, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_5|} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_4|, ~M~0=v_~M~0_In_5, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_5|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][447], [248#true, 451#true, 235#(and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 117#L49-5true, 105#thread2EXITtrue, 239#true, 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 268#true, 15#L102-1true, thread3Thread1of1ForFork0InUse, 257#true, thread2Thread1of1ForFork2InUse, 238#(= ~res2~0 ~res1~0), 280#true, thread1Thread1of1ForFork1InUse, 184#L75-5true, 226#true]) [2022-12-06 02:28:31,180 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-06 02:28:31,180 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 02:28:31,181 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 02:28:31,181 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 02:28:31,413 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L62-5-->L64-8: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|) (= |v_thread2Thread1of1ForFork2_~j~1#1_Out_14| 0) (< |v_thread2Thread1of1ForFork2_~i~1#1_In_3| v_~M~0_In_3) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14| 0)) (= (ite (< (select (select |v_#memory_int_In_28| v_~A~0.base_In_6) (+ v_~A~0.offset_In_6 (* |v_thread2Thread1of1ForFork2_~i~1#1_In_3| 4))) v_~size~0_In_6) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|)) InVars {~A~0.base=v_~A~0.base_In_6, ~A~0.offset=v_~A~0.offset_In_6, ~size~0=v_~size~0_In_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, ~M~0=v_~M~0_In_3, #memory_int=|v_#memory_int_In_28|} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_Out_8|, ~A~0.base=v_~A~0.base_In_6, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_14|, ~A~0.offset=v_~A~0.offset_In_6, ~size~0=v_~size~0_In_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, ~M~0=v_~M~0_In_3, #memory_int=|v_#memory_int_In_28|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|, thread2Thread1of1ForFork2_~j~1#1=|v_thread2Thread1of1ForFork2_~j~1#1_Out_14|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~1#1][528], [248#true, 235#(and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 117#L49-5true, 239#true, 455#(and (<= 2 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 268#true, 15#L102-1true, thread3Thread1of1ForFork0InUse, 257#true, 135#L64-8true, thread2Thread1of1ForFork2InUse, 280#true, 238#(= ~res2~0 ~res1~0), thread1Thread1of1ForFork1InUse, 184#L75-5true, 226#true]) [2022-12-06 02:28:31,414 INFO L382 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-06 02:28:31,414 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 02:28:31,414 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 02:28:31,414 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 02:28:31,414 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1045] L62-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_4| 0) (not (< |v_thread2Thread1of1ForFork2_~i~1#1_In_5| v_~M~0_In_5))) InVars {~M~0=v_~M~0_In_5, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_5|} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_4|, ~M~0=v_~M~0_In_5, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_5|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][529], [248#true, 235#(and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 117#L49-5true, 105#thread2EXITtrue, 239#true, 455#(and (<= 2 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 268#true, 15#L102-1true, thread3Thread1of1ForFork0InUse, 257#true, thread2Thread1of1ForFork2InUse, 280#true, 238#(= ~res2~0 ~res1~0), thread1Thread1of1ForFork1InUse, 184#L75-5true, 226#true]) [2022-12-06 02:28:31,414 INFO L382 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-06 02:28:31,414 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 02:28:31,414 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 02:28:31,414 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 02:28:33,880 INFO L130 PetriNetUnfolder]: 19708/26219 cut-off events. [2022-12-06 02:28:33,880 INFO L131 PetriNetUnfolder]: For 77094/80354 co-relation queries the response was YES. [2022-12-06 02:28:33,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281534 conditions, 26219 events. 19708/26219 cut-off events. For 77094/80354 co-relation queries the response was YES. Maximal size of possible extension queue 1011. Compared 142711 event pairs, 796 based on Foata normal form. 248/18563 useless extension candidates. Maximal degree in co-relation 58341. Up to 21845 conditions per place. [2022-12-06 02:28:34,075 INFO L137 encePairwiseOnDemand]: 30/36 looper letters, 2039 selfloop transitions, 236 changer transitions 90/2369 dead transitions. [2022-12-06 02:28:34,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 2369 transitions, 52673 flow [2022-12-06 02:28:34,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 02:28:34,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 02:28:34,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2022-12-06 02:28:34,078 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 02:28:34,078 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 40 predicate places. [2022-12-06 02:28:34,079 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:34,080 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 2369 transitions, 52673 flow [2022-12-06 02:28:34,297 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 2369 transitions, 52673 flow [2022-12-06 02:28:34,298 INFO L188 LiptonReduction]: Number of co-enabled transitions 2128 [2022-12-06 02:28:34,311 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:34,312 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 233 [2022-12-06 02:28:34,312 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 2369 transitions, 52673 flow [2022-12-06 02:28:34,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 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 02:28:34,312 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:34,313 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:34,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 02:28:34,518 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,SelfDestructingSolverStorable9 [2022-12-06 02:28:34,519 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:28:34,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:34,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1438274374, now seen corresponding path program 1 times [2022-12-06 02:28:34,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:34,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800764305] [2022-12-06 02:28:34,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:34,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:34,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:28:34,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:34,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800764305] [2022-12-06 02:28:34,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800764305] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:28:34,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173735307] [2022-12-06 02:28:34,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:34,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:34,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:28:34,626 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:28:34,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 02:28:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:34,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 02:28:34,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:28:34,797 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:28:34,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 02:28:34,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173735307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:28:34,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 02:28:34,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-12-06 02:28:34,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867464068] [2022-12-06 02:28:34,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:28:34,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 02:28:34,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:34,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 02:28:34,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-06 02:28:34,800 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-06 02:28:34,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 2369 transitions, 52673 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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 02:28:34,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:34,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-06 02:28:34,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:42,436 INFO L130 PetriNetUnfolder]: 21852/29809 cut-off events. [2022-12-06 02:28:42,437 INFO L131 PetriNetUnfolder]: For 165865/169848 co-relation queries the response was YES. [2022-12-06 02:28:42,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336158 conditions, 29809 events. 21852/29809 cut-off events. For 165865/169848 co-relation queries the response was YES. Maximal size of possible extension queue 935. Compared 165033 event pairs, 1266 based on Foata normal form. 513/22322 useless extension candidates. Maximal degree in co-relation 57852. Up to 23438 conditions per place. [2022-12-06 02:28:42,671 INFO L137 encePairwiseOnDemand]: 30/36 looper letters, 3132 selfloop transitions, 86 changer transitions 444/3666 dead transitions. [2022-12-06 02:28:42,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 3666 transitions, 88748 flow [2022-12-06 02:28:42,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 02:28:42,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 02:28:42,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2022-12-06 02:28:42,672 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5648148148148148 [2022-12-06 02:28:42,673 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 45 predicate places. [2022-12-06 02:28:42,674 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:42,674 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 3666 transitions, 88748 flow [2022-12-06 02:28:43,076 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 3666 transitions, 88748 flow [2022-12-06 02:28:43,077 INFO L188 LiptonReduction]: Number of co-enabled transitions 32 [2022-12-06 02:28:43,089 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:43,092 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 419 [2022-12-06 02:28:43,092 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 3666 transitions, 88748 flow [2022-12-06 02:28:43,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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 02:28:43,093 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:43,093 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:43,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 02:28:43,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:43,300 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:28:43,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:43,300 INFO L85 PathProgramCache]: Analyzing trace with hash 406538786, now seen corresponding path program 2 times [2022-12-06 02:28:43,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:43,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264862293] [2022-12-06 02:28:43,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:43,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:43,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:43,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:28:43,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:43,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264862293] [2022-12-06 02:28:43,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264862293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:28:43,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:28:43,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 02:28:43,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444395914] [2022-12-06 02:28:43,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:28:43,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 02:28:43,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:43,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 02:28:43,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 02:28:43,388 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-06 02:28:43,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 3666 transitions, 88748 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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 02:28:43,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:43,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-06 02:28:43,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:50,825 INFO L130 PetriNetUnfolder]: 14605/20093 cut-off events. [2022-12-06 02:28:50,825 INFO L131 PetriNetUnfolder]: For 88723/90586 co-relation queries the response was YES. [2022-12-06 02:28:50,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241997 conditions, 20093 events. 14605/20093 cut-off events. For 88723/90586 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 106461 event pairs, 1250 based on Foata normal form. 69/15377 useless extension candidates. Maximal degree in co-relation 62958. Up to 16894 conditions per place. [2022-12-06 02:28:50,986 INFO L137 encePairwiseOnDemand]: 30/36 looper letters, 1986 selfloop transitions, 9 changer transitions 435/2433 dead transitions. [2022-12-06 02:28:50,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 2433 transitions, 63793 flow [2022-12-06 02:28:50,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:28:50,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:28:50,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2022-12-06 02:28:50,987 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 02:28:50,987 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 49 predicate places. [2022-12-06 02:28:50,988 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:50,988 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 2433 transitions, 63793 flow [2022-12-06 02:28:51,179 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 2433 transitions, 63793 flow [2022-12-06 02:28:51,179 INFO L188 LiptonReduction]: Number of co-enabled transitions 30 [2022-12-06 02:28:51,188 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:51,188 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 201 [2022-12-06 02:28:51,188 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 2433 transitions, 63793 flow [2022-12-06 02:28:51,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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 02:28:51,188 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:51,189 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:51,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 02:28:51,189 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:28:51,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:51,189 INFO L85 PathProgramCache]: Analyzing trace with hash -512855443, now seen corresponding path program 1 times [2022-12-06 02:28:51,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:51,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334619407] [2022-12-06 02:28:51,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:51,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:51,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:28:51,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:51,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334619407] [2022-12-06 02:28:51,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334619407] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:28:51,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745911261] [2022-12-06 02:28:51,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:51,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:51,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:28:51,364 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:28:51,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 02:28:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:51,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 02:28:51,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:28:51,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:28:51,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:28:51,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 02:28:51,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:28:51,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745911261] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:28:51,613 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:28:51,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-12-06 02:28:51,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180469450] [2022-12-06 02:28:51,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:28:51,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 02:28:51,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:51,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 02:28:51,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-12-06 02:28:51,616 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2022-12-06 02:28:51,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 2433 transitions, 63793 flow. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 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 02:28:51,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:51,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2022-12-06 02:28:51,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:57,922 INFO L130 PetriNetUnfolder]: 15508/21368 cut-off events. [2022-12-06 02:28:57,923 INFO L131 PetriNetUnfolder]: For 116863/118984 co-relation queries the response was YES. [2022-12-06 02:28:57,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276511 conditions, 21368 events. 15508/21368 cut-off events. For 116863/118984 co-relation queries the response was YES. Maximal size of possible extension queue 669. Compared 114923 event pairs, 1370 based on Foata normal form. 58/16449 useless extension candidates. Maximal degree in co-relation 67642. Up to 18021 conditions per place. [2022-12-06 02:28:58,090 INFO L137 encePairwiseOnDemand]: 26/36 looper letters, 1965 selfloop transitions, 159 changer transitions 595/2729 dead transitions. [2022-12-06 02:28:58,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 2729 transitions, 76955 flow [2022-12-06 02:28:58,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 02:28:58,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 02:28:58,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2022-12-06 02:28:58,091 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46875 [2022-12-06 02:28:58,092 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 56 predicate places. [2022-12-06 02:28:58,092 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:58,092 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 2729 transitions, 76955 flow [2022-12-06 02:28:58,262 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 2729 transitions, 76955 flow [2022-12-06 02:28:58,262 INFO L188 LiptonReduction]: Number of co-enabled transitions 36 [2022-12-06 02:28:58,271 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:58,272 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 02:28:58,272 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 2729 transitions, 76955 flow [2022-12-06 02:28:58,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 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 02:28:58,272 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:58,272 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:58,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 02:28:58,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:58,473 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:28:58,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:58,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1988709901, now seen corresponding path program 2 times [2022-12-06 02:28:58,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:58,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783627619] [2022-12-06 02:28:58,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:58,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:58,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:28:58,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:58,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783627619] [2022-12-06 02:28:58,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783627619] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:28:58,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005973709] [2022-12-06 02:28:58,778 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:28:58,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:58,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:28:58,779 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:28:58,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 02:28:58,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:28:58,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:28:58,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-06 02:28:58,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:28:58,912 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 342 treesize of output 334 [2022-12-06 02:28:59,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:28:59,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:28:59,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:28:59,032 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_526 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_526) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) (+ |c_thread1Thread1of1ForFork1_~j~0#1| 1))) is different from false [2022-12-06 02:28:59,047 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 41 treesize of output 25 [2022-12-06 02:28:59,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:28:59,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005973709] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:28:59,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:28:59,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-06 02:28:59,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162398957] [2022-12-06 02:28:59,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:28:59,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 02:28:59,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:59,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 02:28:59,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=134, Unknown=1, NotChecked=24, Total=210 [2022-12-06 02:28:59,117 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2022-12-06 02:28:59,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 2729 transitions, 76955 flow. Second operand has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 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 02:28:59,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:59,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2022-12-06 02:28:59,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:06,445 INFO L130 PetriNetUnfolder]: 16067/22196 cut-off events. [2022-12-06 02:29:06,446 INFO L131 PetriNetUnfolder]: For 147422/149961 co-relation queries the response was YES. [2022-12-06 02:29:06,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306298 conditions, 22196 events. 16067/22196 cut-off events. For 147422/149961 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 120562 event pairs, 1346 based on Foata normal form. 50/17227 useless extension candidates. Maximal degree in co-relation 71859. Up to 18506 conditions per place. [2022-12-06 02:29:06,641 INFO L137 encePairwiseOnDemand]: 20/36 looper letters, 2095 selfloop transitions, 78 changer transitions 831/3014 dead transitions. [2022-12-06 02:29:06,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 3014 transitions, 90972 flow [2022-12-06 02:29:06,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 02:29:06,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 02:29:06,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2022-12-06 02:29:06,642 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37777777777777777 [2022-12-06 02:29:06,642 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 65 predicate places. [2022-12-06 02:29:06,643 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:06,643 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 3014 transitions, 90972 flow [2022-12-06 02:29:06,830 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 3014 transitions, 90972 flow [2022-12-06 02:29:06,831 INFO L188 LiptonReduction]: Number of co-enabled transitions 36 [2022-12-06 02:29:06,841 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:29:06,841 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 198 [2022-12-06 02:29:06,841 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 3014 transitions, 90972 flow [2022-12-06 02:29:06,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 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 02:29:06,842 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:06,842 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:29:06,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 02:29:07,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-06 02:29:07,047 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:29:07,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:07,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1120039537, now seen corresponding path program 3 times [2022-12-06 02:29:07,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:07,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994118925] [2022-12-06 02:29:07,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:07,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:07,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:07,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:29:07,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:07,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994118925] [2022-12-06 02:29:07,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994118925] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:07,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024043592] [2022-12-06 02:29:07,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:29:07,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:07,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:29:07,424 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:29:07,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 02:29:07,622 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 02:29:07,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:29:07,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 02:29:07,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:29:07,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:29:07,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:29:07,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:29:07,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:29:07,765 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_587 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_587) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) (+ |c_thread1Thread1of1ForFork1_~j~0#1| 1))) is different from false [2022-12-06 02:29:07,783 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 41 treesize of output 25 [2022-12-06 02:29:07,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:29:07,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024043592] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:29:07,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:29:07,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2022-12-06 02:29:07,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307286389] [2022-12-06 02:29:07,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:29:07,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 02:29:07,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:07,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 02:29:07,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=139, Unknown=1, NotChecked=24, Total=210 [2022-12-06 02:29:07,841 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2022-12-06 02:29:07,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 3014 transitions, 90972 flow. Second operand has 15 states, 15 states have (on average 4.733333333333333) internal successors, (71), 15 states have internal predecessors, (71), 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 02:29:07,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:07,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2022-12-06 02:29:07,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:15,507 INFO L130 PetriNetUnfolder]: 15943/22000 cut-off events. [2022-12-06 02:29:15,508 INFO L131 PetriNetUnfolder]: For 180352/183981 co-relation queries the response was YES. [2022-12-06 02:29:15,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323358 conditions, 22000 events. 15943/22000 cut-off events. For 180352/183981 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 119170 event pairs, 1366 based on Foata normal form. 60/17061 useless extension candidates. Maximal degree in co-relation 77028. Up to 18353 conditions per place. [2022-12-06 02:29:15,850 INFO L137 encePairwiseOnDemand]: 20/36 looper letters, 2057 selfloop transitions, 69 changer transitions 841/2977 dead transitions. [2022-12-06 02:29:15,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 2977 transitions, 95774 flow [2022-12-06 02:29:15,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 02:29:15,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 02:29:15,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2022-12-06 02:29:15,852 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2022-12-06 02:29:15,852 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 74 predicate places. [2022-12-06 02:29:15,852 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:15,852 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 2977 transitions, 95774 flow [2022-12-06 02:29:16,025 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 2977 transitions, 95774 flow [2022-12-06 02:29:16,026 INFO L188 LiptonReduction]: Number of co-enabled transitions 36 [2022-12-06 02:29:16,033 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:29:16,034 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 02:29:16,034 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 2977 transitions, 95774 flow [2022-12-06 02:29:16,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.733333333333333) internal successors, (71), 15 states have internal predecessors, (71), 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 02:29:16,034 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:16,035 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:29:16,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 02:29:16,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 02:29:16,236 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:29:16,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:16,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1574028257, now seen corresponding path program 4 times [2022-12-06 02:29:16,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:16,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659608790] [2022-12-06 02:29:16,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:16,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:16,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:29:16,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:16,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659608790] [2022-12-06 02:29:16,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659608790] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:16,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600340201] [2022-12-06 02:29:16,618 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:29:16,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:16,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:29:16,619 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:29:16,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 02:29:16,719 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:29:16,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:29:16,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 02:29:16,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:29:16,897 INFO L321 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2022-12-06 02:29:16,897 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 19 treesize of output 13 [2022-12-06 02:29:16,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:29:16,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:29:17,120 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:29:17,121 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 25 treesize of output 21 [2022-12-06 02:29:17,218 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:29:17,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600340201] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:29:17,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:29:17,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 23 [2022-12-06 02:29:17,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558503733] [2022-12-06 02:29:17,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:29:17,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 02:29:17,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:17,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 02:29:17,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2022-12-06 02:29:17,220 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 02:29:17,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 2977 transitions, 95774 flow. Second operand has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 states have internal predecessors, (73), 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 02:29:17,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:17,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 02:29:17,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:38,160 INFO L130 PetriNetUnfolder]: 32027/44052 cut-off events. [2022-12-06 02:29:38,160 INFO L131 PetriNetUnfolder]: For 331298/331298 co-relation queries the response was YES. [2022-12-06 02:29:38,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 702512 conditions, 44052 events. 32027/44052 cut-off events. For 331298/331298 co-relation queries the response was YES. Maximal size of possible extension queue 1298. Compared 255646 event pairs, 498 based on Foata normal form. 0/33139 useless extension candidates. Maximal degree in co-relation 187812. Up to 38702 conditions per place. [2022-12-06 02:29:38,687 INFO L137 encePairwiseOnDemand]: 14/36 looper letters, 5071 selfloop transitions, 2080 changer transitions 1202/8353 dead transitions. [2022-12-06 02:29:38,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 8353 transitions, 281907 flow [2022-12-06 02:29:38,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-12-06 02:29:38,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2022-12-06 02:29:38,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 814 transitions. [2022-12-06 02:29:38,691 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29365079365079366 [2022-12-06 02:29:38,691 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 150 predicate places. [2022-12-06 02:29:38,691 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:38,692 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 186 places, 8353 transitions, 281907 flow [2022-12-06 02:29:39,107 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 8353 transitions, 281907 flow [2022-12-06 02:29:39,107 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:29:42,527 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:29:42,528 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3837 [2022-12-06 02:29:42,528 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 8352 transitions, 281873 flow [2022-12-06 02:29:42,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 states have internal predecessors, (73), 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 02:29:42,528 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:42,528 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:29:42,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 02:29:42,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:42,729 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:29:42,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:42,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1652768485, now seen corresponding path program 2 times [2022-12-06 02:29:42,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:42,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429192910] [2022-12-06 02:29:42,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:42,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:43,108 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:29:43,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:43,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429192910] [2022-12-06 02:29:43,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429192910] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:43,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634053418] [2022-12-06 02:29:43,109 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:29:43,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:43,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:29:43,112 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:29:43,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 02:29:43,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:29:43,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:29:43,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-06 02:29:43,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:29:43,553 INFO L321 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2022-12-06 02:29:43,554 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 17 treesize of output 13 [2022-12-06 02:29:43,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:29:43,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:29:43,737 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:29:43,738 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 24 treesize of output 20 [2022-12-06 02:29:43,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:29:43,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634053418] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:29:43,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:29:43,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 28 [2022-12-06 02:29:43,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515223637] [2022-12-06 02:29:43,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:29:43,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-06 02:29:43,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:43,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-06 02:29:43,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=677, Unknown=0, NotChecked=0, Total=812 [2022-12-06 02:29:43,898 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 02:29:43,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 8352 transitions, 281873 flow. Second operand has 29 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 28 states have internal predecessors, (73), 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 02:29:43,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:43,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 02:29:43,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:31:52,695 INFO L130 PetriNetUnfolder]: 76706/105406 cut-off events. [2022-12-06 02:31:52,696 INFO L131 PetriNetUnfolder]: For 766133/766133 co-relation queries the response was YES. [2022-12-06 02:31:52,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1800023 conditions, 105406 events. 76706/105406 cut-off events. For 766133/766133 co-relation queries the response was YES. Maximal size of possible extension queue 3215. Compared 685550 event pairs, 871 based on Foata normal form. 0/78095 useless extension candidates. Maximal degree in co-relation 371442. Up to 94308 conditions per place. [2022-12-06 02:31:53,809 INFO L137 encePairwiseOnDemand]: 17/37 looper letters, 15368 selfloop transitions, 2600 changer transitions 2527/20495 dead transitions. [2022-12-06 02:31:53,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 20495 transitions, 733472 flow [2022-12-06 02:31:53,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-06 02:31:53,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2022-12-06 02:31:53,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 563 transitions. [2022-12-06 02:31:53,811 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40042674253200566 [2022-12-06 02:31:53,812 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 186 predicate places. [2022-12-06 02:31:53,812 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:31:53,812 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 222 places, 20495 transitions, 733472 flow [2022-12-06 02:31:55,263 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 222 places, 20495 transitions, 733472 flow [2022-12-06 02:31:55,263 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:31:55,314 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:31:55,315 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1503 [2022-12-06 02:31:55,315 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 20495 transitions, 733472 flow [2022-12-06 02:31:55,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 28 states have internal predecessors, (73), 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 02:31:55,315 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:31:55,315 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:31:55,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 02:31:55,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 02:31:55,521 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:31:55,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:31:55,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1873221913, now seen corresponding path program 3 times [2022-12-06 02:31:55,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:31:55,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124588102] [2022-12-06 02:31:55,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:31:55,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:31:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:31:56,026 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:31:56,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:31:56,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124588102] [2022-12-06 02:31:56,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124588102] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:31:56,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109435362] [2022-12-06 02:31:56,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:31:56,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:31:56,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:31:56,032 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:31:56,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 02:31:56,422 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 02:31:56,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:31:56,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 02:31:56,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:31:56,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:31:56,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 02:31:56,745 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:31:56,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:31:56,852 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:31:56,852 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 42 treesize of output 38 [2022-12-06 02:31:56,855 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 9 treesize of output 3 [2022-12-06 02:31:56,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:31:56,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109435362] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:31:56,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:31:56,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2022-12-06 02:31:56,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054840121] [2022-12-06 02:31:56,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:31:56,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-06 02:31:56,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:31:56,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-06 02:31:56,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=720, Unknown=5, NotChecked=0, Total=812 [2022-12-06 02:31:56,975 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 02:31:56,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 20495 transitions, 733472 flow. Second operand has 29 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 28 states have internal predecessors, (72), 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 02:31:56,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:31:56,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 02:31:56,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-06 02:41:03,196 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 02:41:03,196 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 02:41:03,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-06 02:41:03,390 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 02:41:03,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 02:41:03,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-06 02:41:03,591 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (29states, 0/37 universal loopers) in iteration 18,while PetriNetUnfolder was constructing finite prefix that currently has 2133244 conditions, 118558 events (86778/118557 cut-off events. For 969699/969699 co-relation queries the response was YES. Maximal size of possible extension queue 5122. Compared 825114 event pairs, 1155 based on Foata normal form. 0/92495 useless extension candidates. Maximal degree in co-relation 449861. Up to 103945 conditions per place.). [2022-12-06 02:41:03,592 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 02:41:03,593 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 02:41:03,593 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 02:41:03,593 INFO L458 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:03,595 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 02:41:03,595 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 02:41:03,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 02:41:03 BasicIcfg [2022-12-06 02:41:03,597 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 02:41:03,598 INFO L158 Benchmark]: Toolchain (without parser) took 784358.71ms. Allocated memory was 189.8MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 150.9MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 4.7GB. Max. memory is 8.0GB. [2022-12-06 02:41:03,598 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 189.8MB. Free memory is still 166.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 02:41:03,598 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.30ms. Allocated memory is still 189.8MB. Free memory was 150.9MB in the beginning and 137.8MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 02:41:03,598 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.94ms. Allocated memory is still 189.8MB. Free memory was 137.8MB in the beginning and 135.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 02:41:03,598 INFO L158 Benchmark]: Boogie Preprocessor took 40.60ms. Allocated memory is still 189.8MB. Free memory was 135.2MB in the beginning and 133.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 02:41:03,598 INFO L158 Benchmark]: RCFGBuilder took 736.15ms. Allocated memory is still 189.8MB. Free memory was 133.1MB in the beginning and 97.5MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-06 02:41:03,599 INFO L158 Benchmark]: TraceAbstraction took 783191.22ms. Allocated memory was 189.8MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 96.9MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 4.6GB. Max. memory is 8.0GB. [2022-12-06 02:41:03,600 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 189.8MB. Free memory is still 166.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 318.30ms. Allocated memory is still 189.8MB. Free memory was 150.9MB in the beginning and 137.8MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.94ms. Allocated memory is still 189.8MB. Free memory was 137.8MB in the beginning and 135.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.60ms. Allocated memory is still 189.8MB. Free memory was 135.2MB in the beginning and 133.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 736.15ms. Allocated memory is still 189.8MB. Free memory was 133.1MB in the beginning and 97.5MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 783191.22ms. Allocated memory was 189.8MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 96.9MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 4.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.8s, 206 PlacesBefore, 36 PlacesAfterwards, 221 TransitionsBefore, 34 TransitionsAfterwards, 6720 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 100 TrivialYvCompositions, 70 ConcurrentYvCompositions, 17 ChoiceCompositions, 188 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4753, independent: 4719, independent conditional: 4719, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4753, independent: 4719, independent conditional: 0, independent unconditional: 4719, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4753, independent: 4719, independent conditional: 0, independent unconditional: 4719, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4753, independent: 4719, independent conditional: 0, independent unconditional: 4719, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4299, independent: 4273, independent conditional: 0, independent unconditional: 4273, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4299, independent: 4273, independent conditional: 0, independent unconditional: 4273, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 80, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4753, independent: 446, independent conditional: 0, independent unconditional: 446, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 4299, unknown conditional: 0, unknown unconditional: 4299] , Statistics on independence cache: Total cache size (in pairs): 7846, Positive cache size: 7820, Positive conditional cache size: 0, Positive unconditional cache size: 7820, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 39 PlacesBefore, 38 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 140 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: 2.9s, 42 PlacesBefore, 41 PlacesAfterwards, 65 TransitionsBefore, 64 TransitionsAfterwards, 116 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: 3.1s, 45 PlacesBefore, 44 PlacesAfterwards, 102 TransitionsBefore, 101 TransitionsAfterwards, 112 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, 46 PlacesBefore, 46 PlacesAfterwards, 189 TransitionsBefore, 189 TransitionsAfterwards, 218 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, 50 PlacesBefore, 50 PlacesAfterwards, 413 TransitionsBefore, 413 TransitionsAfterwards, 470 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, 54 PlacesBefore, 54 PlacesAfterwards, 537 TransitionsBefore, 537 TransitionsAfterwards, 556 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, 58 PlacesBefore, 58 PlacesAfterwards, 999 TransitionsBefore, 999 TransitionsAfterwards, 970 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, 62 PlacesBefore, 62 PlacesAfterwards, 1070 TransitionsBefore, 1070 TransitionsAfterwards, 804 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 69 PlacesBefore, 69 PlacesAfterwards, 1294 TransitionsBefore, 1294 TransitionsAfterwards, 1056 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, 76 PlacesBefore, 76 PlacesAfterwards, 2369 TransitionsBefore, 2369 TransitionsAfterwards, 2128 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, 81 PlacesBefore, 81 PlacesAfterwards, 3666 TransitionsBefore, 3666 TransitionsAfterwards, 32 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, 85 PlacesBefore, 85 PlacesAfterwards, 2433 TransitionsBefore, 2433 TransitionsAfterwards, 30 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, 92 PlacesBefore, 92 PlacesAfterwards, 2729 TransitionsBefore, 2729 TransitionsAfterwards, 36 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, 101 PlacesBefore, 101 PlacesAfterwards, 3014 TransitionsBefore, 3014 TransitionsAfterwards, 36 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, 110 PlacesBefore, 110 PlacesAfterwards, 2977 TransitionsBefore, 2977 TransitionsAfterwards, 36 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: 3.4s, 186 PlacesBefore, 185 PlacesAfterwards, 8353 TransitionsBefore, 8352 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.1s, 222 PlacesBefore, 222 PlacesAfterwards, 20495 TransitionsBefore, 20495 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 - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (29states, 0/37 universal loopers) in iteration 18,while PetriNetUnfolder was constructing finite prefix that currently has 2133244 conditions, 118558 events (86778/118557 cut-off events. For 969699/969699 co-relation queries the response was YES. Maximal size of possible extension queue 5122. Compared 825114 event pairs, 1155 based on Foata normal form. 0/92495 useless extension candidates. Maximal degree in co-relation 449861. Up to 103945 conditions per place.). - TimeoutResultAtElement [Line: 101]: 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 (29states, 0/37 universal loopers) in iteration 18,while PetriNetUnfolder was constructing finite prefix that currently has 2133244 conditions, 118558 events (86778/118557 cut-off events. For 969699/969699 co-relation queries the response was YES. Maximal size of possible extension queue 5122. Compared 825114 event pairs, 1155 based on Foata normal form. 0/92495 useless extension candidates. Maximal degree in co-relation 449861. Up to 103945 conditions per place.). - TimeoutResultAtElement [Line: 100]: 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 (29states, 0/37 universal loopers) in iteration 18,while PetriNetUnfolder was constructing finite prefix that currently has 2133244 conditions, 118558 events (86778/118557 cut-off events. For 969699/969699 co-relation queries the response was YES. Maximal size of possible extension queue 5122. Compared 825114 event pairs, 1155 based on Foata normal form. 0/92495 useless extension candidates. Maximal degree in co-relation 449861. Up to 103945 conditions per place.). - TimeoutResultAtElement [Line: 99]: 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 (29states, 0/37 universal loopers) in iteration 18,while PetriNetUnfolder was constructing finite prefix that currently has 2133244 conditions, 118558 events (86778/118557 cut-off events. For 969699/969699 co-relation queries the response was YES. Maximal size of possible extension queue 5122. Compared 825114 event pairs, 1155 based on Foata normal form. 0/92495 useless extension candidates. Maximal degree in co-relation 449861. Up to 103945 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 285 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 783.0s, OverallIterations: 18, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 749.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.1s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 3391 SdHoareTripleChecker+Valid, 7.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3391 mSDsluCounter, 636 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 139 IncrementalHoareTripleChecker+Unchecked, 580 mSDsCounter, 164 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12736 IncrementalHoareTripleChecker+Invalid, 13050 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 164 mSolverCounterUnsat, 56 mSDtfsCounter, 12736 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 722 GetRequests, 385 SyntacticMatches, 7 SemanticMatches, 330 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 4147 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=733472occurred in iteration=17, InterpolantAutomatonStates: 209, 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.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 705 NumberOfCodeBlocks, 699 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 885 ConstructedInterpolants, 25 QuantifiedInterpolants, 5636 SizeOfPredicates, 110 NumberOfNonLiveVariables, 2385 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 35 InterpolantComputations, 10 PerfectInterpolantSequences, 97/133 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