/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/pthread/queue_ok_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:04:52,748 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:04:52,750 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:04:52,779 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:04:52,779 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:04:52,782 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:04:52,785 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:04:52,788 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:04:52,791 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:04:52,796 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:04:52,797 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:04:52,799 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:04:52,799 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:04:52,801 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:04:52,802 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:04:52,804 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:04:52,804 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:04:52,805 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:04:52,807 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:04:52,811 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:04:52,811 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:04:52,812 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:04:52,813 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:04:52,814 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:04:52,819 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:04:52,819 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:04:52,819 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:04:52,820 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:04:52,821 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:04:52,821 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:04:52,821 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:04:52,822 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:04:52,823 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:04:52,824 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:04:52,824 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:04:52,825 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:04:52,825 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:04:52,825 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:04:52,825 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:04:52,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:04:52,826 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:04:52,827 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 04:04:52,852 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:04:52,852 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:04:52,853 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:04:52,853 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:04:52,854 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:04:52,854 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:04:52,854 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:04:52,854 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:04:52,855 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:04:52,855 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:04:52,855 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:04:52,855 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:04:52,856 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:04:52,856 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:04:52,856 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:04:52,856 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:04:52,856 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:04:52,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:04:52,856 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:04:52,856 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:04:52,857 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:04:52,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:04:52,857 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:04:52,857 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:04:52,857 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:04:52,857 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:04:52,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:04:52,857 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:04:52,858 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 04:04:53,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:04:53,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:04:53,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:04:53,148 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:04:53,149 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:04:53,149 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longer.i [2022-12-06 04:04:54,233 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:04:54,487 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:04:54,487 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i [2022-12-06 04:04:54,496 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/358d5ccf5/f8742d4f110f4d05b4231c0d0107426f/FLAG848a100f4 [2022-12-06 04:04:54,507 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/358d5ccf5/f8742d4f110f4d05b4231c0d0107426f [2022-12-06 04:04:54,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:04:54,510 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:04:54,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:04:54,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:04:54,512 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:04:54,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:04:54" (1/1) ... [2022-12-06 04:04:54,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fd558d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:04:54, skipping insertion in model container [2022-12-06 04:04:54,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:04:54" (1/1) ... [2022-12-06 04:04:54,518 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:04:54,552 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:04:54,977 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43272,43285] [2022-12-06 04:04:54,981 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43545,43558] [2022-12-06 04:04:54,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:04:54,994 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:04:55,048 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43272,43285] [2022-12-06 04:04:55,053 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43545,43558] [2022-12-06 04:04:55,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:04:55,106 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:04:55,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:04:55 WrapperNode [2022-12-06 04:04:55,107 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:04:55,108 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:04:55,108 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:04:55,108 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:04:55,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:04:55" (1/1) ... [2022-12-06 04:04:55,139 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:04:55" (1/1) ... [2022-12-06 04:04:55,174 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-12-06 04:04:55,174 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:04:55,175 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:04:55,175 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:04:55,175 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:04:55,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:04:55" (1/1) ... [2022-12-06 04:04:55,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:04:55" (1/1) ... [2022-12-06 04:04:55,196 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:04:55" (1/1) ... [2022-12-06 04:04:55,196 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:04:55" (1/1) ... [2022-12-06 04:04:55,202 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:04:55" (1/1) ... [2022-12-06 04:04:55,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:04:55" (1/1) ... [2022-12-06 04:04:55,206 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:04:55" (1/1) ... [2022-12-06 04:04:55,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:04:55" (1/1) ... [2022-12-06 04:04:55,224 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:04:55,224 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:04:55,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:04:55,225 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:04:55,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:04:55" (1/1) ... [2022-12-06 04:04:55,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:04:55,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:04:55,250 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 04:04:55,252 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 04:04:55,289 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-06 04:04:55,290 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-06 04:04:55,290 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-06 04:04:55,290 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-06 04:04:55,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:04:55,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:04:55,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:04:55,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:04:55,290 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-06 04:04:55,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:04:55,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:04:55,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:04:55,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:04:55,291 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 04:04:55,474 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:04:55,477 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:04:55,852 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:04:55,858 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:04:55,858 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 04:04:55,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:04:55 BoogieIcfgContainer [2022-12-06 04:04:55,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:04:55,861 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:04:55,861 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:04:55,863 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:04:55,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:04:54" (1/3) ... [2022-12-06 04:04:55,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55ccdd63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:04:55, skipping insertion in model container [2022-12-06 04:04:55,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:04:55" (2/3) ... [2022-12-06 04:04:55,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55ccdd63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:04:55, skipping insertion in model container [2022-12-06 04:04:55,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:04:55" (3/3) ... [2022-12-06 04:04:55,865 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2022-12-06 04:04:55,877 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:04:55,877 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:04:55,877 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:04:55,961 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 04:04:55,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 215 transitions, 446 flow [2022-12-06 04:04:56,080 INFO L130 PetriNetUnfolder]: 13/213 cut-off events. [2022-12-06 04:04:56,080 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 04:04:56,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 213 events. 13/213 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 357 event pairs, 0 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 140. Up to 3 conditions per place. [2022-12-06 04:04:56,093 INFO L82 GeneralOperation]: Start removeDead. Operand has 209 places, 215 transitions, 446 flow [2022-12-06 04:04:56,098 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 204 transitions, 417 flow [2022-12-06 04:04:56,100 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:04:56,121 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 198 places, 204 transitions, 417 flow [2022-12-06 04:04:56,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 204 transitions, 417 flow [2022-12-06 04:04:56,201 INFO L130 PetriNetUnfolder]: 13/204 cut-off events. [2022-12-06 04:04:56,201 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 04:04:56,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 204 events. 13/204 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 293 event pairs, 0 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 140. Up to 3 conditions per place. [2022-12-06 04:04:56,215 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 204 transitions, 417 flow [2022-12-06 04:04:56,215 INFO L188 LiptonReduction]: Number of co-enabled transitions 9810 [2022-12-06 04:05:03,935 INFO L203 LiptonReduction]: Total number of compositions: 164 [2022-12-06 04:05:03,951 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:05:03,955 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;@2165bd8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:05:03,955 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 04:05:03,956 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-12-06 04:05:03,956 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:05:03,957 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:05:03,957 INFO L213 CegarLoopForPetriNet]: trace histogram [1] [2022-12-06 04:05:03,957 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:05:03,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:05:03,960 INFO L85 PathProgramCache]: Analyzing trace with hash 847, now seen corresponding path program 1 times [2022-12-06 04:05:03,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:05:03,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326687103] [2022-12-06 04:05:03,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:05:03,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:05:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:05:04,054 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 04:05:04,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:05:04,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326687103] [2022-12-06 04:05:04,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326687103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:05:04,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:05:04,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-06 04:05:04,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616175189] [2022-12-06 04:05:04,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:05:04,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 04:05:04,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:05:04,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 04:05:04,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 04:05:04,081 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 47 [2022-12-06 04:05:04,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 103 flow. Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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 04:05:04,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:05:04,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 47 [2022-12-06 04:05:04,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:05:04,251 INFO L130 PetriNetUnfolder]: 751/1277 cut-off events. [2022-12-06 04:05:04,251 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-12-06 04:05:04,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2501 conditions, 1277 events. 751/1277 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5564 event pairs, 582 based on Foata normal form. 0/1004 useless extension candidates. Maximal degree in co-relation 2344. Up to 1178 conditions per place. [2022-12-06 04:05:04,262 INFO L137 encePairwiseOnDemand]: 45/47 looper letters, 38 selfloop transitions, 0 changer transitions 0/45 dead transitions. [2022-12-06 04:05:04,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 175 flow [2022-12-06 04:05:04,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 04:05:04,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 04:05:04,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2022-12-06 04:05:04,271 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.574468085106383 [2022-12-06 04:05:04,272 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 103 flow. Second operand 2 states and 54 transitions. [2022-12-06 04:05:04,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 175 flow [2022-12-06 04:05:04,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:05:04,276 INFO L231 Difference]: Finished difference. Result has 43 places, 45 transitions, 94 flow [2022-12-06 04:05:04,277 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=94, PETRI_PLACES=43, PETRI_TRANSITIONS=45} [2022-12-06 04:05:04,280 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2022-12-06 04:05:04,280 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:05:04,281 INFO L89 Accepts]: Start accepts. Operand has 43 places, 45 transitions, 94 flow [2022-12-06 04:05:04,282 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:05:04,283 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:05:04,283 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 45 transitions, 94 flow [2022-12-06 04:05:04,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 45 transitions, 94 flow [2022-12-06 04:05:04,290 INFO L130 PetriNetUnfolder]: 7/45 cut-off events. [2022-12-06 04:05:04,291 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:05:04,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 45 events. 7/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 84 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 41. Up to 3 conditions per place. [2022-12-06 04:05:04,292 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 45 transitions, 94 flow [2022-12-06 04:05:04,292 INFO L188 LiptonReduction]: Number of co-enabled transitions 948 [2022-12-06 04:05:04,364 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:05:04,370 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 04:05:04,370 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 45 transitions, 94 flow [2022-12-06 04:05:04,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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 04:05:04,371 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:05:04,371 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:05:04,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:05:04,372 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:05:04,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:05:04,373 INFO L85 PathProgramCache]: Analyzing trace with hash 912681828, now seen corresponding path program 1 times [2022-12-06 04:05:04,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:05:04,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258829817] [2022-12-06 04:05:04,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:05:04,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:05:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:05:04,655 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 04:05:04,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:05:04,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258829817] [2022-12-06 04:05:04,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258829817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:05:04,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:05:04,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:05:04,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942605756] [2022-12-06 04:05:04,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:05:04,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:05:04,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:05:04,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:05:04,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:05:04,659 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 45 [2022-12-06 04:05:04,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 45 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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 04:05:04,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:05:04,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 45 [2022-12-06 04:05:04,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:05:04,759 INFO L130 PetriNetUnfolder]: 289/549 cut-off events. [2022-12-06 04:05:04,760 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 04:05:04,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1102 conditions, 549 events. 289/549 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2117 event pairs, 195 based on Foata normal form. 28/476 useless extension candidates. Maximal degree in co-relation 728. Up to 324 conditions per place. [2022-12-06 04:05:04,761 INFO L137 encePairwiseOnDemand]: 41/45 looper letters, 36 selfloop transitions, 2 changer transitions 11/54 dead transitions. [2022-12-06 04:05:04,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 211 flow [2022-12-06 04:05:04,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:05:04,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:05:04,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-06 04:05:04,763 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4962962962962963 [2022-12-06 04:05:04,763 INFO L175 Difference]: Start difference. First operand has 42 places, 45 transitions, 94 flow. Second operand 3 states and 67 transitions. [2022-12-06 04:05:04,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 211 flow [2022-12-06 04:05:04,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 211 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:05:04,765 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 90 flow [2022-12-06 04:05:04,765 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2022-12-06 04:05:04,765 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, -1 predicate places. [2022-12-06 04:05:04,765 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:05:04,766 INFO L89 Accepts]: Start accepts. Operand has 45 places, 39 transitions, 90 flow [2022-12-06 04:05:04,766 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:05:04,766 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:05:04,766 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 39 transitions, 90 flow [2022-12-06 04:05:04,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 39 transitions, 90 flow [2022-12-06 04:05:04,770 INFO L130 PetriNetUnfolder]: 5/39 cut-off events. [2022-12-06 04:05:04,770 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:05:04,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 5/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 38. Up to 3 conditions per place. [2022-12-06 04:05:04,771 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 39 transitions, 90 flow [2022-12-06 04:05:04,771 INFO L188 LiptonReduction]: Number of co-enabled transitions 254 [2022-12-06 04:05:05,446 INFO L203 LiptonReduction]: Total number of compositions: 9 [2022-12-06 04:05:05,447 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 682 [2022-12-06 04:05:05,447 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 30 transitions, 72 flow [2022-12-06 04:05:05,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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 04:05:05,447 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:05:05,447 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:05:05,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:05:05,448 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:05:05,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:05:05,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1680390944, now seen corresponding path program 1 times [2022-12-06 04:05:05,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:05:05,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304699308] [2022-12-06 04:05:05,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:05:05,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:05:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:05:05,516 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 04:05:05,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:05:05,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304699308] [2022-12-06 04:05:05,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304699308] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:05:05,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:05:05,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:05:05,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386733093] [2022-12-06 04:05:05,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:05:05,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:05:05,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:05:05,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:05:05,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:05:05,518 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-06 04:05:05,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 04:05:05,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:05:05,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-06 04:05:05,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:05:05,560 INFO L130 PetriNetUnfolder]: 66/147 cut-off events. [2022-12-06 04:05:05,560 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 04:05:05,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 147 events. 66/147 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 471 event pairs, 3 based on Foata normal form. 18/149 useless extension candidates. Maximal degree in co-relation 157. Up to 121 conditions per place. [2022-12-06 04:05:05,561 INFO L137 encePairwiseOnDemand]: 27/30 looper letters, 29 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2022-12-06 04:05:05,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 149 flow [2022-12-06 04:05:05,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:05:05,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:05:05,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 04:05:05,563 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2022-12-06 04:05:05,563 INFO L175 Difference]: Start difference. First operand has 32 places, 30 transitions, 72 flow. Second operand 3 states and 43 transitions. [2022-12-06 04:05:05,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 149 flow [2022-12-06 04:05:05,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 145 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:05:05,564 INFO L231 Difference]: Finished difference. Result has 32 places, 30 transitions, 74 flow [2022-12-06 04:05:05,564 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=32, PETRI_TRANSITIONS=30} [2022-12-06 04:05:05,565 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, -14 predicate places. [2022-12-06 04:05:05,565 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:05:05,565 INFO L89 Accepts]: Start accepts. Operand has 32 places, 30 transitions, 74 flow [2022-12-06 04:05:05,565 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:05:05,565 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:05:05,565 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 30 transitions, 74 flow [2022-12-06 04:05:05,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 30 transitions, 74 flow [2022-12-06 04:05:05,568 INFO L130 PetriNetUnfolder]: 5/31 cut-off events. [2022-12-06 04:05:05,568 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:05:05,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 31 events. 5/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 61 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 33. Up to 3 conditions per place. [2022-12-06 04:05:05,569 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 30 transitions, 74 flow [2022-12-06 04:05:05,569 INFO L188 LiptonReduction]: Number of co-enabled transitions 138 [2022-12-06 04:05:05,661 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:05:05,662 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 04:05:05,662 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 28 transitions, 70 flow [2022-12-06 04:05:05,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 04:05:05,663 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:05:05,663 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:05:05,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:05:05,663 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:05:05,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:05:05,663 INFO L85 PathProgramCache]: Analyzing trace with hash 659984688, now seen corresponding path program 1 times [2022-12-06 04:05:05,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:05:05,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715393324] [2022-12-06 04:05:05,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:05:05,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:05:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:05:05,694 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 04:05:05,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:05:05,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715393324] [2022-12-06 04:05:05,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715393324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:05:05,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:05:05,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:05:05,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948340847] [2022-12-06 04:05:05,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:05:05,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:05:05,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:05:05,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:05:05,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:05:05,695 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 04:05:05,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 28 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 04:05:05,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:05:05,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 04:05:05,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:05:05,744 INFO L130 PetriNetUnfolder]: 90/201 cut-off events. [2022-12-06 04:05:05,744 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-06 04:05:05,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 201 events. 90/201 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 618 event pairs, 42 based on Foata normal form. 4/177 useless extension candidates. Maximal degree in co-relation 180. Up to 126 conditions per place. [2022-12-06 04:05:05,745 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 34 selfloop transitions, 2 changer transitions 2/40 dead transitions. [2022-12-06 04:05:05,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 40 transitions, 172 flow [2022-12-06 04:05:05,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:05:05,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:05:05,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-06 04:05:05,746 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2022-12-06 04:05:05,746 INFO L175 Difference]: Start difference. First operand has 30 places, 28 transitions, 70 flow. Second operand 3 states and 45 transitions. [2022-12-06 04:05:05,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 40 transitions, 172 flow [2022-12-06 04:05:05,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 40 transitions, 169 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:05:05,747 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 77 flow [2022-12-06 04:05:05,747 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2022-12-06 04:05:05,748 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, -14 predicate places. [2022-12-06 04:05:05,748 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:05:05,748 INFO L89 Accepts]: Start accepts. Operand has 32 places, 28 transitions, 77 flow [2022-12-06 04:05:05,748 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:05:05,748 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:05:05,749 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 28 transitions, 77 flow [2022-12-06 04:05:05,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 28 transitions, 77 flow [2022-12-06 04:05:05,752 INFO L130 PetriNetUnfolder]: 6/37 cut-off events. [2022-12-06 04:05:05,752 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 04:05:05,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 37 events. 6/37 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 51 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 41. Up to 4 conditions per place. [2022-12-06 04:05:05,752 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 28 transitions, 77 flow [2022-12-06 04:05:05,752 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 04:05:05,759 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:05:05,760 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 04:05:05,760 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 28 transitions, 77 flow [2022-12-06 04:05:05,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 04:05:05,761 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:05:05,761 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:05:05,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:05:05,761 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:05:05,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:05:05,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1671174728, now seen corresponding path program 1 times [2022-12-06 04:05:05,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:05:05,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967747590] [2022-12-06 04:05:05,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:05:05,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:05:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:05:05,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:05:05,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:05:05,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967747590] [2022-12-06 04:05:05,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967747590] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:05:05,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059777474] [2022-12-06 04:05:05,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:05:05,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:05:05,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:05:05,814 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 04:05:05,851 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 04:05:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:05:05,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 04:05:05,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:05:05,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:05:05,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:05:05,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:05:05,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059777474] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:05:05,971 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:05:05,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-06 04:05:05,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531277311] [2022-12-06 04:05:05,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:05:05,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:05:05,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:05:05,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:05:05,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:05:05,972 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-06 04:05:05,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 28 transitions, 77 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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 04:05:05,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:05:05,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-06 04:05:05,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:05:06,088 INFO L130 PetriNetUnfolder]: 137/316 cut-off events. [2022-12-06 04:05:06,089 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-12-06 04:05:06,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 316 events. 137/316 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 794 event pairs, 21 based on Foata normal form. 12/300 useless extension candidates. Maximal degree in co-relation 245. Up to 69 conditions per place. [2022-12-06 04:05:06,090 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 56 selfloop transitions, 6 changer transitions 0/64 dead transitions. [2022-12-06 04:05:06,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 64 transitions, 285 flow [2022-12-06 04:05:06,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:05:06,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:05:06,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-12-06 04:05:06,091 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47530864197530864 [2022-12-06 04:05:06,091 INFO L175 Difference]: Start difference. First operand has 31 places, 28 transitions, 77 flow. Second operand 6 states and 77 transitions. [2022-12-06 04:05:06,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 64 transitions, 285 flow [2022-12-06 04:05:06,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 64 transitions, 283 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:05:06,092 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 115 flow [2022-12-06 04:05:06,093 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=115, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2022-12-06 04:05:06,093 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, -7 predicate places. [2022-12-06 04:05:06,093 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:05:06,093 INFO L89 Accepts]: Start accepts. Operand has 39 places, 31 transitions, 115 flow [2022-12-06 04:05:06,094 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:05:06,094 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:05:06,095 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 115 flow [2022-12-06 04:05:06,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 115 flow [2022-12-06 04:05:06,099 INFO L130 PetriNetUnfolder]: 8/58 cut-off events. [2022-12-06 04:05:06,100 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-06 04:05:06,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 58 events. 8/58 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 34 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 81. Up to 8 conditions per place. [2022-12-06 04:05:06,100 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 115 flow [2022-12-06 04:05:06,100 INFO L188 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-06 04:05:06,104 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:05:06,105 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 04:05:06,105 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 115 flow [2022-12-06 04:05:06,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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 04:05:06,105 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:05:06,105 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:05:06,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 04:05:06,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:05:06,311 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:05:06,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:05:06,311 INFO L85 PathProgramCache]: Analyzing trace with hash -2052387022, now seen corresponding path program 2 times [2022-12-06 04:05:06,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:05:06,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097200620] [2022-12-06 04:05:06,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:05:06,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:05:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:05:06,427 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:05:06,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:05:06,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097200620] [2022-12-06 04:05:06,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097200620] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:05:06,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376389005] [2022-12-06 04:05:06,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 04:05:06,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:05:06,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:05:06,429 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 04:05:06,468 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 04:05:06,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 04:05:06,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 04:05:06,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 04:05:06,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:05:06,644 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:05:06,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:05:06,728 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:05:06,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376389005] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:05:06,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:05:06,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-06 04:05:06,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308180869] [2022-12-06 04:05:06,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:05:06,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 04:05:06,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:05:06,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 04:05:06,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-12-06 04:05:06,730 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-06 04:05:06,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 115 flow. Second operand has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 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 04:05:06,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:05:06,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-06 04:05:06,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:05:06,973 INFO L130 PetriNetUnfolder]: 287/682 cut-off events. [2022-12-06 04:05:06,974 INFO L131 PetriNetUnfolder]: For 216/216 co-relation queries the response was YES. [2022-12-06 04:05:06,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1668 conditions, 682 events. 287/682 cut-off events. For 216/216 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1772 event pairs, 21 based on Foata normal form. 24/654 useless extension candidates. Maximal degree in co-relation 602. Up to 80 conditions per place. [2022-12-06 04:05:06,977 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 116 selfloop transitions, 12 changer transitions 0/130 dead transitions. [2022-12-06 04:05:06,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 130 transitions, 655 flow [2022-12-06 04:05:06,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 04:05:06,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 04:05:06,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 158 transitions. [2022-12-06 04:05:06,979 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4876543209876543 [2022-12-06 04:05:06,979 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 115 flow. Second operand 12 states and 158 transitions. [2022-12-06 04:05:06,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 130 transitions, 655 flow [2022-12-06 04:05:06,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 130 transitions, 635 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-06 04:05:06,984 INFO L231 Difference]: Finished difference. Result has 56 places, 38 transitions, 203 flow [2022-12-06 04:05:06,984 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=203, PETRI_PLACES=56, PETRI_TRANSITIONS=38} [2022-12-06 04:05:06,985 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 10 predicate places. [2022-12-06 04:05:06,985 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:05:06,985 INFO L89 Accepts]: Start accepts. Operand has 56 places, 38 transitions, 203 flow [2022-12-06 04:05:06,988 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:05:06,989 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:05:06,989 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 38 transitions, 203 flow [2022-12-06 04:05:06,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 38 transitions, 203 flow [2022-12-06 04:05:07,004 INFO L130 PetriNetUnfolder]: 14/118 cut-off events. [2022-12-06 04:05:07,004 INFO L131 PetriNetUnfolder]: For 85/85 co-relation queries the response was YES. [2022-12-06 04:05:07,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 118 events. 14/118 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 193. Up to 20 conditions per place. [2022-12-06 04:05:07,006 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 38 transitions, 203 flow [2022-12-06 04:05:07,006 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-06 04:05:07,010 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:05:07,011 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-06 04:05:07,011 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 38 transitions, 203 flow [2022-12-06 04:05:07,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 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 04:05:07,011 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:05:07,011 INFO L213 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:05:07,030 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 04:05:07,218 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,SelfDestructingSolverStorable5 [2022-12-06 04:05:07,218 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:05:07,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:05:07,218 INFO L85 PathProgramCache]: Analyzing trace with hash -530161422, now seen corresponding path program 3 times [2022-12-06 04:05:07,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:05:07,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649746347] [2022-12-06 04:05:07,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:05:07,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:05:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:05:07,548 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:05:07,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:05:07,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649746347] [2022-12-06 04:05:07,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649746347] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:05:07,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841128019] [2022-12-06 04:05:07,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 04:05:07,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:05:07,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:05:07,570 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:05:07,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 04:05:08,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-06 04:05:08,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 04:05:08,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-06 04:05:08,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:05:08,341 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 13 treesize of output 9 [2022-12-06 04:05:08,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 04:05:08,376 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 16 treesize of output 18 [2022-12-06 04:05:08,449 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 04:05:08,457 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-06 04:05:08,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-12-06 04:05:08,496 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 23 treesize of output 22 [2022-12-06 04:05:08,499 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 76 proven. 45 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-12-06 04:05:08,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:05:08,613 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_571 Int) (v_ArrVal_570 (Array Int Int))) (not (<= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_571)) .cse1))))) is different from false [2022-12-06 04:05:08,622 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:05:08,623 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 49 treesize of output 40 [2022-12-06 04:05:08,629 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:05:08,630 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 63 treesize of output 65 [2022-12-06 04:05:08,634 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 63 treesize of output 51 [2022-12-06 04:05:08,646 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 8 treesize of output 4 [2022-12-06 04:05:08,659 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:05:08,659 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 51 treesize of output 43 [2022-12-06 04:05:08,787 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 40 proven. 72 refuted. 0 times theorem prover too weak. 204 trivial. 9 not checked. [2022-12-06 04:05:08,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841128019] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:05:08,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:05:08,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 9] total 27 [2022-12-06 04:05:08,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535925702] [2022-12-06 04:05:08,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:05:08,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-06 04:05:08,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:05:08,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-06 04:05:08,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=483, Unknown=1, NotChecked=48, Total=702 [2022-12-06 04:05:08,789 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 04:05:08,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 38 transitions, 203 flow. Second operand has 27 states, 27 states have (on average 4.962962962962963) internal successors, (134), 27 states have internal predecessors, (134), 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 04:05:08,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:05:08,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 04:05:08,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:05:10,885 INFO L130 PetriNetUnfolder]: 777/1709 cut-off events. [2022-12-06 04:05:10,885 INFO L131 PetriNetUnfolder]: For 1511/1511 co-relation queries the response was YES. [2022-12-06 04:05:10,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4673 conditions, 1709 events. 777/1709 cut-off events. For 1511/1511 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 5756 event pairs, 20 based on Foata normal form. 24/1646 useless extension candidates. Maximal degree in co-relation 2759. Up to 234 conditions per place. [2022-12-06 04:05:10,891 INFO L137 encePairwiseOnDemand]: 16/27 looper letters, 284 selfloop transitions, 114 changer transitions 0/398 dead transitions. [2022-12-06 04:05:10,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 398 transitions, 2093 flow [2022-12-06 04:05:10,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-06 04:05:10,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2022-12-06 04:05:10,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 417 transitions. [2022-12-06 04:05:10,894 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32175925925925924 [2022-12-06 04:05:10,894 INFO L175 Difference]: Start difference. First operand has 56 places, 38 transitions, 203 flow. Second operand 48 states and 417 transitions. [2022-12-06 04:05:10,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 398 transitions, 2093 flow [2022-12-06 04:05:10,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 398 transitions, 2081 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:05:10,902 INFO L231 Difference]: Finished difference. Result has 129 places, 156 transitions, 1181 flow [2022-12-06 04:05:10,902 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=1181, PETRI_PLACES=129, PETRI_TRANSITIONS=156} [2022-12-06 04:05:10,904 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 83 predicate places. [2022-12-06 04:05:10,904 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:05:10,904 INFO L89 Accepts]: Start accepts. Operand has 129 places, 156 transitions, 1181 flow [2022-12-06 04:05:10,913 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:05:10,913 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:05:10,913 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 156 transitions, 1181 flow [2022-12-06 04:05:10,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 156 transitions, 1181 flow [2022-12-06 04:05:10,967 INFO L130 PetriNetUnfolder]: 113/571 cut-off events. [2022-12-06 04:05:10,967 INFO L131 PetriNetUnfolder]: For 6888/6888 co-relation queries the response was YES. [2022-12-06 04:05:10,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2494 conditions, 571 events. 113/571 cut-off events. For 6888/6888 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1664 event pairs, 0 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 2128. Up to 79 conditions per place. [2022-12-06 04:05:10,973 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 156 transitions, 1181 flow [2022-12-06 04:05:10,974 INFO L188 LiptonReduction]: Number of co-enabled transitions 716 [2022-12-06 04:05:11,231 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L1052-4-->L1053-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (= |v_ULTIMATE.start_main_#t~pre61#1_21| |v_#pthreadsForks_20|) (= (store |v_#memory_int_389| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_389| |v_ULTIMATE.start_main_~#id2~0#1.base_23|) |v_ULTIMATE.start_main_~#id2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre61#1_21|)) |v_#memory_int_388|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_20|, #memory_int=|v_#memory_int_389|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_21|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~nondet60#1=|v_ULTIMATE.start_main_#t~nondet60#1_15|, #memory_int=|v_#memory_int_388|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|, ULTIMATE.start_main_#t~pre59#1=|v_ULTIMATE.start_main_#t~pre59#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet60#1, #memory_int, ULTIMATE.start_main_#t~pre59#1] and [801] L1011-5-->L980-1: Formula: (and (< |v_t1Thread1of1ForFork0_~i~0#1_47| 400) (= |v_t1Thread1of1ForFork0_#t~nondet51#1_24| |v_t1Thread1of1ForFork0_~value~0#1_35|) (= |v_t1Thread1of1ForFork0_enqueue_~q#1.base_163| |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_17|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_17| |v_~#queue~0.base_64|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_17| |v_~#queue~0.offset_59|) (<= |v_t1Thread1of1ForFork0_#t~nondet51#1_24| 2147483647) (<= 0 (+ |v_t1Thread1of1ForFork0_#t~nondet51#1_24| 2147483648)) (= |v_t1Thread1of1ForFork0_enqueue_#in~x#1_19| |v_t1Thread1of1ForFork0_~value~0#1_35|) (= |v_t1Thread1of1ForFork0_enqueue_~x#1_37| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_19|) (= (select (select |v_#memory_int_538| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_163|) (+ |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_163| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_17| |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_163|)) InVars {~#queue~0.base=|v_~#queue~0.base_64|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_47|, #memory_int=|v_#memory_int_538|, ~#queue~0.offset=|v_~#queue~0.offset_59|, t1Thread1of1ForFork0_#t~nondet51#1=|v_t1Thread1of1ForFork0_#t~nondet51#1_24|} OutVars{t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_47|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_163|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_35|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_39|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_37|, t1Thread1of1ForFork0_enqueue_#t~mem36#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_17|, ~#queue~0.base=|v_~#queue~0.base_64|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_163|, t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_19|, #memory_int=|v_#memory_int_538|, t1Thread1of1ForFork0_enqueue_~x#1=|v_t1Thread1of1ForFork0_enqueue_~x#1_37|, t1Thread1of1ForFork0_enqueue_#res#1=|v_t1Thread1of1ForFork0_enqueue_#res#1_35|, ~#queue~0.offset=|v_~#queue~0.offset_59|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_47|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_65|, t1Thread1of1ForFork0_enqueue_#t~mem37#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_35|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_~q#1.base, t1Thread1of1ForFork0_~value~0#1, t1Thread1of1ForFork0_enqueue_#t~post41#1, t1Thread1of1ForFork0_enqueue_#t~mem40#1, t1Thread1of1ForFork0_#t~nondet51#1, t1Thread1of1ForFork0_enqueue_#t~mem36#1, t1Thread1of1ForFork0_enqueue_#in~q#1.base, t1Thread1of1ForFork0_enqueue_~q#1.offset, t1Thread1of1ForFork0_enqueue_#in~x#1, t1Thread1of1ForFork0_enqueue_~x#1, t1Thread1of1ForFork0_enqueue_#res#1, t1Thread1of1ForFork0_enqueue_#t~mem39#1, t1Thread1of1ForFork0_enqueue_#in~q#1.offset, t1Thread1of1ForFork0_enqueue_#t~post38#1, t1Thread1of1ForFork0_enqueue_#t~mem37#1] [2022-12-06 04:05:11,342 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L1052-4-->L1053-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (= |v_ULTIMATE.start_main_#t~pre61#1_21| |v_#pthreadsForks_20|) (= (store |v_#memory_int_389| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_389| |v_ULTIMATE.start_main_~#id2~0#1.base_23|) |v_ULTIMATE.start_main_~#id2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre61#1_21|)) |v_#memory_int_388|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_20|, #memory_int=|v_#memory_int_389|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_21|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~nondet60#1=|v_ULTIMATE.start_main_#t~nondet60#1_15|, #memory_int=|v_#memory_int_388|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|, ULTIMATE.start_main_#t~pre59#1=|v_ULTIMATE.start_main_#t~pre59#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet60#1, #memory_int, ULTIMATE.start_main_#t~pre59#1] and [835] $Ultimate##0-->L980-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_285| |v_~#m~0.base_146|))) (and (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_49| |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_331|) (not (= (mod v_~enqueue_flag~0_139 256) 0)) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_49| |v_~#queue~0.base_150|) (= (store |v_#pthreadsMutex_285| |v_~#m~0.base_146| (store .cse0 |v_~#m~0.offset_146| 1)) |v_#pthreadsMutex_284|) (= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| (select (select |v_#memory_int_1086| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_331|) (+ |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_331| 1604))) (= |v_t1Thread1of1ForFork0_enqueue_~q#1.base_331| |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_49|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_49| |v_~#queue~0.offset_145|) (= |v_t1Thread1of1ForFork0_enqueue_~x#1_100| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_51|) (= |v_t1Thread1of1ForFork0_~value~0#1_125| |v_t1Thread1of1ForFork0_#t~nondet51#1_57|) (= |v_t1Thread1of1ForFork0_~i~0#1_194| 0) (= |v_t1Thread1of1ForFork0_#in~arg#1.offset_46| |v_t1Thread1of1ForFork0_~arg#1.offset_49|) (= (select .cse0 |v_~#m~0.offset_146|) 0) (<= |v_t1Thread1of1ForFork0_#t~nondet51#1_57| 2147483647) (<= 0 (+ |v_t1Thread1of1ForFork0_#t~nondet51#1_57| 2147483648)) (= |v_t1Thread1of1ForFork0_~value~0#1_125| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_51|) (= |v_t1Thread1of1ForFork0_~arg#1.base_49| |v_t1Thread1of1ForFork0_#in~arg#1.base_46|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_285|, ~#m~0.base=|v_~#m~0.base_146|, ~#queue~0.base=|v_~#queue~0.base_150|, ~enqueue_flag~0=v_~enqueue_flag~0_139, ~#m~0.offset=|v_~#m~0.offset_146|, #memory_int=|v_#memory_int_1086|, ~#queue~0.offset=|v_~#queue~0.offset_145|, t1Thread1of1ForFork0_#t~nondet51#1=|v_t1Thread1of1ForFork0_#t~nondet51#1_57|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_46|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_46|} OutVars{t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_194|, t1Thread1of1ForFork0_~arg#1.offset=|v_t1Thread1of1ForFork0_~arg#1.offset_49|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_331|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_125|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_49|, ~#queue~0.base=|v_~#queue~0.base_150|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_331|, t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_51|, t1Thread1of1ForFork0_enqueue_#res#1=|v_t1Thread1of1ForFork0_enqueue_#res#1_150|, ~#queue~0.offset=|v_~#queue~0.offset_145|, t1Thread1of1ForFork0_~arg#1.base=|v_t1Thread1of1ForFork0_~arg#1.base_49|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_104|, #pthreadsMutex=|v_#pthreadsMutex_284|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_109|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_46|, t1Thread1of1ForFork0_enqueue_#t~mem36#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128|, ~#m~0.base=|v_~#m~0.base_146|, ~enqueue_flag~0=v_~enqueue_flag~0_139, ~#m~0.offset=|v_~#m~0.offset_146|, t1Thread1of1ForFork0_#t~nondet49#1=|v_t1Thread1of1ForFork0_#t~nondet49#1_73|, #memory_int=|v_#memory_int_1086|, t1Thread1of1ForFork0_enqueue_~x#1=|v_t1Thread1of1ForFork0_enqueue_~x#1_100|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_49|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_46|, t1Thread1of1ForFork0_enqueue_#t~mem37#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_116|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork0_~i~0#1, t1Thread1of1ForFork0_~arg#1.offset, t1Thread1of1ForFork0_enqueue_~q#1.base, t1Thread1of1ForFork0_~value~0#1, t1Thread1of1ForFork0_enqueue_#t~post41#1, t1Thread1of1ForFork0_enqueue_#t~mem40#1, t1Thread1of1ForFork0_#t~nondet51#1, t1Thread1of1ForFork0_enqueue_#t~mem36#1, t1Thread1of1ForFork0_enqueue_#in~q#1.base, t1Thread1of1ForFork0_enqueue_~q#1.offset, t1Thread1of1ForFork0_enqueue_#in~x#1, t1Thread1of1ForFork0_#t~nondet49#1, t1Thread1of1ForFork0_enqueue_#res#1, t1Thread1of1ForFork0_~arg#1.base, t1Thread1of1ForFork0_enqueue_~x#1, t1Thread1of1ForFork0_enqueue_#t~mem39#1, t1Thread1of1ForFork0_enqueue_#in~q#1.offset, t1Thread1of1ForFork0_enqueue_#t~post38#1, t1Thread1of1ForFork0_enqueue_#t~mem37#1] [2022-12-06 04:05:11,507 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [820] $Ultimate##0-->L1011-5: Formula: (let ((.cse0 (select |v_#pthreadsMutex_264| |v_~#m~0.base_140|))) (and (= (store |v_#pthreadsMutex_264| |v_~#m~0.base_140| (store .cse0 |v_~#m~0.offset_140| 1)) |v_#pthreadsMutex_263|) (= (select .cse0 |v_~#m~0.offset_140|) 0) (= |v_t1Thread1of1ForFork0_~arg#1.base_43| |v_t1Thread1of1ForFork0_#in~arg#1.base_43|) (= |v_t1Thread1of1ForFork0_~i~0#1_115| 0) (= |v_t1Thread1of1ForFork0_#in~arg#1.offset_43| |v_t1Thread1of1ForFork0_~arg#1.offset_43|) (not (= (mod v_~enqueue_flag~0_130 256) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_264|, ~#m~0.base=|v_~#m~0.base_140|, ~enqueue_flag~0=v_~enqueue_flag~0_130, ~#m~0.offset=|v_~#m~0.offset_140|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_43|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_43|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_263|, ~#m~0.base=|v_~#m~0.base_140|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_115|, t1Thread1of1ForFork0_~arg#1.offset=|v_t1Thread1of1ForFork0_~arg#1.offset_43|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_83|, ~enqueue_flag~0=v_~enqueue_flag~0_130, ~#m~0.offset=|v_~#m~0.offset_140|, t1Thread1of1ForFork0_#t~nondet49#1=|v_t1Thread1of1ForFork0_#t~nondet49#1_65|, t1Thread1of1ForFork0_~arg#1.base=|v_t1Thread1of1ForFork0_~arg#1.base_43|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_43|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_43|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork0_~i~0#1, t1Thread1of1ForFork0_~arg#1.offset, t1Thread1of1ForFork0_~value~0#1, t1Thread1of1ForFork0_#t~nondet49#1, t1Thread1of1ForFork0_~arg#1.base] and [836] L1052-4-->L980-1: Formula: (and (= |v_t1Thread1of1ForFork0_~value~0#1_129| |v_t1Thread1of1ForFork0_#t~nondet51#1_61|) (= |v_t1Thread1of1ForFork0_enqueue_~q#1.base_333| |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_51|) (= |v_t1Thread1of1ForFork0_enqueue_~x#1_102| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_53|) (<= |v_t1Thread1of1ForFork0_#t~nondet51#1_61| 2147483647) (<= 0 (+ |v_t1Thread1of1ForFork0_#t~nondet51#1_61| 2147483648)) (< |v_t1Thread1of1ForFork0_~i~0#1_196| 400) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_51| |v_~#queue~0.offset_147|) (= (select (select |v_#memory_int_1088| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_333|) (+ |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_333| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_130|) (= |v_t1Thread1of1ForFork0_~value~0#1_129| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_53|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_51| |v_~#queue~0.base_152|) (= (+ |v_#pthreadsForks_153| 1) |v_#pthreadsForks_152|) (= |v_#memory_int_1088| (store |v_#memory_int_1089| |v_ULTIMATE.start_main_~#id2~0#1.base_113| (store (select |v_#memory_int_1089| |v_ULTIMATE.start_main_~#id2~0#1.base_113|) |v_ULTIMATE.start_main_~#id2~0#1.offset_113| |v_ULTIMATE.start_main_#t~pre61#1_121|))) (= |v_ULTIMATE.start_main_#t~pre61#1_121| |v_#pthreadsForks_153|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_51| |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_333|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_113|, ~#queue~0.base=|v_~#queue~0.base_152|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_196|, #pthreadsForks=|v_#pthreadsForks_153|, #memory_int=|v_#memory_int_1089|, ~#queue~0.offset=|v_~#queue~0.offset_147|, t1Thread1of1ForFork0_#t~nondet51#1=|v_t1Thread1of1ForFork0_#t~nondet51#1_61|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_113|} OutVars{t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_196|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_333|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_129|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_51|, ~#queue~0.base=|v_~#queue~0.base_152|, #pthreadsForks=|v_#pthreadsForks_152|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_333|, t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_53|, ULTIMATE.start_main_#t~nondet60#1=|v_ULTIMATE.start_main_#t~nondet60#1_96|, t1Thread1of1ForFork0_enqueue_#res#1=|v_t1Thread1of1ForFork0_enqueue_#res#1_152|, ~#queue~0.offset=|v_~#queue~0.offset_147|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_106|, ULTIMATE.start_main_#t~pre59#1=|v_ULTIMATE.start_main_#t~pre59#1_114|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_113|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_91|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_111|, t1Thread1of1ForFork0_enqueue_#t~mem36#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_130|, ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_121|, #memory_int=|v_#memory_int_1088|, t1Thread1of1ForFork0_enqueue_~x#1=|v_t1Thread1of1ForFork0_enqueue_~x#1_102|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_51|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_148|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_113|, t1Thread1of1ForFork0_enqueue_#t~mem37#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_118|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_~q#1.base, t1Thread1of1ForFork0_~value~0#1, t1Thread1of1ForFork0_enqueue_#t~post41#1, t1Thread1of1ForFork0_enqueue_#t~mem40#1, t1Thread1of1ForFork0_#t~nondet51#1, t1Thread1of1ForFork0_enqueue_#t~mem36#1, t1Thread1of1ForFork0_enqueue_#in~q#1.base, ULTIMATE.start_main_#t~pre61#1, #pthreadsForks, t1Thread1of1ForFork0_enqueue_~q#1.offset, t1Thread1of1ForFork0_enqueue_#in~x#1, ULTIMATE.start_main_#t~nondet60#1, t1Thread1of1ForFork0_enqueue_#res#1, #memory_int, t1Thread1of1ForFork0_enqueue_~x#1, t1Thread1of1ForFork0_enqueue_#t~mem39#1, t1Thread1of1ForFork0_enqueue_#in~q#1.offset, t1Thread1of1ForFork0_enqueue_#t~post38#1, ULTIMATE.start_main_#t~pre59#1, t1Thread1of1ForFork0_enqueue_#t~mem37#1] [2022-12-06 04:05:11,837 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 04:05:11,838 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 934 [2022-12-06 04:05:11,838 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 154 transitions, 1188 flow [2022-12-06 04:05:11,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.962962962962963) internal successors, (134), 27 states have internal predecessors, (134), 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 04:05:11,838 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:05:11,839 INFO L213 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 13, 12, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:05:11,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 04:05:12,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:05:12,046 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:05:12,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:05:12,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1518023643, now seen corresponding path program 1 times [2022-12-06 04:05:12,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:05:12,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433583859] [2022-12-06 04:05:12,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:05:12,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:05:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:05:12,458 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 0 proven. 519 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:05:12,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:05:12,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433583859] [2022-12-06 04:05:12,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433583859] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:05:12,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950271755] [2022-12-06 04:05:12,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:05:12,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:05:12,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:05:12,478 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:05:12,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 04:05:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:05:12,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 04:05:12,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:05:12,824 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 0 proven. 519 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:05:12,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:05:13,208 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 0 proven. 519 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:05:13,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950271755] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:05:13,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:05:13,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2022-12-06 04:05:13,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851283340] [2022-12-06 04:05:13,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:05:13,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-06 04:05:13,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:05:13,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-06 04:05:13,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2022-12-06 04:05:13,211 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2022-12-06 04:05:13,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 154 transitions, 1188 flow. Second operand has 31 states, 31 states have (on average 7.580645161290323) internal successors, (235), 31 states have internal predecessors, (235), 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 04:05:13,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:05:13,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2022-12-06 04:05:13,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:05:14,211 INFO L130 PetriNetUnfolder]: 1270/3211 cut-off events. [2022-12-06 04:05:14,211 INFO L131 PetriNetUnfolder]: For 42377/42377 co-relation queries the response was YES. [2022-12-06 04:05:14,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14869 conditions, 3211 events. 1270/3211 cut-off events. For 42377/42377 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 12082 event pairs, 52 based on Foata normal form. 120/3294 useless extension candidates. Maximal degree in co-relation 6754. Up to 492 conditions per place. [2022-12-06 04:05:14,236 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 452 selfloop transitions, 75 changer transitions 1/530 dead transitions. [2022-12-06 04:05:14,236 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 530 transitions, 6313 flow [2022-12-06 04:05:14,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-06 04:05:14,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-06 04:05:14,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 419 transitions. [2022-12-06 04:05:14,239 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4505376344086022 [2022-12-06 04:05:14,239 INFO L175 Difference]: Start difference. First operand has 127 places, 154 transitions, 1188 flow. Second operand 30 states and 419 transitions. [2022-12-06 04:05:14,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 530 transitions, 6313 flow [2022-12-06 04:05:14,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 530 transitions, 6093 flow, removed 44 selfloop flow, removed 12 redundant places. [2022-12-06 04:05:14,322 INFO L231 Difference]: Finished difference. Result has 160 places, 199 transitions, 1872 flow [2022-12-06 04:05:14,322 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1078, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1872, PETRI_PLACES=160, PETRI_TRANSITIONS=199} [2022-12-06 04:05:14,323 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 114 predicate places. [2022-12-06 04:05:14,323 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:05:14,323 INFO L89 Accepts]: Start accepts. Operand has 160 places, 199 transitions, 1872 flow [2022-12-06 04:05:14,333 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:05:14,333 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:05:14,333 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 199 transitions, 1872 flow [2022-12-06 04:05:14,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 199 transitions, 1872 flow [2022-12-06 04:05:14,525 INFO L130 PetriNetUnfolder]: 245/1208 cut-off events. [2022-12-06 04:05:14,526 INFO L131 PetriNetUnfolder]: For 15915/15915 co-relation queries the response was YES. [2022-12-06 04:05:14,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5471 conditions, 1208 events. 245/1208 cut-off events. For 15915/15915 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 3669 event pairs, 0 based on Foata normal form. 0/1198 useless extension candidates. Maximal degree in co-relation 4980. Up to 246 conditions per place. [2022-12-06 04:05:14,536 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 199 transitions, 1872 flow [2022-12-06 04:05:14,536 INFO L188 LiptonReduction]: Number of co-enabled transitions 892 [2022-12-06 04:05:14,557 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:05:14,558 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 234 [2022-12-06 04:05:14,558 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 199 transitions, 1872 flow [2022-12-06 04:05:14,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 7.580645161290323) internal successors, (235), 31 states have internal predecessors, (235), 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 04:05:14,558 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:05:14,558 INFO L213 CegarLoopForPetriNet]: trace histogram [28, 28, 28, 20, 19, 14, 14, 14, 14, 14, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:05:14,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 04:05:14,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:05:14,764 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:05:14,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:05:14,764 INFO L85 PathProgramCache]: Analyzing trace with hash -510588631, now seen corresponding path program 1 times [2022-12-06 04:05:14,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:05:14,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465914619] [2022-12-06 04:05:14,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:05:14,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:05:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:05:16,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2353 backedges. 0 proven. 2353 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:05:16,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:05:16,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465914619] [2022-12-06 04:05:16,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465914619] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:05:16,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108920013] [2022-12-06 04:05:16,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:05:16,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:05:16,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:05:16,094 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:05:16,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 04:05:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:05:16,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 1625 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 04:05:16,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:05:16,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2353 backedges. 0 proven. 2353 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:05:16,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:05:17,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2353 backedges. 0 proven. 2353 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:05:17,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108920013] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:05:17,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:05:17,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2022-12-06 04:05:17,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181841571] [2022-12-06 04:05:17,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:05:17,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-12-06 04:05:17,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:05:17,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-12-06 04:05:17,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2022-12-06 04:05:17,554 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-06 04:05:17,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 199 transitions, 1872 flow. Second operand has 61 states, 61 states have (on average 7.524590163934426) internal successors, (459), 61 states have internal predecessors, (459), 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 04:05:17,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:05:17,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-06 04:05:17,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:05:20,113 INFO L130 PetriNetUnfolder]: 2560/6543 cut-off events. [2022-12-06 04:05:20,113 INFO L131 PetriNetUnfolder]: For 155530/155530 co-relation queries the response was YES. [2022-12-06 04:05:20,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31297 conditions, 6543 events. 2560/6543 cut-off events. For 155530/155530 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 25146 event pairs, 42 based on Foata normal form. 240/6746 useless extension candidates. Maximal degree in co-relation 13800. Up to 1212 conditions per place. [2022-12-06 04:05:20,156 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 932 selfloop transitions, 165 changer transitions 0/1099 dead transitions. [2022-12-06 04:05:20,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 1099 transitions, 13411 flow [2022-12-06 04:05:20,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-12-06 04:05:20,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2022-12-06 04:05:20,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 853 transitions. [2022-12-06 04:05:20,159 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4738888888888889 [2022-12-06 04:05:20,159 INFO L175 Difference]: Start difference. First operand has 159 places, 199 transitions, 1872 flow. Second operand 60 states and 853 transitions. [2022-12-06 04:05:20,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 1099 transitions, 13411 flow [2022-12-06 04:05:20,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 1099 transitions, 13355 flow, removed 1 selfloop flow, removed 13 redundant places. [2022-12-06 04:05:20,417 INFO L231 Difference]: Finished difference. Result has 236 places, 290 transitions, 3732 flow [2022-12-06 04:05:20,417 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1816, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=3732, PETRI_PLACES=236, PETRI_TRANSITIONS=290} [2022-12-06 04:05:20,417 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 190 predicate places. [2022-12-06 04:05:20,418 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:05:20,418 INFO L89 Accepts]: Start accepts. Operand has 236 places, 290 transitions, 3732 flow [2022-12-06 04:05:20,454 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:05:20,454 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:05:20,454 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 236 places, 290 transitions, 3732 flow [2022-12-06 04:05:20,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 236 places, 290 transitions, 3732 flow [2022-12-06 04:05:20,978 INFO L130 PetriNetUnfolder]: 515/2493 cut-off events. [2022-12-06 04:05:20,978 INFO L131 PetriNetUnfolder]: For 38593/38593 co-relation queries the response was YES. [2022-12-06 04:05:20,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12034 conditions, 2493 events. 515/2493 cut-off events. For 38593/38593 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 7665 event pairs, 0 based on Foata normal form. 0/2483 useless extension candidates. Maximal degree in co-relation 11369. Up to 606 conditions per place. [2022-12-06 04:05:21,010 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 236 places, 290 transitions, 3732 flow [2022-12-06 04:05:21,011 INFO L188 LiptonReduction]: Number of co-enabled transitions 1256 [2022-12-06 04:05:21,038 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:05:21,039 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 621 [2022-12-06 04:05:21,039 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 290 transitions, 3732 flow [2022-12-06 04:05:21,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 7.524590163934426) internal successors, (459), 61 states have internal predecessors, (459), 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 04:05:21,041 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:05:21,041 INFO L213 CegarLoopForPetriNet]: trace histogram [58, 58, 58, 35, 34, 29, 29, 29, 29, 29, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:05:21,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 04:05:21,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:05:21,247 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:05:21,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:05:21,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1819872576, now seen corresponding path program 2 times [2022-12-06 04:05:21,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:05:21,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878532547] [2022-12-06 04:05:21,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:05:21,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:05:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:05:25,566 INFO L134 CoverageAnalysis]: Checked inductivity of 10078 backedges. 0 proven. 10078 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:05:25,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:05:25,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878532547] [2022-12-06 04:05:25,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878532547] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:05:25,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779831161] [2022-12-06 04:05:25,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 04:05:25,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:05:25,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:05:25,576 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:05:25,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 04:05:26,329 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 04:05:26,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 04:05:26,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 3110 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-06 04:05:26,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:05:26,721 INFO L134 CoverageAnalysis]: Checked inductivity of 10078 backedges. 0 proven. 10078 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:05:26,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:05:29,851 INFO L134 CoverageAnalysis]: Checked inductivity of 10078 backedges. 0 proven. 10078 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:05:29,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779831161] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:05:29,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:05:29,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2022-12-06 04:05:29,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954999995] [2022-12-06 04:05:29,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:05:29,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 121 states [2022-12-06 04:05:29,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:05:29,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2022-12-06 04:05:29,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2022-12-06 04:05:29,857 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-06 04:05:29,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 290 transitions, 3732 flow. Second operand has 121 states, 121 states have (on average 7.512396694214876) internal successors, (909), 121 states have internal predecessors, (909), 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 04:05:29,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:05:29,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-06 04:05:29,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:05:42,560 INFO L130 PetriNetUnfolder]: 5140/13200 cut-off events. [2022-12-06 04:05:42,560 INFO L131 PetriNetUnfolder]: For 874520/874520 co-relation queries the response was YES. [2022-12-06 04:05:42,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66556 conditions, 13200 events. 5140/13200 cut-off events. For 874520/874520 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 51076 event pairs, 52 based on Foata normal form. 480/13643 useless extension candidates. Maximal degree in co-relation 30921. Up to 2652 conditions per place. [2022-12-06 04:05:42,683 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 1892 selfloop transitions, 345 changer transitions 0/2239 dead transitions. [2022-12-06 04:05:42,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 2239 transitions, 28873 flow [2022-12-06 04:05:42,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-12-06 04:05:42,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2022-12-06 04:05:42,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 1723 transitions. [2022-12-06 04:05:42,695 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4786111111111111 [2022-12-06 04:05:42,695 INFO L175 Difference]: Start difference. First operand has 236 places, 290 transitions, 3732 flow. Second operand 120 states and 1723 transitions. [2022-12-06 04:05:42,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 2239 transitions, 28873 flow [2022-12-06 04:05:44,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 2239 transitions, 28733 flow, removed 1 selfloop flow, removed 27 redundant places. [2022-12-06 04:05:44,307 INFO L231 Difference]: Finished difference. Result has 389 places, 471 transitions, 8032 flow [2022-12-06 04:05:44,308 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=3592, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=120, PETRI_FLOW=8032, PETRI_PLACES=389, PETRI_TRANSITIONS=471} [2022-12-06 04:05:44,308 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 343 predicate places. [2022-12-06 04:05:44,308 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:05:44,308 INFO L89 Accepts]: Start accepts. Operand has 389 places, 471 transitions, 8032 flow [2022-12-06 04:05:44,503 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:05:44,504 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:05:44,504 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 389 places, 471 transitions, 8032 flow [2022-12-06 04:05:44,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 389 places, 471 transitions, 8032 flow [2022-12-06 04:05:46,744 INFO L130 PetriNetUnfolder]: 1055/5098 cut-off events. [2022-12-06 04:05:46,744 INFO L131 PetriNetUnfolder]: For 99286/99286 co-relation queries the response was YES. [2022-12-06 04:05:46,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26105 conditions, 5098 events. 1055/5098 cut-off events. For 99286/99286 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 16073 event pairs, 0 based on Foata normal form. 0/5088 useless extension candidates. Maximal degree in co-relation 25111. Up to 1326 conditions per place. [2022-12-06 04:05:46,884 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 389 places, 471 transitions, 8032 flow [2022-12-06 04:05:46,884 INFO L188 LiptonReduction]: Number of co-enabled transitions 1980 [2022-12-06 04:05:47,002 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:05:47,003 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2695 [2022-12-06 04:05:47,003 INFO L495 AbstractCegarLoop]: Abstraction has has 389 places, 471 transitions, 8032 flow [2022-12-06 04:05:47,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 121 states, 121 states have (on average 7.512396694214876) internal successors, (909), 121 states have internal predecessors, (909), 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 04:05:47,004 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:05:47,004 INFO L213 CegarLoopForPetriNet]: trace histogram [118, 118, 118, 65, 64, 59, 59, 59, 59, 59, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:05:47,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-06 04:05:47,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:05:47,217 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:05:47,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:05:47,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1259018706, now seen corresponding path program 3 times [2022-12-06 04:05:47,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:05:47,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585893439] [2022-12-06 04:05:47,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:05:47,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:05:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:02,338 INFO L134 CoverageAnalysis]: Checked inductivity of 41728 backedges. 0 proven. 41728 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:02,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:02,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585893439] [2022-12-06 04:06:02,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585893439] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:06:02,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955995657] [2022-12-06 04:06:02,344 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 04:06:02,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:06:02,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:06:02,345 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:06:02,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 04:06:05,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-06 04:06:05,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 04:06:05,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-06 04:06:05,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:06:05,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2022-12-06 04:06:05,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 04:06:05,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 04:06:05,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-12-06 04:06:05,574 INFO L321 Elim1Store]: treesize reduction 40, result has 45.2 percent of original size [2022-12-06 04:06:05,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 35 treesize of output 55 [2022-12-06 04:06:05,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-06 04:06:05,762 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 04:06:05,777 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-06 04:06:05,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-12-06 04:06:05,860 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 23 treesize of output 22 [2022-12-06 04:06:05,872 INFO L134 CoverageAnalysis]: Checked inductivity of 41728 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 41260 trivial. 0 not checked. [2022-12-06 04:06:05,873 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 04:06:05,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955995657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:05,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 04:06:05,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [121] total 124 [2022-12-06 04:06:05,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934386437] [2022-12-06 04:06:05,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:05,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:06:05,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:05,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:06:05,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7267, Invalid=7985, Unknown=0, NotChecked=0, Total=15252 [2022-12-06 04:06:05,880 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 04:06:05,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 471 transitions, 8032 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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 04:06:05,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:05,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 04:06:05,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:16,114 INFO L130 PetriNetUnfolder]: 6527/14565 cut-off events. [2022-12-06 04:06:16,115 INFO L131 PetriNetUnfolder]: For 200667/200667 co-relation queries the response was YES. [2022-12-06 04:06:16,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75322 conditions, 14565 events. 6527/14565 cut-off events. For 200667/200667 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 52163 event pairs, 32 based on Foata normal form. 3/14531 useless extension candidates. Maximal degree in co-relation 72996. Up to 14523 conditions per place. [2022-12-06 04:06:16,328 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 468 selfloop transitions, 8 changer transitions 0/476 dead transitions. [2022-12-06 04:06:16,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 476 transitions, 9029 flow [2022-12-06 04:06:16,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:06:16,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:06:16,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-06 04:06:16,331 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2866666666666667 [2022-12-06 04:06:16,331 INFO L175 Difference]: Start difference. First operand has 389 places, 471 transitions, 8032 flow. Second operand 5 states and 43 transitions. [2022-12-06 04:06:16,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 476 transitions, 9029 flow [2022-12-06 04:06:20,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 476 transitions, 8698 flow, removed 6 selfloop flow, removed 59 redundant places. [2022-12-06 04:06:20,245 INFO L231 Difference]: Finished difference. Result has 335 places, 468 transitions, 7757 flow [2022-12-06 04:06:20,246 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=7674, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=466, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7757, PETRI_PLACES=335, PETRI_TRANSITIONS=468} [2022-12-06 04:06:20,246 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 289 predicate places. [2022-12-06 04:06:20,246 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:20,246 INFO L89 Accepts]: Start accepts. Operand has 335 places, 468 transitions, 7757 flow [2022-12-06 04:06:20,395 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:20,395 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:20,395 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 335 places, 468 transitions, 7757 flow [2022-12-06 04:06:20,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 335 places, 468 transitions, 7757 flow [2022-12-06 04:06:23,535 INFO L130 PetriNetUnfolder]: 1054/5063 cut-off events. [2022-12-06 04:06:23,535 INFO L131 PetriNetUnfolder]: For 97466/97466 co-relation queries the response was YES. [2022-12-06 04:06:23,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25690 conditions, 5063 events. 1054/5063 cut-off events. For 97466/97466 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 15727 event pairs, 0 based on Foata normal form. 0/5053 useless extension candidates. Maximal degree in co-relation 24695. Up to 1325 conditions per place. [2022-12-06 04:06:23,622 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 335 places, 468 transitions, 7757 flow [2022-12-06 04:06:23,622 INFO L188 LiptonReduction]: Number of co-enabled transitions 1968 [2022-12-06 04:06:23,778 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:06:23,779 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3533 [2022-12-06 04:06:23,779 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 468 transitions, 7757 flow [2022-12-06 04:06:23,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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 04:06:23,780 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:23,780 INFO L213 CegarLoopForPetriNet]: trace histogram [118, 118, 118, 66, 65, 59, 59, 59, 59, 59, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:23,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-06 04:06:23,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:06:23,991 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:06:23,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:23,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1467633432, now seen corresponding path program 4 times [2022-12-06 04:06:23,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:23,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776266769] [2022-12-06 04:06:23,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:23,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:37,523 INFO L134 CoverageAnalysis]: Checked inductivity of 41793 backedges. 0 proven. 41793 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:37,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:37,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776266769] [2022-12-06 04:06:37,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776266769] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:06:37,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698331175] [2022-12-06 04:06:37,524 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 04:06:37,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:06:37,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:06:37,526 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:06:37,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 04:06:40,182 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 04:06:40,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 04:06:40,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 6080 conjuncts, 120 conjunts are in the unsatisfiable core [2022-12-06 04:06:40,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:06:40,973 INFO L134 CoverageAnalysis]: Checked inductivity of 41793 backedges. 0 proven. 41793 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:40,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:06:51,033 INFO L134 CoverageAnalysis]: Checked inductivity of 41793 backedges. 0 proven. 41793 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:51,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698331175] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:06:51,033 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:06:51,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [121, 121, 121] total 241 [2022-12-06 04:06:51,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540835881] [2022-12-06 04:06:51,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:06:51,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 241 states [2022-12-06 04:06:51,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:51,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 241 interpolants. [2022-12-06 04:06:51,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28920, Invalid=28920, Unknown=0, NotChecked=0, Total=57840 [2022-12-06 04:06:51,048 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-06 04:06:51,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 468 transitions, 7757 flow. Second operand has 241 states, 241 states have (on average 7.514522821576763) internal successors, (1811), 241 states have internal predecessors, (1811), 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 04:06:51,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:51,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-06 04:06:51,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:08:15,611 INFO L130 PetriNetUnfolder]: 10283/26479 cut-off events. [2022-12-06 04:08:15,612 INFO L131 PetriNetUnfolder]: For 6564247/6564247 co-relation queries the response was YES. [2022-12-06 04:08:15,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139665 conditions, 26479 events. 10283/26479 cut-off events. For 6564247/6564247 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 103024 event pairs, 38 based on Foata normal form. 960/27402 useless extension candidates. Maximal degree in co-relation 66112. Up to 5529 conditions per place. [2022-12-06 04:08:16,124 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 3807 selfloop transitions, 704 changer transitions 0/4513 dead transitions. [2022-12-06 04:08:16,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 4513 transitions, 61100 flow [2022-12-06 04:08:16,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 240 states. [2022-12-06 04:08:16,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2022-12-06 04:08:16,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 3461 transitions. [2022-12-06 04:08:16,147 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4806944444444444 [2022-12-06 04:08:16,147 INFO L175 Difference]: Start difference. First operand has 335 places, 468 transitions, 7757 flow. Second operand 240 states and 3461 transitions. [2022-12-06 04:08:16,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 4513 transitions, 61100 flow [2022-12-06 04:08:28,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 4513 transitions, 59627 flow, removed 733 selfloop flow, removed 2 redundant places. [2022-12-06 04:08:28,781 INFO L231 Difference]: Finished difference. Result has 693 places, 829 transitions, 17782 flow [2022-12-06 04:08:28,782 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=7700, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=344, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=240, PETRI_FLOW=17782, PETRI_PLACES=693, PETRI_TRANSITIONS=829} [2022-12-06 04:08:28,783 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 647 predicate places. [2022-12-06 04:08:28,783 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:08:28,783 INFO L89 Accepts]: Start accepts. Operand has 693 places, 829 transitions, 17782 flow [2022-12-06 04:08:29,598 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:08:29,598 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:08:29,598 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 693 places, 829 transitions, 17782 flow [2022-12-06 04:08:29,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 693 places, 829 transitions, 17782 flow [2022-12-06 04:08:39,794 INFO L130 PetriNetUnfolder]: 2134/10223 cut-off events. [2022-12-06 04:08:39,794 INFO L131 PetriNetUnfolder]: For 257454/257454 co-relation queries the response was YES. [2022-12-06 04:08:39,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54213 conditions, 10223 events. 2134/10223 cut-off events. For 257454/257454 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 32330 event pairs, 0 based on Foata normal form. 0/10213 useless extension candidates. Maximal degree in co-relation 52596. Up to 2764 conditions per place. [2022-12-06 04:08:40,228 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 693 places, 829 transitions, 17782 flow [2022-12-06 04:08:40,228 INFO L188 LiptonReduction]: Number of co-enabled transitions 3412 [2022-12-06 04:08:40,689 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:08:40,689 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11906 [2022-12-06 04:08:40,689 INFO L495 AbstractCegarLoop]: Abstraction has has 693 places, 829 transitions, 17782 flow [2022-12-06 04:08:40,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 241 states, 241 states have (on average 7.514522821576763) internal successors, (1811), 241 states have internal predecessors, (1811), 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 04:08:40,690 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:08:40,691 INFO L213 CegarLoopForPetriNet]: trace histogram [238, 238, 238, 125, 124, 120, 120, 120, 118, 118, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:08:40,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 04:08:40,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-06 04:08:40,913 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:08:40,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:08:40,914 INFO L85 PathProgramCache]: Analyzing trace with hash -565807535, now seen corresponding path program 5 times [2022-12-06 04:08:40,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:08:40,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975151333] [2022-12-06 04:08:40,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:08:40,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:08:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:47,005 INFO L134 CoverageAnalysis]: Checked inductivity of 169948 backedges. 0 proven. 169948 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:47,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:47,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975151333] [2022-12-06 04:09:47,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975151333] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:09:47,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232662973] [2022-12-06 04:09:47,006 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 04:09:47,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:09:47,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:09:47,009 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:09:47,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 04:09:48,161 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-12-06 04:09:48,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 04:09:48,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 103 conjunts are in the unsatisfiable core [2022-12-06 04:09:48,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:09:48,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-06 04:09:48,393 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2022-12-06 04:09:48,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 25 treesize of output 38 [2022-12-06 04:09:48,567 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 04:09:48,576 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-12-06 04:09:48,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 62 [2022-12-06 04:09:48,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 04:09:48,755 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 48 treesize of output 47 [2022-12-06 04:09:48,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 56 treesize of output 40 [2022-12-06 04:09:49,086 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2022-12-06 04:09:49,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 51 treesize of output 64 [2022-12-06 04:09:49,391 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 04:09:49,398 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-12-06 04:09:49,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 62 [2022-12-06 04:09:49,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 04:09:49,535 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 48 treesize of output 47 [2022-12-06 04:09:49,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-12-06 04:09:49,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 04:09:49,820 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 25 treesize of output 24 [2022-12-06 04:09:49,980 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 04:09:49,987 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-06 04:09:49,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-12-06 04:09:50,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 04:09:50,142 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 23 treesize of output 22 [2022-12-06 04:09:50,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2022-12-06 04:09:50,462 INFO L321 Elim1Store]: treesize reduction 37, result has 19.6 percent of original size [2022-12-06 04:09:50,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 31 treesize of output 30 [2022-12-06 04:09:50,696 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 04:09:50,703 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-06 04:09:50,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-06 04:09:50,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 04:09:50,815 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 23 treesize of output 22 [2022-12-06 04:09:50,836 INFO L134 CoverageAnalysis]: Checked inductivity of 169948 backedges. 41798 proven. 15 refuted. 0 times theorem prover too weak. 128135 trivial. 0 not checked. [2022-12-06 04:09:50,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:09:57,432 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10230 Int) (v_ArrVal_10222 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1013| Int) (v_ArrVal_10232 Int) (|v_t1Thread1of1ForFork0_~i~0#1_966| Int) (v_ArrVal_10223 Int) (v_ArrVal_10226 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_10222)))) (store .cse3 |c_~#queue~0.base| (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* 4 (select .cse5 .cse1))) v_ArrVal_10223)))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_10226) .cse1 (+ (select .cse4 .cse1) 1))))))) (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_966| 4) |c_~#stored_elements~0.offset|) v_ArrVal_10230))) |c_~#queue~0.base|))) (or (not (= 400 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1013| 4)) v_ArrVal_10232) .cse1))) (not (<= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) |v_t1Thread1of1ForFork0_~i~0#1_966|)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1013| (select .cse0 .cse1))))))) is different from false [2022-12-06 04:17:23,569 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10230 Int) (v_ArrVal_10222 Int) (v_ArrVal_10210 Int) (v_ArrVal_10232 Int) (|v_t1Thread1of1ForFork0_~i~0#1_966| Int) (v_ArrVal_10223 Int) (|v_t1Thread1of1ForFork0_~i~0#1_968| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1017| Int) (|~#stored_elements~0.base| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1019| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1013| Int) (v_ArrVal_10226 Int) (v_ArrVal_10214 Int) (v_ArrVal_10206 Int) (v_ArrVal_10216 Int) (|t1Thread1of1ForFork0_~i~0#1| Int) (v_ArrVal_10208 Int) (|~#stored_elements~0.offset| Int) (v_ArrVal_10218 Int)) (let ((.cse14 (store |c_#memory_int| |~#stored_elements~0.base| (store (select |c_#memory_int| |~#stored_elements~0.base|) (+ (* 4 |t1Thread1of1ForFork0_~i~0#1|) |~#stored_elements~0.offset|) v_ArrVal_10206)))) (let ((.cse11 (* |v_t1Thread1of1ForFork0_~i~0#1_968| 4)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse4 (select .cse14 |c_~#queue~0.base|))) (let ((.cse12 (let ((.cse13 (store .cse14 |c_~#queue~0.base| (let ((.cse15 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1019| 4) |c_~#queue~0.offset|) v_ArrVal_10208))) (store (store .cse15 .cse8 v_ArrVal_10210) .cse1 (+ (select .cse15 .cse1) 1)))))) (store .cse13 |~#stored_elements~0.base| (store (select .cse13 |~#stored_elements~0.base|) (+ .cse11 |~#stored_elements~0.offset|) v_ArrVal_10214))))) (let ((.cse3 (select .cse12 |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1017| 4) |c_~#queue~0.offset|) v_ArrVal_10216))) (let ((.cse2 (select (let ((.cse5 (let ((.cse6 (let ((.cse10 (store .cse12 |c_~#queue~0.base| (store (store .cse0 .cse8 v_ArrVal_10218) .cse1 1)))) (store .cse10 |~#stored_elements~0.base| (store (select .cse10 |~#stored_elements~0.base|) (+ .cse11 4 |~#stored_elements~0.offset|) v_ArrVal_10222))))) (store .cse6 |c_~#queue~0.base| (let ((.cse7 (let ((.cse9 (select .cse6 |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_10223)))) (store (store .cse7 .cse8 v_ArrVal_10226) .cse1 (+ (select .cse7 .cse1) 1))))))) (store .cse5 |~#stored_elements~0.base| (store (select .cse5 |~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_966| 4) |~#stored_elements~0.offset|) v_ArrVal_10230))) |c_~#queue~0.base|))) (or (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_968| 2) |v_t1Thread1of1ForFork0_~i~0#1_966|)) (not (= 400 (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1013| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1017| (select .cse3 .cse1))) (not (<= (+ |t1Thread1of1ForFork0_~i~0#1| 1) |v_t1Thread1of1ForFork0_~i~0#1_968|)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1019| (select .cse4 .cse1))) (not (= 400 (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1013| 4)) v_ArrVal_10232) .cse1))))))))))) is different from false [2022-12-06 04:17:38,262 WARN L233 SmtUtils]: Spent 14.50s on a formula simplification. DAG size of input: 997 DAG size of output: 358 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-12-06 04:17:38,269 INFO L321 Elim1Store]: treesize reduction 12971, result has 13.7 percent of original size [2022-12-06 04:17:38,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 7 new quantified variables, introduced 52 case distinctions, treesize of input 18584 treesize of output 3556 [2022-12-06 04:17:38,433 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:17:38,452 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2929 [2022-12-06 04:17:38,860 INFO L217 Elim1Store]: Index analysis took 270 ms [2022-12-06 04:17:39,388 INFO L321 Elim1Store]: treesize reduction 238, result has 5.2 percent of original size [2022-12-06 04:17:39,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 25 case distinctions, treesize of input 98235 treesize of output 56325 [2022-12-06 04:17:40,335 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:17:40,378 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28900 [2022-12-06 04:17:40,719 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:17:40,833 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 92519 [2022-12-06 04:17:41,222 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:17:41,420 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 161504 [2022-12-06 04:17:43,819 INFO L217 Elim1Store]: Index analysis took 1693 ms Received shutdown request... [2022-12-06 04:19:03,005 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 04:19:03,027 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 04:19:04,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 04:19:04,236 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-12-06 04:19:04,309 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-12-06 04:19:04,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:19:04,309 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:627) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:332) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:350) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) ... 54 more [2022-12-06 04:19:04,313 INFO L158 Benchmark]: Toolchain (without parser) took 849803.28ms. Allocated memory was 203.4MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 159.0MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. [2022-12-06 04:19:04,313 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 203.4MB. Free memory is still 179.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:19:04,313 INFO L158 Benchmark]: CACSL2BoogieTranslator took 597.20ms. Allocated memory is still 203.4MB. Free memory was 159.0MB in the beginning and 128.6MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-06 04:19:04,313 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.20ms. Allocated memory is still 203.4MB. Free memory was 128.6MB in the beginning and 126.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:19:04,313 INFO L158 Benchmark]: Boogie Preprocessor took 48.89ms. Allocated memory is still 203.4MB. Free memory was 126.0MB in the beginning and 123.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:19:04,314 INFO L158 Benchmark]: RCFGBuilder took 635.21ms. Allocated memory is still 203.4MB. Free memory was 123.9MB in the beginning and 102.9MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-06 04:19:04,314 INFO L158 Benchmark]: TraceAbstraction took 848451.61ms. Allocated memory was 203.4MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 102.4MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. [2022-12-06 04:19:04,315 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### [2022-12-06 04:19:04,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 203.4MB. Free memory is still 179.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 597.20ms. Allocated memory is still 203.4MB. Free memory was 159.0MB in the beginning and 128.6MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.20ms. Allocated memory is still 203.4MB. Free memory was 128.6MB in the beginning and 126.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.89ms. Allocated memory is still 203.4MB. Free memory was 126.0MB in the beginning and 123.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 635.21ms. Allocated memory is still 203.4MB. Free memory was 123.9MB in the beginning and 102.9MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 848451.61ms. Allocated memory was 203.4MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 102.4MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.7s, 198 PlacesBefore, 46 PlacesAfterwards, 204 TransitionsBefore, 47 TransitionsAfterwards, 9810 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 58 TrivialYvCompositions, 97 ConcurrentYvCompositions, 5 ChoiceCompositions, 164 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6855, independent: 6649, independent conditional: 6649, independent unconditional: 0, dependent: 206, dependent conditional: 206, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6855, independent: 6649, independent conditional: 0, independent unconditional: 6649, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6855, independent: 6649, independent conditional: 0, independent unconditional: 6649, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6855, independent: 6649, independent conditional: 0, independent unconditional: 6649, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5796, independent: 5695, independent conditional: 0, independent unconditional: 5695, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5796, independent: 5681, independent conditional: 0, independent unconditional: 5681, dependent: 115, dependent conditional: 0, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 115, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 163, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6855, independent: 954, independent conditional: 0, independent unconditional: 954, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 5796, unknown conditional: 0, unknown unconditional: 5796] , Statistics on independence cache: Total cache size (in pairs): 9610, Positive cache size: 9509, Positive conditional cache size: 0, Positive unconditional cache size: 9509, Negative cache size: 101, Negative conditional cache size: 0, Negative unconditional cache size: 101, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 42 PlacesBefore, 42 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 948 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 262, independent: 204, independent conditional: 204, independent unconditional: 0, dependent: 58, dependent conditional: 58, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 262, independent: 204, independent conditional: 0, independent unconditional: 204, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 262, independent: 204, independent conditional: 0, independent unconditional: 204, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 262, independent: 204, independent conditional: 0, independent unconditional: 204, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 231, independent: 185, independent conditional: 0, independent unconditional: 185, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 231, independent: 172, independent conditional: 0, independent unconditional: 172, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 59, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 65, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 262, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 231, unknown conditional: 0, unknown unconditional: 231] , Statistics on independence cache: Total cache size (in pairs): 231, Positive cache size: 185, Positive conditional cache size: 0, Positive unconditional cache size: 185, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46, 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.7s, 41 PlacesBefore, 32 PlacesAfterwards, 39 TransitionsBefore, 30 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 116, independent: 62, independent conditional: 62, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 116, independent: 62, independent conditional: 0, independent unconditional: 62, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 116, independent: 62, independent conditional: 0, independent unconditional: 62, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 116, independent: 62, independent conditional: 0, independent unconditional: 62, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 51, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 51, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 116, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 51, unknown conditional: 0, unknown unconditional: 51] , Statistics on independence cache: Total cache size (in pairs): 336, Positive cache size: 275, Positive conditional cache size: 0, Positive unconditional cache size: 275, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 32 PlacesBefore, 30 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 62, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 62, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 62, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 62, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 347, Positive cache size: 286, Positive conditional cache size: 0, Positive unconditional cache size: 286, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61, 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, 31 PlacesBefore, 31 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 24, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 351, Positive cache size: 286, Positive conditional cache size: 0, Positive unconditional cache size: 286, Negative cache size: 65, Negative conditional cache size: 0, Negative unconditional cache size: 65, 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, 31 TransitionsBefore, 31 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 28, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 24, dependent conditional: 1, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 24, dependent conditional: 1, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 24, dependent conditional: 1, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 28, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 352, Positive cache size: 286, Positive conditional cache size: 0, Positive unconditional cache size: 286, Negative cache size: 66, Negative conditional cache size: 1, Negative unconditional cache size: 65, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 1, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 27, dependent conditional: 2, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 27, dependent conditional: 2, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 1, dependent unconditional: 25, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 353, Positive cache size: 286, Positive conditional cache size: 0, Positive unconditional cache size: 286, Negative cache size: 67, Negative conditional cache size: 2, Negative unconditional cache size: 65, 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.9s, 129 PlacesBefore, 127 PlacesAfterwards, 156 TransitionsBefore, 154 TransitionsAfterwards, 716 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 92, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 47, dependent conditional: 47, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 92, independent: 45, independent conditional: 37, independent unconditional: 8, dependent: 47, dependent conditional: 39, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 94, independent: 45, independent conditional: 34, independent unconditional: 11, dependent: 49, dependent conditional: 39, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 94, independent: 45, independent conditional: 34, independent unconditional: 11, dependent: 49, dependent conditional: 39, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 35, independent: 21, independent conditional: 20, independent unconditional: 1, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 35, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 58, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 94, independent: 24, independent conditional: 14, independent unconditional: 10, dependent: 35, dependent conditional: 25, dependent unconditional: 10, unknown: 35, unknown conditional: 34, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 394, Positive cache size: 313, Positive conditional cache size: 20, Positive unconditional cache size: 293, Negative cache size: 81, Negative conditional cache size: 16, Negative unconditional cache size: 65, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 159 PlacesBefore, 159 PlacesAfterwards, 199 TransitionsBefore, 199 TransitionsAfterwards, 892 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 18, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 17, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 17, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 8, dependent unconditional: 5, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 403, Positive cache size: 313, Positive conditional cache size: 20, Positive unconditional cache size: 293, Negative cache size: 90, Negative conditional cache size: 25, Negative unconditional cache size: 65, 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.0s, 236 PlacesBefore, 236 PlacesAfterwards, 290 TransitionsBefore, 290 TransitionsAfterwards, 1256 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 29, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 22, dependent conditional: 18, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 29, independent: 7, independent conditional: 2, independent unconditional: 5, dependent: 22, dependent conditional: 17, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 29, independent: 7, independent conditional: 2, independent unconditional: 5, dependent: 22, dependent conditional: 17, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 29, independent: 7, independent conditional: 2, independent unconditional: 5, dependent: 21, dependent conditional: 16, dependent unconditional: 5, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 404, Positive cache size: 313, Positive conditional cache size: 20, Positive unconditional cache size: 293, Negative cache size: 91, Negative conditional cache size: 26, Negative unconditional cache size: 65, 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.1s, 389 PlacesBefore, 389 PlacesAfterwards, 471 TransitionsBefore, 471 TransitionsAfterwards, 1980 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 18, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 17, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 17, dependent unconditional: 5, 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: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 17, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 404, Positive cache size: 313, Positive conditional cache size: 20, Positive unconditional cache size: 293, Negative cache size: 91, Negative conditional cache size: 26, Negative unconditional cache size: 65, 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.2s, 335 PlacesBefore, 335 PlacesAfterwards, 468 TransitionsBefore, 468 TransitionsAfterwards, 1968 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 36, independent: 11, independent conditional: 6, independent unconditional: 5, dependent: 25, dependent conditional: 21, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 36, independent: 11, independent conditional: 5, independent unconditional: 6, dependent: 25, dependent conditional: 20, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 36, independent: 11, independent conditional: 5, independent unconditional: 6, dependent: 25, dependent conditional: 20, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 36, independent: 8, independent conditional: 3, independent unconditional: 5, dependent: 13, dependent conditional: 8, dependent unconditional: 5, unknown: 15, unknown conditional: 14, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 419, Positive cache size: 316, Positive conditional cache size: 22, Positive unconditional cache size: 294, Negative cache size: 103, Negative conditional cache size: 38, Negative unconditional cache size: 65, 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.5s, 693 PlacesBefore, 693 PlacesAfterwards, 829 TransitionsBefore, 829 TransitionsAfterwards, 3412 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 37, independent: 11, independent conditional: 7, independent unconditional: 4, dependent: 26, dependent conditional: 22, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 39, independent: 11, independent conditional: 6, independent unconditional: 5, dependent: 28, dependent conditional: 23, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 39, independent: 11, independent conditional: 6, independent unconditional: 5, dependent: 28, dependent conditional: 23, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 39, independent: 9, independent conditional: 4, independent unconditional: 5, dependent: 22, dependent conditional: 17, dependent unconditional: 5, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 427, Positive cache size: 318, Positive conditional cache size: 24, Positive unconditional cache size: 294, Negative cache size: 109, Negative conditional cache size: 44, Negative unconditional cache size: 65, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 1 - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown