/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-prod-cons-eq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:37:47,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:37:47,427 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:37:47,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:37:47,464 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:37:47,467 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:37:47,469 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:37:47,473 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:37:47,477 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:37:47,482 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:37:47,483 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:37:47,484 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:37:47,485 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:37:47,487 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:37:47,488 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:37:47,490 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:37:47,491 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:37:47,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:37:47,494 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:37:47,498 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:37:47,499 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:37:47,500 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:37:47,501 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:37:47,502 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:37:47,504 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:37:47,505 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:37:47,505 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:37:47,507 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:37:47,507 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:37:47,508 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:37:47,508 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:37:47,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:37:47,511 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:37:47,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:37:47,512 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:37:47,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:37:47,513 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:37:47,513 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:37:47,513 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:37:47,514 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:37:47,515 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:37:47,515 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:37:47,546 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:37:47,546 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:37:47,548 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:37:47,548 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:37:47,548 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:37:47,549 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:37:47,549 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:37:47,549 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:37:47,549 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:37:47,549 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:37:47,550 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:37:47,550 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:37:47,550 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:37:47,550 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:37:47,550 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:37:47,551 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:37:47,551 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:37:47,551 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:37:47,551 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:37:47,551 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:37:47,551 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:37:47,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:37:47,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:37:47,552 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:37:47,552 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:37:47,552 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:37:47,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:37:47,552 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:37:47,553 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 05:37:47,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:37:47,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:37:47,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:37:47,896 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:37:47,897 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:37:47,898 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-prod-cons-eq.wvr.c [2022-12-06 05:37:49,104 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:37:49,347 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:37:49,348 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons-eq.wvr.c [2022-12-06 05:37:49,354 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa09fe9d8/6d997e41f5a24f77a6cfe7b53808769b/FLAGdcec2e343 [2022-12-06 05:37:49,365 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa09fe9d8/6d997e41f5a24f77a6cfe7b53808769b [2022-12-06 05:37:49,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:37:49,371 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:37:49,374 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:37:49,374 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:37:49,377 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:37:49,377 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:37:49" (1/1) ... [2022-12-06 05:37:49,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3df15e8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:49, skipping insertion in model container [2022-12-06 05:37:49,378 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:37:49" (1/1) ... [2022-12-06 05:37:49,384 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:37:49,412 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:37:49,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:37:49,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:37:49,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:37:49,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:37:49,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:37:49,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:37:49,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:37:49,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:37:49,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:37:49,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:37:49,560 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons-eq.wvr.c[4380,4393] [2022-12-06 05:37:49,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:37:49,586 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:37:49,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:37:49,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:37:49,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:37:49,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:37:49,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:37:49,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:37:49,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:37:49,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:37:49,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:37:49,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:37:49,638 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons-eq.wvr.c[4380,4393] [2022-12-06 05:37:49,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:37:49,671 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:37:49,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:49 WrapperNode [2022-12-06 05:37:49,673 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:37:49,674 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:37:49,674 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:37:49,674 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:37:49,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:49" (1/1) ... [2022-12-06 05:37:49,702 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:49" (1/1) ... [2022-12-06 05:37:49,749 INFO L138 Inliner]: procedures = 28, calls = 80, calls flagged for inlining = 26, calls inlined = 32, statements flattened = 393 [2022-12-06 05:37:49,749 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:37:49,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:37:49,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:37:49,750 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:37:49,758 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:49" (1/1) ... [2022-12-06 05:37:49,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:49" (1/1) ... [2022-12-06 05:37:49,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:49" (1/1) ... [2022-12-06 05:37:49,771 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:49" (1/1) ... [2022-12-06 05:37:49,781 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:49" (1/1) ... [2022-12-06 05:37:49,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:49" (1/1) ... [2022-12-06 05:37:49,788 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:49" (1/1) ... [2022-12-06 05:37:49,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:49" (1/1) ... [2022-12-06 05:37:49,804 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:37:49,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:37:49,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:37:49,805 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:37:49,805 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:49" (1/1) ... [2022-12-06 05:37:49,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:37:49,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:37:49,833 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 05:37:49,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 05:37:49,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:37:49,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-06 05:37:49,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:37:49,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:37:49,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:37:49,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-06 05:37:49,871 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:37:49,871 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:37:49,871 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:37:49,871 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:37:49,871 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:37:49,871 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:37:49,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:37:49,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 05:37:49,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 05:37:49,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:37:49,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:37:49,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:37:49,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:37:49,875 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:37:50,000 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:37:50,009 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:37:50,537 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:37:50,732 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:37:50,732 INFO L302 CfgBuilder]: Removed 9 assume(true) statements. [2022-12-06 05:37:50,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:37:50 BoogieIcfgContainer [2022-12-06 05:37:50,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:37:50,736 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:37:50,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:37:50,739 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:37:50,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:37:49" (1/3) ... [2022-12-06 05:37:50,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bcb11b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:37:50, skipping insertion in model container [2022-12-06 05:37:50,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:49" (2/3) ... [2022-12-06 05:37:50,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bcb11b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:37:50, skipping insertion in model container [2022-12-06 05:37:50,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:37:50" (3/3) ... [2022-12-06 05:37:50,741 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons-eq.wvr.c [2022-12-06 05:37:50,758 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:37:50,758 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:37:50,758 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:37:50,876 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 05:37:50,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 347 places, 374 transitions, 772 flow [2022-12-06 05:37:51,075 INFO L130 PetriNetUnfolder]: 37/371 cut-off events. [2022-12-06 05:37:51,075 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:37:51,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 371 events. 37/371 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 400 event pairs, 0 based on Foata normal form. 0/333 useless extension candidates. Maximal degree in co-relation 292. Up to 2 conditions per place. [2022-12-06 05:37:51,085 INFO L82 GeneralOperation]: Start removeDead. Operand has 347 places, 374 transitions, 772 flow [2022-12-06 05:37:51,095 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 334 places, 361 transitions, 740 flow [2022-12-06 05:37:51,098 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:51,114 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 334 places, 361 transitions, 740 flow [2022-12-06 05:37:51,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 334 places, 361 transitions, 740 flow [2022-12-06 05:37:51,255 INFO L130 PetriNetUnfolder]: 37/361 cut-off events. [2022-12-06 05:37:51,256 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:37:51,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 361 events. 37/361 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 377 event pairs, 0 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 292. Up to 2 conditions per place. [2022-12-06 05:37:51,265 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 334 places, 361 transitions, 740 flow [2022-12-06 05:37:51,265 INFO L188 LiptonReduction]: Number of co-enabled transitions 4578 [2022-12-06 05:37:52,167 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:52,169 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 05:37:52,173 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:52,173 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 05:37:52,354 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:52,355 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 05:37:52,358 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:52,359 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 05:37:53,060 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:53,061 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 05:37:53,063 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:53,063 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 05:37:54,128 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:54,129 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 05:37:54,131 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:54,131 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 05:37:55,238 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:55,239 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 05:37:55,242 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:55,243 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 05:37:55,502 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:55,503 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 05:37:55,504 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:55,505 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 05:37:56,283 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:56,284 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 05:37:56,286 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:56,286 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 05:37:56,874 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:56,874 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 05:37:56,876 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:56,877 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 05:37:57,468 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:57,469 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 05:37:57,471 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:57,472 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 05:37:57,642 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:57,643 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 05:38:00,843 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:38:00,844 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 05:38:00,845 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:38:00,846 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 05:38:01,744 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:38:01,745 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 05:38:01,748 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:38:01,749 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 05:38:05,802 INFO L203 LiptonReduction]: Total number of compositions: 327 [2022-12-06 05:38:05,814 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:38:05,819 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;@66c1b04d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:38:05,819 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 05:38:05,825 INFO L130 PetriNetUnfolder]: 10/35 cut-off events. [2022-12-06 05:38:05,825 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:38:05,826 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:05,826 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] [2022-12-06 05:38:05,827 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 05:38:05,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:05,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1167228973, now seen corresponding path program 1 times [2022-12-06 05:38:05,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:05,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060736858] [2022-12-06 05:38:05,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:05,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:06,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:38:06,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:06,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060736858] [2022-12-06 05:38:06,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060736858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:38:06,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:38:06,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:38:06,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317931343] [2022-12-06 05:38:06,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:38:06,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:38:06,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:06,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:38:06,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:38:06,396 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2022-12-06 05:38:06,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 36 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:06,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:06,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2022-12-06 05:38:06,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:06,546 INFO L130 PetriNetUnfolder]: 251/392 cut-off events. [2022-12-06 05:38:06,546 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-12-06 05:38:06,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 392 events. 251/392 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1425 event pairs, 67 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 656. Up to 227 conditions per place. [2022-12-06 05:38:06,552 INFO L137 encePairwiseOnDemand]: 32/36 looper letters, 43 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2022-12-06 05:38:06,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 208 flow [2022-12-06 05:38:06,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:38:06,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:38:06,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-06 05:38:06,563 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 05:38:06,565 INFO L175 Difference]: Start difference. First operand has 36 places, 36 transitions, 90 flow. Second operand 3 states and 54 transitions. [2022-12-06 05:38:06,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 208 flow [2022-12-06 05:38:06,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 47 transitions, 192 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 05:38:06,573 INFO L231 Difference]: Finished difference. Result has 33 places, 36 transitions, 88 flow [2022-12-06 05:38:06,574 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=33, PETRI_TRANSITIONS=36} [2022-12-06 05:38:06,579 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-06 05:38:06,579 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:06,580 INFO L89 Accepts]: Start accepts. Operand has 33 places, 36 transitions, 88 flow [2022-12-06 05:38:06,582 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:06,582 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:06,583 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 36 transitions, 88 flow [2022-12-06 05:38:06,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 36 transitions, 88 flow [2022-12-06 05:38:06,592 INFO L130 PetriNetUnfolder]: 9/36 cut-off events. [2022-12-06 05:38:06,593 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:38:06,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 36 events. 9/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 33. Up to 4 conditions per place. [2022-12-06 05:38:06,594 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 36 transitions, 88 flow [2022-12-06 05:38:06,594 INFO L188 LiptonReduction]: Number of co-enabled transitions 190 [2022-12-06 05:38:06,611 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:38:06,612 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-06 05:38:06,613 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 36 transitions, 88 flow [2022-12-06 05:38:06,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:06,613 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:06,614 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 05:38:06,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:38:06,614 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 05:38:06,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:06,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1822223421, now seen corresponding path program 1 times [2022-12-06 05:38:06,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:06,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141949422] [2022-12-06 05:38:06,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:06,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:06,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:38:06,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:06,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141949422] [2022-12-06 05:38:06,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141949422] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:38:06,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:38:06,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:38:06,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499437721] [2022-12-06 05:38:06,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:38:06,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:38:06,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:06,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:38:06,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:38:06,809 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 35 [2022-12-06 05:38:06,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 36 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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 05:38:06,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:06,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 35 [2022-12-06 05:38:06,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:07,011 INFO L130 PetriNetUnfolder]: 303/497 cut-off events. [2022-12-06 05:38:07,011 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2022-12-06 05:38:07,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1145 conditions, 497 events. 303/497 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1834 event pairs, 224 based on Foata normal form. 22/405 useless extension candidates. Maximal degree in co-relation 558. Up to 385 conditions per place. [2022-12-06 05:38:07,014 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 35 selfloop transitions, 2 changer transitions 16/55 dead transitions. [2022-12-06 05:38:07,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 55 transitions, 237 flow [2022-12-06 05:38:07,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:38:07,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:38:07,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-06 05:38:07,021 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2022-12-06 05:38:07,021 INFO L175 Difference]: Start difference. First operand has 33 places, 36 transitions, 88 flow. Second operand 4 states and 62 transitions. [2022-12-06 05:38:07,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 55 transitions, 237 flow [2022-12-06 05:38:07,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 55 transitions, 235 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:38:07,025 INFO L231 Difference]: Finished difference. Result has 37 places, 37 transitions, 102 flow [2022-12-06 05:38:07,025 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=37, PETRI_TRANSITIONS=37} [2022-12-06 05:38:07,026 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2022-12-06 05:38:07,026 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:07,026 INFO L89 Accepts]: Start accepts. Operand has 37 places, 37 transitions, 102 flow [2022-12-06 05:38:07,028 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:07,028 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:07,028 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 37 transitions, 102 flow [2022-12-06 05:38:07,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 37 transitions, 102 flow [2022-12-06 05:38:07,037 INFO L130 PetriNetUnfolder]: 13/47 cut-off events. [2022-12-06 05:38:07,037 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:38:07,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 47 events. 13/47 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 1 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 49. Up to 6 conditions per place. [2022-12-06 05:38:07,038 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 37 transitions, 102 flow [2022-12-06 05:38:07,038 INFO L188 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-06 05:38:07,039 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:38:07,040 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 05:38:07,040 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 37 transitions, 102 flow [2022-12-06 05:38:07,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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 05:38:07,040 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:07,041 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 05:38:07,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:38:07,041 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 05:38:07,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:07,042 INFO L85 PathProgramCache]: Analyzing trace with hash -495616721, now seen corresponding path program 1 times [2022-12-06 05:38:07,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:07,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059698021] [2022-12-06 05:38:07,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:07,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:07,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:38:07,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:07,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059698021] [2022-12-06 05:38:07,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059698021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:38:07,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:38:07,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:38:07,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029264032] [2022-12-06 05:38:07,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:38:07,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:38:07,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:07,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:38:07,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:38:07,242 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 35 [2022-12-06 05:38:07,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 37 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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 05:38:07,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:07,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 35 [2022-12-06 05:38:07,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:07,429 INFO L130 PetriNetUnfolder]: 325/561 cut-off events. [2022-12-06 05:38:07,430 INFO L131 PetriNetUnfolder]: For 248/248 co-relation queries the response was YES. [2022-12-06 05:38:07,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1349 conditions, 561 events. 325/561 cut-off events. For 248/248 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2358 event pairs, 241 based on Foata normal form. 40/535 useless extension candidates. Maximal degree in co-relation 943. Up to 388 conditions per place. [2022-12-06 05:38:07,433 INFO L137 encePairwiseOnDemand]: 25/35 looper letters, 34 selfloop transitions, 2 changer transitions 49/87 dead transitions. [2022-12-06 05:38:07,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 87 transitions, 406 flow [2022-12-06 05:38:07,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:38:07,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:38:07,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2022-12-06 05:38:07,435 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2022-12-06 05:38:07,435 INFO L175 Difference]: Start difference. First operand has 36 places, 37 transitions, 102 flow. Second operand 5 states and 95 transitions. [2022-12-06 05:38:07,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 87 transitions, 406 flow [2022-12-06 05:38:07,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 87 transitions, 400 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:38:07,437 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 130 flow [2022-12-06 05:38:07,438 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=130, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2022-12-06 05:38:07,438 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2022-12-06 05:38:07,439 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:07,439 INFO L89 Accepts]: Start accepts. Operand has 42 places, 38 transitions, 130 flow [2022-12-06 05:38:07,440 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:07,440 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:07,440 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 38 transitions, 130 flow [2022-12-06 05:38:07,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 38 transitions, 130 flow [2022-12-06 05:38:07,449 INFO L130 PetriNetUnfolder]: 16/55 cut-off events. [2022-12-06 05:38:07,450 INFO L131 PetriNetUnfolder]: For 31/35 co-relation queries the response was YES. [2022-12-06 05:38:07,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 55 events. 16/55 cut-off events. For 31/35 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 75 event pairs, 2 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 96. Up to 11 conditions per place. [2022-12-06 05:38:07,450 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 38 transitions, 130 flow [2022-12-06 05:38:07,451 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-06 05:38:07,455 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:38:07,456 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 05:38:07,457 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:38:07,458 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 05:38:09,705 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:38:09,706 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2267 [2022-12-06 05:38:09,707 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 126 flow [2022-12-06 05:38:09,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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 05:38:09,707 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:09,707 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 05:38:09,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:38:09,707 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 05:38:09,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:09,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1729534404, now seen corresponding path program 1 times [2022-12-06 05:38:09,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:09,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341503174] [2022-12-06 05:38:09,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:09,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:09,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:38:09,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:09,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341503174] [2022-12-06 05:38:09,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341503174] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:38:09,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:38:09,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:38:09,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530382055] [2022-12-06 05:38:09,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:38:09,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:38:09,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:09,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:38:09,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:38:09,842 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 35 [2022-12-06 05:38:09,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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 05:38:09,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:09,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 35 [2022-12-06 05:38:09,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:10,065 INFO L130 PetriNetUnfolder]: 358/609 cut-off events. [2022-12-06 05:38:10,066 INFO L131 PetriNetUnfolder]: For 864/864 co-relation queries the response was YES. [2022-12-06 05:38:10,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1604 conditions, 609 events. 358/609 cut-off events. For 864/864 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2643 event pairs, 265 based on Foata normal form. 80/656 useless extension candidates. Maximal degree in co-relation 1590. Up to 388 conditions per place. [2022-12-06 05:38:10,070 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 34 selfloop transitions, 2 changer transitions 40/78 dead transitions. [2022-12-06 05:38:10,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 78 transitions, 400 flow [2022-12-06 05:38:10,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:38:10,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:38:10,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-06 05:38:10,074 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49714285714285716 [2022-12-06 05:38:10,074 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 126 flow. Second operand 5 states and 87 transitions. [2022-12-06 05:38:10,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 78 transitions, 400 flow [2022-12-06 05:38:10,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 78 transitions, 372 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-06 05:38:10,079 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 132 flow [2022-12-06 05:38:10,079 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2022-12-06 05:38:10,080 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2022-12-06 05:38:10,080 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:10,080 INFO L89 Accepts]: Start accepts. Operand has 44 places, 38 transitions, 132 flow [2022-12-06 05:38:10,082 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:10,082 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:10,082 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 38 transitions, 132 flow [2022-12-06 05:38:10,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 38 transitions, 132 flow [2022-12-06 05:38:10,093 INFO L130 PetriNetUnfolder]: 16/56 cut-off events. [2022-12-06 05:38:10,093 INFO L131 PetriNetUnfolder]: For 72/80 co-relation queries the response was YES. [2022-12-06 05:38:10,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 56 events. 16/56 cut-off events. For 72/80 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 75 event pairs, 2 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 90. Up to 10 conditions per place. [2022-12-06 05:38:10,094 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 38 transitions, 132 flow [2022-12-06 05:38:10,094 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-06 05:38:10,098 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:38:10,099 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 05:38:10,101 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:38:10,103 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 05:38:10,415 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:38:10,416 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 336 [2022-12-06 05:38:10,417 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 128 flow [2022-12-06 05:38:10,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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 05:38:10,417 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:10,417 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 05:38:10,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:38:10,417 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 05:38:10,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:10,418 INFO L85 PathProgramCache]: Analyzing trace with hash 930135992, now seen corresponding path program 1 times [2022-12-06 05:38:10,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:10,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097406028] [2022-12-06 05:38:10,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:10,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:10,549 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 05:38:10,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:10,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097406028] [2022-12-06 05:38:10,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097406028] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:38:10,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:38:10,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:38:10,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718717067] [2022-12-06 05:38:10,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:38:10,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:38:10,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:10,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:38:10,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:38:10,557 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 05:38:10,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:10,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:10,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 05:38:10,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:10,721 INFO L130 PetriNetUnfolder]: 608/887 cut-off events. [2022-12-06 05:38:10,722 INFO L131 PetriNetUnfolder]: For 1748/1748 co-relation queries the response was YES. [2022-12-06 05:38:10,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2686 conditions, 887 events. 608/887 cut-off events. For 1748/1748 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3038 event pairs, 153 based on Foata normal form. 34/852 useless extension candidates. Maximal degree in co-relation 2639. Up to 569 conditions per place. [2022-12-06 05:38:10,728 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 50 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2022-12-06 05:38:10,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 290 flow [2022-12-06 05:38:10,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:38:10,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:38:10,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-06 05:38:10,730 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2022-12-06 05:38:10,730 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 128 flow. Second operand 3 states and 50 transitions. [2022-12-06 05:38:10,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 290 flow [2022-12-06 05:38:10,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 52 transitions, 254 flow, removed 18 selfloop flow, removed 5 redundant places. [2022-12-06 05:38:10,752 INFO L231 Difference]: Finished difference. Result has 39 places, 38 transitions, 116 flow [2022-12-06 05:38:10,752 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=39, PETRI_TRANSITIONS=38} [2022-12-06 05:38:10,754 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2022-12-06 05:38:10,754 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:10,754 INFO L89 Accepts]: Start accepts. Operand has 39 places, 38 transitions, 116 flow [2022-12-06 05:38:10,757 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:10,757 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:10,757 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 38 transitions, 116 flow [2022-12-06 05:38:10,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 38 transitions, 116 flow [2022-12-06 05:38:10,769 INFO L130 PetriNetUnfolder]: 19/72 cut-off events. [2022-12-06 05:38:10,769 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 05:38:10,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 72 events. 19/72 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 146 event pairs, 4 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 100. Up to 13 conditions per place. [2022-12-06 05:38:10,770 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 38 transitions, 116 flow [2022-12-06 05:38:10,770 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 05:38:10,771 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:38:10,772 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 05:38:10,772 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 38 transitions, 116 flow [2022-12-06 05:38:10,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:10,773 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:10,774 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:38:10,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:38:10,774 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 05:38:10,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:10,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1033831297, now seen corresponding path program 1 times [2022-12-06 05:38:10,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:10,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470659768] [2022-12-06 05:38:10,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:10,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:10,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:38:10,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:10,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470659768] [2022-12-06 05:38:10,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470659768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:38:10,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:38:10,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:38:10,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432341161] [2022-12-06 05:38:10,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:38:10,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:38:10,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:10,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:38:10,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:38:10,956 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 35 [2022-12-06 05:38:10,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 38 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:10,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:10,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 35 [2022-12-06 05:38:10,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:11,123 INFO L130 PetriNetUnfolder]: 423/669 cut-off events. [2022-12-06 05:38:11,123 INFO L131 PetriNetUnfolder]: For 472/472 co-relation queries the response was YES. [2022-12-06 05:38:11,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1870 conditions, 669 events. 423/669 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2642 event pairs, 329 based on Foata normal form. 26/637 useless extension candidates. Maximal degree in co-relation 1707. Up to 619 conditions per place. [2022-12-06 05:38:11,128 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 35 selfloop transitions, 2 changer transitions 19/58 dead transitions. [2022-12-06 05:38:11,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 58 transitions, 289 flow [2022-12-06 05:38:11,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:38:11,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:38:11,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-12-06 05:38:11,130 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36 [2022-12-06 05:38:11,130 INFO L175 Difference]: Start difference. First operand has 39 places, 38 transitions, 116 flow. Second operand 5 states and 63 transitions. [2022-12-06 05:38:11,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 58 transitions, 289 flow [2022-12-06 05:38:11,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 58 transitions, 287 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:38:11,132 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 132 flow [2022-12-06 05:38:11,133 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2022-12-06 05:38:11,135 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2022-12-06 05:38:11,135 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:11,135 INFO L89 Accepts]: Start accepts. Operand has 45 places, 39 transitions, 132 flow [2022-12-06 05:38:11,136 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:11,136 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:11,137 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 39 transitions, 132 flow [2022-12-06 05:38:11,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 39 transitions, 132 flow [2022-12-06 05:38:11,149 INFO L130 PetriNetUnfolder]: 25/85 cut-off events. [2022-12-06 05:38:11,150 INFO L131 PetriNetUnfolder]: For 36/37 co-relation queries the response was YES. [2022-12-06 05:38:11,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 85 events. 25/85 cut-off events. For 36/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 226 event pairs, 9 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 153. Up to 18 conditions per place. [2022-12-06 05:38:11,151 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 39 transitions, 132 flow [2022-12-06 05:38:11,151 INFO L188 LiptonReduction]: Number of co-enabled transitions 208 [2022-12-06 05:38:11,156 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:38:11,157 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 05:38:11,159 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:38:11,159 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 05:38:11,467 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:38:11,468 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 333 [2022-12-06 05:38:11,468 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 128 flow [2022-12-06 05:38:11,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:11,469 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:11,469 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:38:11,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:38:11,469 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 05:38:11,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:11,469 INFO L85 PathProgramCache]: Analyzing trace with hash -574189053, now seen corresponding path program 1 times [2022-12-06 05:38:11,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:11,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801899169] [2022-12-06 05:38:11,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:11,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:11,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:38:11,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:11,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801899169] [2022-12-06 05:38:11,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801899169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:38:11,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:38:11,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:38:11,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176209009] [2022-12-06 05:38:11,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:38:11,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:38:11,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:11,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:38:11,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:38:11,779 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 05:38:11,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:11,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:11,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 05:38:11,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:12,082 INFO L130 PetriNetUnfolder]: 1202/1733 cut-off events. [2022-12-06 05:38:12,083 INFO L131 PetriNetUnfolder]: For 1382/1382 co-relation queries the response was YES. [2022-12-06 05:38:12,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4931 conditions, 1733 events. 1202/1733 cut-off events. For 1382/1382 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6944 event pairs, 196 based on Foata normal form. 62/1663 useless extension candidates. Maximal degree in co-relation 4906. Up to 820 conditions per place. [2022-12-06 05:38:12,095 INFO L137 encePairwiseOnDemand]: 28/35 looper letters, 69 selfloop transitions, 12 changer transitions 0/81 dead transitions. [2022-12-06 05:38:12,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 81 transitions, 449 flow [2022-12-06 05:38:12,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:38:12,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:38:12,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-12-06 05:38:12,096 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4228571428571429 [2022-12-06 05:38:12,096 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 128 flow. Second operand 5 states and 74 transitions. [2022-12-06 05:38:12,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 81 transitions, 449 flow [2022-12-06 05:38:12,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 81 transitions, 439 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-06 05:38:12,099 INFO L231 Difference]: Finished difference. Result has 47 places, 49 transitions, 238 flow [2022-12-06 05:38:12,099 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=238, PETRI_PLACES=47, PETRI_TRANSITIONS=49} [2022-12-06 05:38:12,100 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2022-12-06 05:38:12,100 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:12,100 INFO L89 Accepts]: Start accepts. Operand has 47 places, 49 transitions, 238 flow [2022-12-06 05:38:12,101 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:12,101 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:12,101 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 49 transitions, 238 flow [2022-12-06 05:38:12,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 49 transitions, 238 flow [2022-12-06 05:38:12,138 INFO L130 PetriNetUnfolder]: 78/194 cut-off events. [2022-12-06 05:38:12,139 INFO L131 PetriNetUnfolder]: For 321/339 co-relation queries the response was YES. [2022-12-06 05:38:12,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 194 events. 78/194 cut-off events. For 321/339 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 824 event pairs, 16 based on Foata normal form. 10/197 useless extension candidates. Maximal degree in co-relation 574. Up to 60 conditions per place. [2022-12-06 05:38:12,141 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 49 transitions, 238 flow [2022-12-06 05:38:12,141 INFO L188 LiptonReduction]: Number of co-enabled transitions 340 [2022-12-06 05:38:12,142 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:38:12,145 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-06 05:38:12,145 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 49 transitions, 238 flow [2022-12-06 05:38:12,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:12,145 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:12,145 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:38:12,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:38:12,146 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 05:38:12,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:12,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1239831263, now seen corresponding path program 2 times [2022-12-06 05:38:12,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:12,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711873201] [2022-12-06 05:38:12,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:12,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:12,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:38:12,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:12,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711873201] [2022-12-06 05:38:12,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711873201] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:38:12,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25168694] [2022-12-06 05:38:12,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:38:12,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:38:12,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:38:12,467 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:38:12,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 05:38:12,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:38:12,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:38:12,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 05:38:12,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:38:12,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:38:12,892 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:38:12,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25168694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:38:12,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:38:12,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-12-06 05:38:12,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451241950] [2022-12-06 05:38:12,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:38:12,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:38:12,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:12,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:38:12,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:38:12,893 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 05:38:12,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 49 transitions, 238 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:12,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:12,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 05:38:12,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:13,430 INFO L130 PetriNetUnfolder]: 2012/2899 cut-off events. [2022-12-06 05:38:13,431 INFO L131 PetriNetUnfolder]: For 5844/5844 co-relation queries the response was YES. [2022-12-06 05:38:13,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10788 conditions, 2899 events. 2012/2899 cut-off events. For 5844/5844 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 12787 event pairs, 283 based on Foata normal form. 38/2710 useless extension candidates. Maximal degree in co-relation 10736. Up to 1035 conditions per place. [2022-12-06 05:38:13,454 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 91 selfloop transitions, 19 changer transitions 0/110 dead transitions. [2022-12-06 05:38:13,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 110 transitions, 779 flow [2022-12-06 05:38:13,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:38:13,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:38:13,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-12-06 05:38:13,455 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3904761904761905 [2022-12-06 05:38:13,455 INFO L175 Difference]: Start difference. First operand has 47 places, 49 transitions, 238 flow. Second operand 6 states and 82 transitions. [2022-12-06 05:38:13,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 110 transitions, 779 flow [2022-12-06 05:38:13,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 110 transitions, 779 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 05:38:13,461 INFO L231 Difference]: Finished difference. Result has 56 places, 64 transitions, 465 flow [2022-12-06 05:38:13,461 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=465, PETRI_PLACES=56, PETRI_TRANSITIONS=64} [2022-12-06 05:38:13,462 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places. [2022-12-06 05:38:13,462 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:13,462 INFO L89 Accepts]: Start accepts. Operand has 56 places, 64 transitions, 465 flow [2022-12-06 05:38:13,463 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:13,463 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:13,464 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 64 transitions, 465 flow [2022-12-06 05:38:13,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 64 transitions, 465 flow [2022-12-06 05:38:13,504 INFO L130 PetriNetUnfolder]: 122/328 cut-off events. [2022-12-06 05:38:13,504 INFO L131 PetriNetUnfolder]: For 971/999 co-relation queries the response was YES. [2022-12-06 05:38:13,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1250 conditions, 328 events. 122/328 cut-off events. For 971/999 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1740 event pairs, 27 based on Foata normal form. 19/338 useless extension candidates. Maximal degree in co-relation 1209. Up to 94 conditions per place. [2022-12-06 05:38:13,508 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 64 transitions, 465 flow [2022-12-06 05:38:13,509 INFO L188 LiptonReduction]: Number of co-enabled transitions 554 [2022-12-06 05:38:13,510 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:38:13,511 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 05:38:13,511 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 64 transitions, 465 flow [2022-12-06 05:38:13,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:13,511 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:13,511 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:38:13,520 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 05:38:13,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:38:13,721 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 05:38:13,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:13,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1394933921, now seen corresponding path program 1 times [2022-12-06 05:38:13,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:13,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994401081] [2022-12-06 05:38:13,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:13,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:14,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 05:38:14,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:14,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994401081] [2022-12-06 05:38:14,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994401081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:38:14,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:38:14,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:38:14,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3710789] [2022-12-06 05:38:14,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:38:14,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:38:14,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:14,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:38:14,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:38:14,166 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 35 [2022-12-06 05:38:14,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 64 transitions, 465 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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 05:38:14,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:14,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 35 [2022-12-06 05:38:14,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:15,374 INFO L130 PetriNetUnfolder]: 4684/7161 cut-off events. [2022-12-06 05:38:15,374 INFO L131 PetriNetUnfolder]: For 45113/46363 co-relation queries the response was YES. [2022-12-06 05:38:15,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31782 conditions, 7161 events. 4684/7161 cut-off events. For 45113/46363 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 42926 event pairs, 2652 based on Foata normal form. 1139/7703 useless extension candidates. Maximal degree in co-relation 18374. Up to 2414 conditions per place. [2022-12-06 05:38:15,439 INFO L137 encePairwiseOnDemand]: 26/35 looper letters, 95 selfloop transitions, 9 changer transitions 87/202 dead transitions. [2022-12-06 05:38:15,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 202 transitions, 1833 flow [2022-12-06 05:38:15,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:38:15,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:38:15,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2022-12-06 05:38:15,440 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6047619047619047 [2022-12-06 05:38:15,440 INFO L175 Difference]: Start difference. First operand has 56 places, 64 transitions, 465 flow. Second operand 6 states and 127 transitions. [2022-12-06 05:38:15,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 202 transitions, 1833 flow [2022-12-06 05:38:15,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 202 transitions, 1776 flow, removed 28 selfloop flow, removed 1 redundant places. [2022-12-06 05:38:15,463 INFO L231 Difference]: Finished difference. Result has 65 places, 70 transitions, 518 flow [2022-12-06 05:38:15,463 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=518, PETRI_PLACES=65, PETRI_TRANSITIONS=70} [2022-12-06 05:38:15,464 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 29 predicate places. [2022-12-06 05:38:15,464 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:15,465 INFO L89 Accepts]: Start accepts. Operand has 65 places, 70 transitions, 518 flow [2022-12-06 05:38:15,466 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:15,466 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:15,466 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 70 transitions, 518 flow [2022-12-06 05:38:15,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 70 transitions, 518 flow [2022-12-06 05:38:15,548 INFO L130 PetriNetUnfolder]: 242/654 cut-off events. [2022-12-06 05:38:15,549 INFO L131 PetriNetUnfolder]: For 2086/2122 co-relation queries the response was YES. [2022-12-06 05:38:15,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2547 conditions, 654 events. 242/654 cut-off events. For 2086/2122 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4302 event pairs, 54 based on Foata normal form. 10/652 useless extension candidates. Maximal degree in co-relation 2503. Up to 187 conditions per place. [2022-12-06 05:38:15,557 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 70 transitions, 518 flow [2022-12-06 05:38:15,558 INFO L188 LiptonReduction]: Number of co-enabled transitions 554 [2022-12-06 05:38:15,564 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:38:15,567 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 05:38:15,571 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:38:15,572 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 05:38:16,382 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:38:16,383 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 919 [2022-12-06 05:38:16,383 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 69 transitions, 514 flow [2022-12-06 05:38:16,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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 05:38:16,383 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:16,384 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:38:16,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 05:38:16,384 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 05:38:16,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:16,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1175650389, now seen corresponding path program 1 times [2022-12-06 05:38:16,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:16,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194588166] [2022-12-06 05:38:16,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:16,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:16,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-06 05:38:16,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:16,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194588166] [2022-12-06 05:38:16,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194588166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:38:16,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:38:16,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:38:16,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035096603] [2022-12-06 05:38:16,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:38:16,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:38:16,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:16,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:38:16,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:38:16,600 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2022-12-06 05:38:16,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 69 transitions, 514 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:16,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:16,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2022-12-06 05:38:16,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:17,475 INFO L130 PetriNetUnfolder]: 3546/5229 cut-off events. [2022-12-06 05:38:17,475 INFO L131 PetriNetUnfolder]: For 31828/32712 co-relation queries the response was YES. [2022-12-06 05:38:17,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23355 conditions, 5229 events. 3546/5229 cut-off events. For 31828/32712 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 27783 event pairs, 1986 based on Foata normal form. 550/5259 useless extension candidates. Maximal degree in co-relation 23306. Up to 4970 conditions per place. [2022-12-06 05:38:17,516 INFO L137 encePairwiseOnDemand]: 31/36 looper letters, 55 selfloop transitions, 4 changer transitions 0/70 dead transitions. [2022-12-06 05:38:17,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 70 transitions, 634 flow [2022-12-06 05:38:17,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:38:17,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:38:17,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-06 05:38:17,517 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3055555555555556 [2022-12-06 05:38:17,517 INFO L175 Difference]: Start difference. First operand has 62 places, 69 transitions, 514 flow. Second operand 4 states and 44 transitions. [2022-12-06 05:38:17,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 70 transitions, 634 flow [2022-12-06 05:38:17,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 70 transitions, 603 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-12-06 05:38:17,604 INFO L231 Difference]: Finished difference. Result has 62 places, 70 transitions, 499 flow [2022-12-06 05:38:17,605 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=499, PETRI_PLACES=62, PETRI_TRANSITIONS=70} [2022-12-06 05:38:17,605 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 26 predicate places. [2022-12-06 05:38:17,605 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:17,605 INFO L89 Accepts]: Start accepts. Operand has 62 places, 70 transitions, 499 flow [2022-12-06 05:38:17,609 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:17,609 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:17,609 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 70 transitions, 499 flow [2022-12-06 05:38:17,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 70 transitions, 499 flow [2022-12-06 05:38:17,686 INFO L130 PetriNetUnfolder]: 242/655 cut-off events. [2022-12-06 05:38:17,686 INFO L131 PetriNetUnfolder]: For 1716/1760 co-relation queries the response was YES. [2022-12-06 05:38:17,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2418 conditions, 655 events. 242/655 cut-off events. For 1716/1760 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4271 event pairs, 54 based on Foata normal form. 18/661 useless extension candidates. Maximal degree in co-relation 2355. Up to 187 conditions per place. [2022-12-06 05:38:17,695 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 70 transitions, 499 flow [2022-12-06 05:38:17,695 INFO L188 LiptonReduction]: Number of co-enabled transitions 554 [2022-12-06 05:38:17,708 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1581] L149-6-->L149-14: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_93| v_~n_update~0_109) (= (store |v_#memory_int_359| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_217| (store (select |v_#memory_int_359| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_217|) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_217| |v_ULTIMATE.start_create_fresh_int_array_#t~nondet48#1_177|)) |v_#memory_int_358|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_217| 0) (= (select |v_#valid_271| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_217|) 0) (= (store |v_#length_262| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_217| (* (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_239| 1073741824) 4)) |v_#length_261|) (<= 0 (+ |v_ULTIMATE.start_create_fresh_int_array_#t~nondet48#1_177| 2147483648)) (= v_~produce~0.base_111 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_218|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_217| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_218| v_~produce~0.offset_111) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_227| |v_ULTIMATE.start_create_fresh_int_array_~size#1_240|)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_93| |v_ULTIMATE.start_create_fresh_int_array_~size#1_239|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_225| 1) (= (store |v_#memory_$Pointer$.base_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_217| (store (select |v_#memory_$Pointer$.base_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_217|) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_217| (select (select |v_#memory_$Pointer$.base_221| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_217|) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_217|))) |v_#memory_$Pointer$.base_221|) (< 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_239|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_291| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_331|) (= |v_#memory_$Pointer$.offset_221| (store |v_#memory_$Pointer$.offset_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_217| (store (select |v_#memory_$Pointer$.offset_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_217|) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_217| (select (select |v_#memory_$Pointer$.offset_221| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_217|) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_217|)))) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_217| |v_#StackHeapBarrier_117|) (= |v_#valid_270| (store |v_#valid_271| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_217| 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_291| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_239| 4294967296) 1073741823) 1 0)) (<= |v_ULTIMATE.start_create_fresh_int_array_#t~nondet48#1_177| 2147483647) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_331| 0))) InVars {~n_update~0=v_~n_update~0_109, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_218|, #StackHeapBarrier=|v_#StackHeapBarrier_117|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_222|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_218|, #valid=|v_#valid_271|, #memory_int=|v_#memory_int_359|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_227|, #length=|v_#length_262|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_222|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_240|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_217|, ULTIMATE.start_create_fresh_int_array_#t~nondet48#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet48#1_176|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_221|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_217|, ULTIMATE.start_create_fresh_int_array_#t~malloc46#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc46#1.offset_171|, ~produce~0.base=v_~produce~0.base_111, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_225|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_239|, ~n_update~0=v_~n_update~0_109, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_131|, #StackHeapBarrier=|v_#StackHeapBarrier_117|, ULTIMATE.start_create_fresh_int_array_#t~post47#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post47#1_143|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_93|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_331|, #valid=|v_#valid_270|, #memory_int=|v_#memory_int_358|, ULTIMATE.start_main_#t~ret30#1.base=|v_ULTIMATE.start_main_#t~ret30#1.base_61|, ULTIMATE.start_main_#t~ret30#1.offset=|v_ULTIMATE.start_main_#t~ret30#1.offset_61|, #length=|v_#length_261|, ~produce~0.offset=v_~produce~0.offset_111, ULTIMATE.start_create_fresh_int_array_#t~malloc46#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc46#1.base_171|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_221|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_291|} AuxVars[|v_ULTIMATE.start_create_fresh_int_array_#t~nondet48#1_177|] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet48#1, #memory_$Pointer$.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc46#1.offset, ~produce~0.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~post47#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #memory_int, ULTIMATE.start_main_#t~ret30#1.base, ULTIMATE.start_main_#t~ret30#1.offset, #length, ~produce~0.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc46#1.base, #memory_$Pointer$.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [1573] L149-22-->L160-6: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_201| |v_ULTIMATE.start_create_fresh_int_array_~size#1_223|)) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_bool_array_~size#1_42|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_119| v_~queue1~0.base_123) (= |v_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.offset_41| 0) (= |v_ULTIMATE.start_create_fresh_bool_array_#in~size#1_21| |v_ULTIMATE.start_create_fresh_bool_array_~size#1_42|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_277| 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_119| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_199|) (= |v_ULTIMATE.start_create_fresh_bool_array_#in~size#1_21| v_~n_update~0_101) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_277| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_313|) (not (= |v_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base_41| 0)) (= |v_ULTIMATE.start_create_fresh_bool_array_~i~2#1_50| 0) (< |v_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base_41| |v_#StackHeapBarrier_103|) (= (select |v_#valid_243| |v_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base_41|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_119| v_~queue1~0.offset_123) (= (store |v_#length_234| |v_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base_41| (mod |v_ULTIMATE.start_create_fresh_bool_array_~size#1_42| 4294967296)) |v_#length_233|) (= |v_#valid_242| (store |v_#valid_243| |v_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base_41| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_119| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_199|)) InVars {~n_update~0=v_~n_update~0_101, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_199|, #StackHeapBarrier=|v_#StackHeapBarrier_103|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_199|, #valid=|v_#valid_243|, #length=|v_#length_234|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_201|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_223|} OutVars{ULTIMATE.start_create_fresh_bool_array_~i~2#1=|v_ULTIMATE.start_create_fresh_bool_array_~i~2#1_50|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_199|, ULTIMATE.start_main_#t~ret32#1.base=|v_ULTIMATE.start_main_#t~ret32#1.base_51|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_201|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_119|, ~n_update~0=v_~n_update~0_101, ULTIMATE.start_create_fresh_bool_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_bool_array_#res#1.offset_34|, ~queue1~0.base=v_~queue1~0.base_123, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_313|, #length=|v_#length_233|, ULTIMATE.start_create_fresh_bool_array_#t~post50#1=|v_ULTIMATE.start_create_fresh_bool_array_#t~post50#1_33|, ULTIMATE.start_main_#t~ret32#1.offset=|v_ULTIMATE.start_main_#t~ret32#1.offset_51|, ULTIMATE.start_create_fresh_bool_array_#in~size#1=|v_ULTIMATE.start_create_fresh_bool_array_#in~size#1_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_199|, ULTIMATE.start_create_fresh_bool_array_#t~malloc49#1.offset=|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc49#1.offset_45|, ULTIMATE.start_create_fresh_bool_array_#res#1.base=|v_ULTIMATE.start_create_fresh_bool_array_#res#1.base_34|, ULTIMATE.start_create_fresh_bool_array_~size#1=|v_ULTIMATE.start_create_fresh_bool_array_~size#1_42|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_223|, ULTIMATE.start_create_fresh_bool_array_#t~malloc49#1.base=|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc49#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_119|, ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base=|v_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base_41|, #StackHeapBarrier=|v_#StackHeapBarrier_103|, ULTIMATE.start_create_fresh_bool_array_~arr~1#1.offset=|v_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.offset_41|, #valid=|v_#valid_242|, ULTIMATE.start_create_fresh_bool_array_#t~nondet51#1=|v_ULTIMATE.start_create_fresh_bool_array_#t~nondet51#1_30|, ~queue1~0.offset=v_~queue1~0.offset_123, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_277|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_bool_array_~i~2#1, ULTIMATE.start_create_fresh_bool_array_#in~size#1, ULTIMATE.start_main_#t~ret32#1.base, ULTIMATE.start_create_fresh_bool_array_#t~malloc49#1.offset, ULTIMATE.start_create_fresh_bool_array_#res#1.base, ULTIMATE.start_create_fresh_bool_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_bool_array_#t~malloc49#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_bool_array_#res#1.offset, ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base, ~queue1~0.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_bool_array_~arr~1#1.offset, #valid, ULTIMATE.start_create_fresh_bool_array_#t~nondet51#1, #length, ~queue1~0.offset, ULTIMATE.start_create_fresh_bool_array_#t~post50#1, ULTIMATE.start_main_#t~ret32#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 05:38:18,395 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:38:18,395 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 05:38:18,397 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:38:18,397 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 05:38:19,530 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:38:19,531 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1926 [2022-12-06 05:38:19,531 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 69 transitions, 499 flow [2022-12-06 05:38:19,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:19,531 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:19,531 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:38:19,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 05:38:19,531 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 05:38:19,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:19,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1041482730, now seen corresponding path program 1 times [2022-12-06 05:38:19,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:19,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479992572] [2022-12-06 05:38:19,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:19,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:21,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:38:21,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:21,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479992572] [2022-12-06 05:38:21,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479992572] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:38:21,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778797808] [2022-12-06 05:38:21,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:21,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:38:21,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:38:21,862 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:38:21,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 05:38:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:22,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-06 05:38:22,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:38:22,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:38:22,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 05:38:22,280 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-06 05:38:22,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-06 05:38:22,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 05:38:22,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:38:22,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 05:38:22,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:38:22,440 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 42 treesize of output 38 [2022-12-06 05:38:22,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:38:22,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:38:22,455 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 05:38:22,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:38:22,582 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 33 treesize of output 31 [2022-12-06 05:38:22,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:38:22,593 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 05:38:22,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:38:22,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:38:22,863 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 49 treesize of output 49 [2022-12-06 05:38:22,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:38:22,884 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-12-06 05:38:22,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 69 [2022-12-06 05:38:22,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:38:22,893 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 57 treesize of output 55 [2022-12-06 05:38:22,906 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 52 treesize of output 34 [2022-12-06 05:38:23,056 INFO L321 Elim1Store]: treesize reduction 37, result has 49.3 percent of original size [2022-12-06 05:38:23,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 61 [2022-12-06 05:38:23,064 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 05:38:23,065 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2022-12-06 05:38:23,069 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 05:38:23,071 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:38:23,073 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 33 treesize of output 26 [2022-12-06 05:38:23,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:38:23,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:38:23,210 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_810 (Array Int Int)) (~produce~0.offset Int) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (~state21~0 Int) (~produce~0.base Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_810))) (let ((.cse2 (select (select .cse0 ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4))))) (or (= (let ((.cse1 (+ c_~consume~0.offset (* c_~state22~0 4)))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_811) c_~consume~0.base) .cse1)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_809) c_~consume~0.base) .cse1) (* .cse2 4)))) c_~state12~0) (not (< .cse2 c_~n2~0)) (not (<= 0 .cse2)))))) is different from false [2022-12-06 05:38:23,779 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:38:23,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 187 treesize of output 176 [2022-12-06 05:38:23,821 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:38:23,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 19810 treesize of output 19454 [2022-12-06 05:38:23,884 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:38:23,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19414 treesize of output 16354 [2022-12-06 05:38:24,005 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:38:24,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1794050 treesize of output 1744926 [2022-12-06 05:38:27,110 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:38:27,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1744886 treesize of output 1708034 [2022-12-06 05:38:28,559 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 1708022 treesize of output 1658870 [2022-12-06 05:38:29,858 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:38:29,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1658870 treesize of output 1585154 [2022-12-06 05:38:31,126 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:38:31,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1585142 treesize of output 1511426 [2022-12-06 05:38:32,167 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-06 05:38:32,369 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 1511414 treesize of output 1462262 [2022-12-06 05:38:33,584 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:38:33,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1462262 treesize of output 1425410 Received shutdown request... [2022-12-06 05:51:14,709 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-06 05:51:14,711 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 05:51:14,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 05:51:14,745 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 05:51:14,745 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 05:51:14,911 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,SelfDestructingSolverStorable10 [2022-12-06 05:51:14,912 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 31 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 41 for 9ms.. [2022-12-06 05:51:14,913 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 05:51:14,913 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 05:51:14,913 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 05:51:14,914 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:51:14,916 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 05:51:14,916 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 05:51:14,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:51:14 BasicIcfg [2022-12-06 05:51:14,919 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 05:51:14,919 INFO L158 Benchmark]: Toolchain (without parser) took 805547.77ms. Allocated memory was 203.4MB in the beginning and 897.6MB in the end (delta: 694.2MB). Free memory was 178.0MB in the beginning and 752.0MB in the end (delta: -573.9MB). Peak memory consumption was 615.5MB. Max. memory is 8.0GB. [2022-12-06 05:51:14,920 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 203.4MB. Free memory was 179.5MB in the beginning and 179.4MB in the end (delta: 78.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:51:14,921 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.98ms. Allocated memory is still 203.4MB. Free memory was 178.0MB in the beginning and 163.7MB in the end (delta: 14.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 05:51:14,921 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.58ms. Allocated memory is still 203.4MB. Free memory was 163.7MB in the beginning and 160.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 05:51:14,923 INFO L158 Benchmark]: Boogie Preprocessor took 53.85ms. Allocated memory is still 203.4MB. Free memory was 160.6MB in the beginning and 157.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 05:51:14,923 INFO L158 Benchmark]: RCFGBuilder took 930.21ms. Allocated memory is still 203.4MB. Free memory was 157.9MB in the beginning and 110.2MB in the end (delta: 47.7MB). Peak memory consumption was 47.2MB. Max. memory is 8.0GB. [2022-12-06 05:51:14,923 INFO L158 Benchmark]: TraceAbstraction took 804182.24ms. Allocated memory was 203.4MB in the beginning and 897.6MB in the end (delta: 694.2MB). Free memory was 109.7MB in the beginning and 752.0MB in the end (delta: -642.3MB). Peak memory consumption was 547.4MB. Max. memory is 8.0GB. [2022-12-06 05:51:14,925 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.12ms. Allocated memory is still 203.4MB. Free memory was 179.5MB in the beginning and 179.4MB in the end (delta: 78.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 298.98ms. Allocated memory is still 203.4MB. Free memory was 178.0MB in the beginning and 163.7MB in the end (delta: 14.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 75.58ms. Allocated memory is still 203.4MB. Free memory was 163.7MB in the beginning and 160.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.85ms. Allocated memory is still 203.4MB. Free memory was 160.6MB in the beginning and 157.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 930.21ms. Allocated memory is still 203.4MB. Free memory was 157.9MB in the beginning and 110.2MB in the end (delta: 47.7MB). Peak memory consumption was 47.2MB. Max. memory is 8.0GB. * TraceAbstraction took 804182.24ms. Allocated memory was 203.4MB in the beginning and 897.6MB in the end (delta: 694.2MB). Free memory was 109.7MB in the beginning and 752.0MB in the end (delta: -642.3MB). Peak memory consumption was 547.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.5s, 334 PlacesBefore, 36 PlacesAfterwards, 361 TransitionsBefore, 36 TransitionsAfterwards, 4578 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 227 TrivialYvCompositions, 71 ConcurrentYvCompositions, 27 ChoiceCompositions, 327 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3174, independent: 3153, independent conditional: 3153, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3174, independent: 3153, independent conditional: 0, independent unconditional: 3153, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3174, independent: 3153, independent conditional: 0, independent unconditional: 3153, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3174, independent: 3153, independent conditional: 0, independent unconditional: 3153, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2947, independent: 2936, independent conditional: 0, independent unconditional: 2936, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2947, independent: 2929, independent conditional: 0, independent unconditional: 2929, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 97, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3174, independent: 217, independent conditional: 0, independent unconditional: 217, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 2947, unknown conditional: 0, unknown unconditional: 2947] , Statistics on independence cache: Total cache size (in pairs): 5320, Positive cache size: 5309, Positive conditional cache size: 0, Positive unconditional cache size: 5309, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, 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, 33 PlacesBefore, 33 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 190 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 3, Positive conditional cache size: 0, Positive unconditional cache size: 3, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, 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, 36 PlacesBefore, 36 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, 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.3s, 40 PlacesBefore, 39 PlacesAfterwards, 38 TransitionsBefore, 37 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, 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.3s, 42 PlacesBefore, 41 PlacesAfterwards, 38 TransitionsBefore, 37 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, 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, 39 PlacesBefore, 39 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 43 PlacesBefore, 42 PlacesAfterwards, 39 TransitionsBefore, 38 TransitionsAfterwards, 208 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 340 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27, independent: 24, independent conditional: 9, independent unconditional: 15, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 24, independent conditional: 6, independent unconditional: 18, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 24, independent conditional: 6, independent unconditional: 18, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, independent: 22, independent conditional: 6, independent unconditional: 16, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 17, Positive cache size: 11, Positive conditional cache size: 0, Positive unconditional cache size: 11, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 554 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27, independent: 24, independent conditional: 18, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 24, independent conditional: 12, independent unconditional: 12, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 24, independent conditional: 12, independent unconditional: 12, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, independent: 23, independent conditional: 11, independent unconditional: 12, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 12, Positive conditional cache size: 1, Positive unconditional cache size: 11, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 63 PlacesBefore, 62 PlacesAfterwards, 70 TransitionsBefore, 69 TransitionsAfterwards, 554 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84, independent: 78, independent conditional: 78, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 84, independent: 78, independent conditional: 48, independent unconditional: 30, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 84, independent: 78, independent conditional: 36, independent unconditional: 42, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 84, independent: 78, independent conditional: 36, independent unconditional: 42, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 84, independent: 75, independent conditional: 34, independent unconditional: 41, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 15, Positive conditional cache size: 3, Positive unconditional cache size: 12, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 62 PlacesBefore, 62 PlacesAfterwards, 70 TransitionsBefore, 69 TransitionsAfterwards, 554 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84, independent: 78, independent conditional: 78, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 84, independent: 78, independent conditional: 48, independent unconditional: 30, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 84, independent: 78, independent conditional: 36, independent unconditional: 42, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 84, independent: 78, independent conditional: 36, independent unconditional: 42, dependent: 6, dependent conditional: 0, dependent unconditional: 6, 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: 84, independent: 78, independent conditional: 36, independent unconditional: 42, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 15, Positive conditional cache size: 3, Positive unconditional cache size: 12, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - TimeoutResultAtElement [Line: 139]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 31 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 41 for 9ms.. - TimeoutResultAtElement [Line: 132]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 31 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 41 for 9ms.. - TimeoutResultAtElement [Line: 133]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 31 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 41 for 9ms.. - TimeoutResultAtElement [Line: 131]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 31 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 41 for 9ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 410 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: 804.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 14.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 400 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 400 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 949 IncrementalHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 1 mSDtfsCounter, 949 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=518occurred in iteration=9, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 292 NumberOfCodeBlocks, 292 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 281 ConstructedInterpolants, 0 QuantifiedInterpolants, 696 SizeOfPredicates, 2 NumberOfNonLiveVariables, 485 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 26/27 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