/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack_longer-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 02:48:18,030 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 02:48:18,031 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 02:48:18,059 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 02:48:18,059 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 02:48:18,060 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 02:48:18,062 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 02:48:18,063 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 02:48:18,066 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 02:48:18,071 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 02:48:18,072 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 02:48:18,074 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 02:48:18,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 02:48:18,076 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 02:48:18,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 02:48:18,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 02:48:18,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 02:48:18,078 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 02:48:18,079 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 02:48:18,080 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 02:48:18,081 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 02:48:18,082 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 02:48:18,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 02:48:18,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 02:48:18,085 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 02:48:18,085 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 02:48:18,085 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 02:48:18,105 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 02:48:18,105 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 02:48:18,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 02:48:18,106 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 02:48:18,107 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 02:48:18,107 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 02:48:18,108 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 02:48:18,108 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 02:48:18,108 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 02:48:18,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 02:48:18,109 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 02:48:18,109 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 02:48:18,110 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 02:48:18,110 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 02:48:18,111 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 02:48:18,127 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 02:48:18,127 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 02:48:18,129 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 02:48:18,129 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 02:48:18,129 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 02:48:18,130 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 02:48:18,130 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 02:48:18,130 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 02:48:18,130 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 02:48:18,130 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 02:48:18,131 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 02:48:18,131 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 02:48:18,131 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 02:48:18,131 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 02:48:18,131 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 02:48:18,131 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 02:48:18,132 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 02:48:18,132 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 02:48:18,132 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 02:48:18,132 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 02:48:18,132 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 02:48:18,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 02:48:18,132 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 02:48:18,132 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 02:48:18,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 02:48:18,132 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 02:48:18,133 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 02:48:18,133 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 02:48:18,133 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-13 02:48:18,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 02:48:18,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 02:48:18,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 02:48:18,436 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 02:48:18,436 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 02:48:18,437 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longer-2.i [2022-12-13 02:48:19,466 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 02:48:19,729 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 02:48:19,729 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-2.i [2022-12-13 02:48:19,742 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5376c43e1/3ff3fd68a5cb4026afab4c873f766835/FLAGb867cdaf9 [2022-12-13 02:48:19,758 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5376c43e1/3ff3fd68a5cb4026afab4c873f766835 [2022-12-13 02:48:19,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 02:48:19,761 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 02:48:19,763 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 02:48:19,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 02:48:19,765 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 02:48:19,765 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:48:19" (1/1) ... [2022-12-13 02:48:19,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60f23b5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:48:19, skipping insertion in model container [2022-12-13 02:48:19,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:48:19" (1/1) ... [2022-12-13 02:48:19,770 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 02:48:19,804 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 02:48:20,065 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/stack_longer-2.i[41529,41542] [2022-12-13 02:48:20,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 02:48:20,102 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 02:48:20,132 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/stack_longer-2.i[41529,41542] [2022-12-13 02:48:20,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 02:48:20,185 INFO L208 MainTranslator]: Completed translation [2022-12-13 02:48:20,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:48:20 WrapperNode [2022-12-13 02:48:20,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 02:48:20,187 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 02:48:20,187 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 02:48:20,188 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 02:48:20,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:48:20" (1/1) ... [2022-12-13 02:48:20,218 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:48:20" (1/1) ... [2022-12-13 02:48:20,242 INFO L138 Inliner]: procedures = 277, calls = 38, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 148 [2022-12-13 02:48:20,242 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 02:48:20,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 02:48:20,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 02:48:20,243 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 02:48:20,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:48:20" (1/1) ... [2022-12-13 02:48:20,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:48:20" (1/1) ... [2022-12-13 02:48:20,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:48:20" (1/1) ... [2022-12-13 02:48:20,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:48:20" (1/1) ... [2022-12-13 02:48:20,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:48:20" (1/1) ... [2022-12-13 02:48:20,270 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:48:20" (1/1) ... [2022-12-13 02:48:20,272 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:48:20" (1/1) ... [2022-12-13 02:48:20,272 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:48:20" (1/1) ... [2022-12-13 02:48:20,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 02:48:20,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 02:48:20,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 02:48:20,284 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 02:48:20,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:48:20" (1/1) ... [2022-12-13 02:48:20,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 02:48:20,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:48:20,307 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-13 02:48:20,357 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-13 02:48:20,368 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-13 02:48:20,369 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-13 02:48:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-13 02:48:20,370 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-13 02:48:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 02:48:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 02:48:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 02:48:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 02:48:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 02:48:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 02:48:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 02:48:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 02:48:20,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 02:48:20,371 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 02:48:20,468 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 02:48:20,469 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 02:48:20,705 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 02:48:20,711 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 02:48:20,711 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 02:48:20,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:48:20 BoogieIcfgContainer [2022-12-13 02:48:20,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 02:48:20,714 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 02:48:20,714 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 02:48:20,716 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 02:48:20,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 02:48:19" (1/3) ... [2022-12-13 02:48:20,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@477d38d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:48:20, skipping insertion in model container [2022-12-13 02:48:20,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:48:20" (2/3) ... [2022-12-13 02:48:20,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@477d38d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:48:20, skipping insertion in model container [2022-12-13 02:48:20,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:48:20" (3/3) ... [2022-12-13 02:48:20,718 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longer-2.i [2022-12-13 02:48:20,733 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 02:48:20,733 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 02:48:20,733 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 02:48:20,800 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 02:48:20,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 150 transitions, 316 flow [2022-12-13 02:48:20,901 INFO L130 PetriNetUnfolder]: 10/148 cut-off events. [2022-12-13 02:48:20,901 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 02:48:20,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 148 events. 10/148 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 353 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 110. Up to 3 conditions per place. [2022-12-13 02:48:20,914 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 150 transitions, 316 flow [2022-12-13 02:48:20,918 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 139 transitions, 287 flow [2022-12-13 02:48:20,919 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:48:20,934 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 139 transitions, 287 flow [2022-12-13 02:48:20,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 139 transitions, 287 flow [2022-12-13 02:48:20,964 INFO L130 PetriNetUnfolder]: 10/139 cut-off events. [2022-12-13 02:48:20,964 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 02:48:20,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 139 events. 10/139 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 307 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 110. Up to 3 conditions per place. [2022-12-13 02:48:20,970 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 139 transitions, 287 flow [2022-12-13 02:48:20,970 INFO L226 LiptonReduction]: Number of co-enabled transitions 6382 [2022-12-13 02:48:25,194 INFO L241 LiptonReduction]: Total number of compositions: 116 [2022-12-13 02:48:25,206 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 02:48:25,210 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;@2276db65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 02:48:25,211 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 02:48:25,217 INFO L130 PetriNetUnfolder]: 1/55 cut-off events. [2022-12-13 02:48:25,217 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 02:48:25,217 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:48:25,218 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 02:48:25,218 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 02:48:25,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:48:25,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1688471119, now seen corresponding path program 1 times [2022-12-13 02:48:25,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:48:25,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842549469] [2022-12-13 02:48:25,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:48:25,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:48:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:48:25,406 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-13 02:48:25,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:48:25,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842549469] [2022-12-13 02:48:25,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842549469] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:48:25,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:48:25,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 02:48:25,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571784181] [2022-12-13 02:48:25,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:48:25,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 02:48:25,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:48:25,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 02:48:25,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 02:48:25,429 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 110 [2022-12-13 02:48:25,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 110 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-13 02:48:25,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:48:25,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 110 [2022-12-13 02:48:25,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:48:26,609 INFO L130 PetriNetUnfolder]: 12108/20257 cut-off events. [2022-12-13 02:48:26,609 INFO L131 PetriNetUnfolder]: For 196/196 co-relation queries the response was YES. [2022-12-13 02:48:26,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39810 conditions, 20257 events. 12108/20257 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 148702 event pairs, 5729 based on Foata normal form. 0/6684 useless extension candidates. Maximal degree in co-relation 39251. Up to 12849 conditions per place. [2022-12-13 02:48:26,695 INFO L137 encePairwiseOnDemand]: 89/110 looper letters, 149 selfloop transitions, 8 changer transitions 2/171 dead transitions. [2022-12-13 02:48:26,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 171 transitions, 675 flow [2022-12-13 02:48:26,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 02:48:26,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 02:48:26,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 212 transitions. [2022-12-13 02:48:26,706 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2022-12-13 02:48:26,710 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -2 predicate places. [2022-12-13 02:48:26,711 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 171 transitions, 675 flow [2022-12-13 02:48:26,748 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 169 transitions, 667 flow [2022-12-13 02:48:26,813 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:48:26,814 INFO L89 Accepts]: Start accepts. Operand has 107 places, 169 transitions, 667 flow [2022-12-13 02:48:26,817 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:48:26,817 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:48:26,818 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 169 transitions, 667 flow [2022-12-13 02:48:26,831 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 169 transitions, 667 flow [2022-12-13 02:48:26,831 INFO L226 LiptonReduction]: Number of co-enabled transitions 1874 [2022-12-13 02:48:26,856 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:48:26,861 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-13 02:48:26,862 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 169 transitions, 667 flow [2022-12-13 02:48:26,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-13 02:48:26,862 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:48:26,862 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:48:26,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 02:48:26,863 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 02:48:26,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:48:26,863 INFO L85 PathProgramCache]: Analyzing trace with hash 603354056, now seen corresponding path program 1 times [2022-12-13 02:48:26,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:48:26,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069414830] [2022-12-13 02:48:26,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:48:26,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:48:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:48:26,987 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-13 02:48:26,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:48:26,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069414830] [2022-12-13 02:48:26,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069414830] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:48:26,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:48:26,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 02:48:26,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566385344] [2022-12-13 02:48:26,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:48:26,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 02:48:26,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:48:26,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 02:48:26,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 02:48:26,990 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 104 [2022-12-13 02:48:26,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 169 transitions, 667 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-13 02:48:26,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:48:26,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 104 [2022-12-13 02:48:26,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:48:28,540 INFO L130 PetriNetUnfolder]: 13768/22494 cut-off events. [2022-12-13 02:48:28,540 INFO L131 PetriNetUnfolder]: For 680/724 co-relation queries the response was YES. [2022-12-13 02:48:28,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64522 conditions, 22494 events. 13768/22494 cut-off events. For 680/724 co-relation queries the response was YES. Maximal size of possible extension queue 932. Compared 162562 event pairs, 5703 based on Foata normal form. 0/8135 useless extension candidates. Maximal degree in co-relation 63741. Up to 19242 conditions per place. [2022-12-13 02:48:28,624 INFO L137 encePairwiseOnDemand]: 95/104 looper letters, 206 selfloop transitions, 12 changer transitions 0/239 dead transitions. [2022-12-13 02:48:28,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 239 transitions, 1384 flow [2022-12-13 02:48:28,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 02:48:28,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 02:48:28,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2022-12-13 02:48:28,630 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6057692307692307 [2022-12-13 02:48:28,632 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -2 predicate places. [2022-12-13 02:48:28,632 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 239 transitions, 1384 flow [2022-12-13 02:48:28,681 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 239 transitions, 1384 flow [2022-12-13 02:48:28,779 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:48:28,779 INFO L89 Accepts]: Start accepts. Operand has 109 places, 239 transitions, 1384 flow [2022-12-13 02:48:28,780 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:48:28,780 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:48:28,781 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 239 transitions, 1384 flow [2022-12-13 02:48:28,792 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 239 transitions, 1384 flow [2022-12-13 02:48:28,792 INFO L226 LiptonReduction]: Number of co-enabled transitions 2076 [2022-12-13 02:48:28,806 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:48:28,809 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-13 02:48:28,810 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 239 transitions, 1384 flow [2022-12-13 02:48:28,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-13 02:48:28,810 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:48:28,810 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:48:28,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 02:48:28,810 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 02:48:28,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:48:28,811 INFO L85 PathProgramCache]: Analyzing trace with hash 85783273, now seen corresponding path program 1 times [2022-12-13 02:48:28,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:48:28,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417882844] [2022-12-13 02:48:28,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:48:28,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:48:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:48:28,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:48:28,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:48:28,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417882844] [2022-12-13 02:48:28,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417882844] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:48:28,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479964990] [2022-12-13 02:48:28,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:48:28,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:48:28,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:48:28,923 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-13 02:48:28,963 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-13 02:48:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:48:29,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 02:48:29,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:48:29,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:48:29,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:48:29,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:48:29,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479964990] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:48:29,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:48:29,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-13 02:48:29,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068909603] [2022-12-13 02:48:29,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:48:29,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 02:48:29,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:48:29,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 02:48:29,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 02:48:29,189 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 104 [2022-12-13 02:48:29,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 239 transitions, 1384 flow. Second operand has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 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-13 02:48:29,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:48:29,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 104 [2022-12-13 02:48:29,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:48:32,549 INFO L130 PetriNetUnfolder]: 30444/49480 cut-off events. [2022-12-13 02:48:32,550 INFO L131 PetriNetUnfolder]: For 2556/2638 co-relation queries the response was YES. [2022-12-13 02:48:32,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189224 conditions, 49480 events. 30444/49480 cut-off events. For 2556/2638 co-relation queries the response was YES. Maximal size of possible extension queue 1882. Compared 389980 event pairs, 4603 based on Foata normal form. 152/18575 useless extension candidates. Maximal degree in co-relation 186884. Up to 41550 conditions per place. [2022-12-13 02:48:32,704 INFO L137 encePairwiseOnDemand]: 82/104 looper letters, 625 selfloop transitions, 90 changer transitions 174/902 dead transitions. [2022-12-13 02:48:32,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 902 transitions, 7077 flow [2022-12-13 02:48:32,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 02:48:32,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 02:48:32,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 989 transitions. [2022-12-13 02:48:32,707 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5005060728744939 [2022-12-13 02:48:32,709 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 16 predicate places. [2022-12-13 02:48:32,709 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 902 transitions, 7077 flow [2022-12-13 02:48:32,808 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 728 transitions, 5716 flow [2022-12-13 02:48:33,037 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:48:33,037 INFO L89 Accepts]: Start accepts. Operand has 126 places, 728 transitions, 5716 flow [2022-12-13 02:48:33,039 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:48:33,039 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:48:33,039 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 728 transitions, 5716 flow [2022-12-13 02:48:33,190 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 728 transitions, 5716 flow [2022-12-13 02:48:33,190 INFO L226 LiptonReduction]: Number of co-enabled transitions 4766 [2022-12-13 02:48:33,224 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:48:33,225 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-13 02:48:33,225 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 728 transitions, 5716 flow [2022-12-13 02:48:33,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 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-13 02:48:33,225 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:48:33,225 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:48:33,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-13 02:48:33,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:48:33,430 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 02:48:33,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:48:33,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1181834336, now seen corresponding path program 1 times [2022-12-13 02:48:33,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:48:33,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497153857] [2022-12-13 02:48:33,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:48:33,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:48:33,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:48:33,569 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-13 02:48:33,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:48:33,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497153857] [2022-12-13 02:48:33,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497153857] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:48:33,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:48:33,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:48:33,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19194153] [2022-12-13 02:48:33,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:48:33,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 02:48:33,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:48:33,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 02:48:33,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 02:48:33,575 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 104 [2022-12-13 02:48:33,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 728 transitions, 5716 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-13 02:48:33,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:48:33,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 104 [2022-12-13 02:48:33,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:48:34,892 INFO L130 PetriNetUnfolder]: 8670/14977 cut-off events. [2022-12-13 02:48:34,892 INFO L131 PetriNetUnfolder]: For 2352/2352 co-relation queries the response was YES. [2022-12-13 02:48:34,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72306 conditions, 14977 events. 8670/14977 cut-off events. For 2352/2352 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 105656 event pairs, 298 based on Foata normal form. 18/6014 useless extension candidates. Maximal degree in co-relation 70204. Up to 13295 conditions per place. [2022-12-13 02:48:34,926 INFO L137 encePairwiseOnDemand]: 82/104 looper letters, 278 selfloop transitions, 29 changer transitions 168/500 dead transitions. [2022-12-13 02:48:34,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 500 transitions, 4870 flow [2022-12-13 02:48:34,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 02:48:34,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 02:48:34,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2022-12-13 02:48:34,928 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5576923076923077 [2022-12-13 02:48:34,928 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 11 predicate places. [2022-12-13 02:48:34,928 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 500 transitions, 4870 flow [2022-12-13 02:48:34,954 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 332 transitions, 3237 flow [2022-12-13 02:48:35,016 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:48:35,017 INFO L89 Accepts]: Start accepts. Operand has 72 places, 332 transitions, 3237 flow [2022-12-13 02:48:35,018 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:48:35,018 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:48:35,018 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 332 transitions, 3237 flow [2022-12-13 02:48:35,027 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 332 transitions, 3237 flow [2022-12-13 02:48:35,028 INFO L226 LiptonReduction]: Number of co-enabled transitions 1538 [2022-12-13 02:48:35,122 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:48:35,123 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-13 02:48:35,123 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 332 transitions, 3243 flow [2022-12-13 02:48:35,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-13 02:48:35,123 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:48:35,123 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:48:35,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 02:48:35,123 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 02:48:35,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:48:35,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1704635106, now seen corresponding path program 1 times [2022-12-13 02:48:35,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:48:35,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760188755] [2022-12-13 02:48:35,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:48:35,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:48:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:48:35,156 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-13 02:48:35,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:48:35,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760188755] [2022-12-13 02:48:35,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760188755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:48:35,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:48:35,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:48:35,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711646785] [2022-12-13 02:48:35,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:48:35,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 02:48:35,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:48:35,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 02:48:35,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 02:48:35,159 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 61 [2022-12-13 02:48:35,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 332 transitions, 3243 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-13 02:48:35,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:48:35,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 61 [2022-12-13 02:48:35,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:48:35,710 INFO L130 PetriNetUnfolder]: 3576/6456 cut-off events. [2022-12-13 02:48:35,711 INFO L131 PetriNetUnfolder]: For 1637/1637 co-relation queries the response was YES. [2022-12-13 02:48:35,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36406 conditions, 6456 events. 3576/6456 cut-off events. For 1637/1637 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 40382 event pairs, 103 based on Foata normal form. 23/3635 useless extension candidates. Maximal degree in co-relation 34890. Up to 5464 conditions per place. [2022-12-13 02:48:35,732 INFO L137 encePairwiseOnDemand]: 53/61 looper letters, 364 selfloop transitions, 8 changer transitions 5/388 dead transitions. [2022-12-13 02:48:35,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 388 transitions, 4567 flow [2022-12-13 02:48:35,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 02:48:35,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 02:48:35,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2022-12-13 02:48:35,734 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6338797814207651 [2022-12-13 02:48:35,734 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -37 predicate places. [2022-12-13 02:48:35,734 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 388 transitions, 4567 flow [2022-12-13 02:48:35,753 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 383 transitions, 4504 flow [2022-12-13 02:48:35,783 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:48:35,784 INFO L89 Accepts]: Start accepts. Operand has 74 places, 383 transitions, 4504 flow [2022-12-13 02:48:35,785 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:48:35,786 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:48:35,786 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 383 transitions, 4504 flow [2022-12-13 02:48:35,796 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 383 transitions, 4504 flow [2022-12-13 02:48:35,797 INFO L226 LiptonReduction]: Number of co-enabled transitions 1732 [2022-12-13 02:48:35,800 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:48:35,801 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-13 02:48:35,801 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 383 transitions, 4504 flow [2022-12-13 02:48:35,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-13 02:48:35,801 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:48:35,801 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:48:35,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 02:48:35,802 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 02:48:35,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:48:35,802 INFO L85 PathProgramCache]: Analyzing trace with hash 3699687, now seen corresponding path program 1 times [2022-12-13 02:48:35,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:48:35,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547996394] [2022-12-13 02:48:35,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:48:35,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:48:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:48:36,321 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-13 02:48:36,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:48:36,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547996394] [2022-12-13 02:48:36,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547996394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:48:36,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:48:36,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 02:48:36,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297028903] [2022-12-13 02:48:36,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:48:36,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 02:48:36,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:48:36,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 02:48:36,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-13 02:48:36,327 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2022-12-13 02:48:36,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 383 transitions, 4504 flow. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 11 states have internal predecessors, (151), 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-13 02:48:36,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:48:36,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2022-12-13 02:48:36,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:48:38,141 INFO L130 PetriNetUnfolder]: 7546/13543 cut-off events. [2022-12-13 02:48:38,141 INFO L131 PetriNetUnfolder]: For 6535/6535 co-relation queries the response was YES. [2022-12-13 02:48:38,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88476 conditions, 13543 events. 7546/13543 cut-off events. For 6535/6535 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 93628 event pairs, 96 based on Foata normal form. 0/7485 useless extension candidates. Maximal degree in co-relation 84645. Up to 12229 conditions per place. [2022-12-13 02:48:38,195 INFO L137 encePairwiseOnDemand]: 51/60 looper letters, 723 selfloop transitions, 24 changer transitions 59/829 dead transitions. [2022-12-13 02:48:38,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 829 transitions, 11514 flow [2022-12-13 02:48:38,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 02:48:38,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 02:48:38,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 320 transitions. [2022-12-13 02:48:38,197 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-13 02:48:38,198 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -28 predicate places. [2022-12-13 02:48:38,198 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 829 transitions, 11514 flow [2022-12-13 02:48:38,245 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 770 transitions, 10695 flow [2022-12-13 02:48:38,337 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:48:38,337 INFO L89 Accepts]: Start accepts. Operand has 81 places, 770 transitions, 10695 flow [2022-12-13 02:48:38,339 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:48:38,339 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:48:38,339 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 770 transitions, 10695 flow [2022-12-13 02:48:38,378 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 770 transitions, 10695 flow [2022-12-13 02:48:38,378 INFO L226 LiptonReduction]: Number of co-enabled transitions 3304 [2022-12-13 02:48:38,384 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:48:38,384 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-13 02:48:38,385 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 770 transitions, 10695 flow [2022-12-13 02:48:38,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 11 states have internal predecessors, (151), 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-13 02:48:38,385 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:48:38,385 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:48:38,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 02:48:38,385 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 02:48:38,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:48:38,386 INFO L85 PathProgramCache]: Analyzing trace with hash -66498153, now seen corresponding path program 2 times [2022-12-13 02:48:38,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:48:38,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520852610] [2022-12-13 02:48:38,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:48:38,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:48:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:48:38,916 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-13 02:48:38,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:48:38,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520852610] [2022-12-13 02:48:38,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520852610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:48:38,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:48:38,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 02:48:38,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852321311] [2022-12-13 02:48:38,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:48:38,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 02:48:38,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:48:38,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 02:48:38,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-13 02:48:38,923 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 58 [2022-12-13 02:48:38,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 770 transitions, 10695 flow. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 11 states have internal predecessors, (151), 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-13 02:48:38,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:48:38,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 58 [2022-12-13 02:48:38,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:48:42,734 INFO L130 PetriNetUnfolder]: 10669/19309 cut-off events. [2022-12-13 02:48:42,734 INFO L131 PetriNetUnfolder]: For 13326/13326 co-relation queries the response was YES. [2022-12-13 02:48:42,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143565 conditions, 19309 events. 10669/19309 cut-off events. For 13326/13326 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 144010 event pairs, 156 based on Foata normal form. 0/10673 useless extension candidates. Maximal degree in co-relation 138336. Up to 17745 conditions per place. [2022-12-13 02:48:42,826 INFO L137 encePairwiseOnDemand]: 50/58 looper letters, 1027 selfloop transitions, 34 changer transitions 67/1151 dead transitions. [2022-12-13 02:48:42,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 1151 transitions, 18333 flow [2022-12-13 02:48:42,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 02:48:42,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 02:48:42,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 316 transitions. [2022-12-13 02:48:42,827 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5448275862068965 [2022-12-13 02:48:42,828 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -21 predicate places. [2022-12-13 02:48:42,828 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 1151 transitions, 18333 flow [2022-12-13 02:48:42,911 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 1084 transitions, 17228 flow [2022-12-13 02:48:43,104 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:48:43,104 INFO L89 Accepts]: Start accepts. Operand has 90 places, 1084 transitions, 17228 flow [2022-12-13 02:48:43,108 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:48:43,109 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:48:43,109 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 1084 transitions, 17228 flow [2022-12-13 02:48:43,215 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 1084 transitions, 17228 flow [2022-12-13 02:48:43,216 INFO L226 LiptonReduction]: Number of co-enabled transitions 4544 [2022-12-13 02:48:43,225 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:48:43,226 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:48:43,226 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 1084 transitions, 17228 flow [2022-12-13 02:48:43,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 11 states have internal predecessors, (151), 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-13 02:48:43,227 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:48:43,227 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:48:43,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 02:48:43,227 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 02:48:43,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:48:43,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1320916582, now seen corresponding path program 1 times [2022-12-13 02:48:43,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:48:43,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096230892] [2022-12-13 02:48:43,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:48:43,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:48:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:48:43,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:48:43,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:48:43,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096230892] [2022-12-13 02:48:43,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096230892] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:48:43,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950132021] [2022-12-13 02:48:43,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:48:43,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:48:43,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:48:43,304 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-13 02:48:43,340 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-13 02:48:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:48:43,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 02:48:43,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:48:43,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 02:48:43,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 02:48:43,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950132021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:48:43,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 02:48:43,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-12-13 02:48:43,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658554580] [2022-12-13 02:48:43,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:48:43,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:48:43,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:48:43,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:48:43,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:48:43,480 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 58 [2022-12-13 02:48:43,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 1084 transitions, 17228 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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-13 02:48:43,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:48:43,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 58 [2022-12-13 02:48:43,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:48:47,219 INFO L130 PetriNetUnfolder]: 10413/18261 cut-off events. [2022-12-13 02:48:47,220 INFO L131 PetriNetUnfolder]: For 14367/14367 co-relation queries the response was YES. [2022-12-13 02:48:47,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153605 conditions, 18261 events. 10413/18261 cut-off events. For 14367/14367 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 128485 event pairs, 156 based on Foata normal form. 29/10240 useless extension candidates. Maximal degree in co-relation 147835. Up to 16899 conditions per place. [2022-12-13 02:48:47,310 INFO L137 encePairwiseOnDemand]: 47/58 looper letters, 1200 selfloop transitions, 36 changer transitions 5/1250 dead transitions. [2022-12-13 02:48:47,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 1250 transitions, 22359 flow [2022-12-13 02:48:47,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:48:47,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:48:47,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 193 transitions. [2022-12-13 02:48:47,311 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5545977011494253 [2022-12-13 02:48:47,312 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -16 predicate places. [2022-12-13 02:48:47,312 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 1250 transitions, 22359 flow [2022-12-13 02:48:47,390 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 1245 transitions, 22266 flow [2022-12-13 02:48:47,572 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:48:47,572 INFO L89 Accepts]: Start accepts. Operand has 95 places, 1245 transitions, 22266 flow [2022-12-13 02:48:47,576 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:48:47,576 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:48:47,576 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 1245 transitions, 22266 flow [2022-12-13 02:48:47,689 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 1245 transitions, 22266 flow [2022-12-13 02:48:47,689 INFO L226 LiptonReduction]: Number of co-enabled transitions 5044 [2022-12-13 02:48:47,696 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:48:47,696 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:48:47,696 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 1245 transitions, 22266 flow [2022-12-13 02:48:47,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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-13 02:48:47,697 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:48:47,697 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:48:47,701 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-13 02:48:47,901 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,SelfDestructingSolverStorable7 [2022-12-13 02:48:47,901 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 02:48:47,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:48:47,902 INFO L85 PathProgramCache]: Analyzing trace with hash -683792910, now seen corresponding path program 1 times [2022-12-13 02:48:47,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:48:47,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838412383] [2022-12-13 02:48:47,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:48:47,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:48:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:48:48,384 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:48:48,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:48:48,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838412383] [2022-12-13 02:48:48,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838412383] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:48:48,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:48:48,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 02:48:48,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242589409] [2022-12-13 02:48:48,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:48:48,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 02:48:48,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:48:48,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 02:48:48,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-12-13 02:48:48,386 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 58 [2022-12-13 02:48:48,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 1245 transitions, 22266 flow. Second operand has 14 states, 14 states have (on average 10.928571428571429) internal successors, (153), 14 states have internal predecessors, (153), 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-13 02:48:48,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:48:48,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 58 [2022-12-13 02:48:48,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:48:55,552 INFO L130 PetriNetUnfolder]: 16677/29484 cut-off events. [2022-12-13 02:48:55,553 INFO L131 PetriNetUnfolder]: For 22474/22474 co-relation queries the response was YES. [2022-12-13 02:48:55,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275728 conditions, 29484 events. 16677/29484 cut-off events. For 22474/22474 co-relation queries the response was YES. Maximal size of possible extension queue 817. Compared 226487 event pairs, 267 based on Foata normal form. 0/16456 useless extension candidates. Maximal degree in co-relation 265248. Up to 27589 conditions per place. [2022-12-13 02:48:55,776 INFO L137 encePairwiseOnDemand]: 41/58 looper letters, 2440 selfloop transitions, 210 changer transitions 77/2736 dead transitions. [2022-12-13 02:48:55,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 2736 transitions, 54418 flow [2022-12-13 02:48:55,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 02:48:55,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-13 02:48:55,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 585 transitions. [2022-12-13 02:48:55,791 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3602216748768473 [2022-12-13 02:48:55,792 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 11 predicate places. [2022-12-13 02:48:55,792 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 2736 transitions, 54418 flow [2022-12-13 02:48:55,931 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 2659 transitions, 52839 flow [2022-12-13 02:48:56,654 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:48:56,655 INFO L89 Accepts]: Start accepts. Operand has 122 places, 2659 transitions, 52839 flow [2022-12-13 02:48:56,663 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:48:56,663 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:48:56,663 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 2659 transitions, 52839 flow [2022-12-13 02:48:57,237 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 2659 transitions, 52839 flow [2022-12-13 02:48:57,238 INFO L226 LiptonReduction]: Number of co-enabled transitions 9586 [2022-12-13 02:48:57,247 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:48:57,248 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 594 [2022-12-13 02:48:57,248 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 2659 transitions, 52839 flow [2022-12-13 02:48:57,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.928571428571429) internal successors, (153), 14 states have internal predecessors, (153), 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-13 02:48:57,248 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:48:57,249 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:48:57,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 02:48:57,249 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 02:48:57,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:48:57,249 INFO L85 PathProgramCache]: Analyzing trace with hash 314419190, now seen corresponding path program 2 times [2022-12-13 02:48:57,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:48:57,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253247112] [2022-12-13 02:48:57,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:48:57,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:48:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:48:57,721 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:48:57,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:48:57,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253247112] [2022-12-13 02:48:57,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253247112] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:48:57,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108405515] [2022-12-13 02:48:57,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 02:48:57,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:48:57,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:48:57,736 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-13 02:48:57,777 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-13 02:48:57,854 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 02:48:57,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 02:48:57,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-13 02:48:57,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:48:57,889 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-13 02:48:57,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-12-13 02:48:58,113 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 22 treesize of output 17 [2022-12-13 02:48:58,247 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 63 treesize of output 58 [2022-12-13 02:48:58,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 46 [2022-12-13 02:49:07,168 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:49:07,168 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 02:49:07,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108405515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:49:07,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 02:49:07,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 26 [2022-12-13 02:49:07,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13815118] [2022-12-13 02:49:07,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:49:07,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 02:49:07,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:49:07,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 02:49:07,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=686, Unknown=2, NotChecked=0, Total=756 [2022-12-13 02:49:07,170 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 58 [2022-12-13 02:49:07,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 2659 transitions, 52839 flow. Second operand has 15 states, 15 states have (on average 10.8) internal successors, (162), 15 states have internal predecessors, (162), 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-13 02:49:07,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:49:07,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 58 [2022-12-13 02:49:07,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:49:10,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:49:12,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:49:14,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:49:16,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:49:18,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:49:20,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:49:22,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:49:24,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:49:26,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:49:28,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:49:30,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:49:32,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:49:34,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:49:36,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:49:37,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:49:39,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:49:42,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:49:44,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:49:46,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:49:48,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:49:50,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:49:52,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:49:54,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:49:56,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:49:59,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:50:01,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:50:03,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:50:05,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:50:07,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:50:09,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:50:11,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:50:13,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:50:15,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:50:17,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:50:19,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:50:21,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:50:23,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:50:25,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:50:27,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:50:29,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:50:31,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:50:33,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:50:36,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:50:38,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:50:40,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:50:42,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:50:44,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:50:46,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:50:48,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:50:50,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:50:52,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:50:54,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:50:56,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:50:58,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:51:00,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:51:02,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:51:04,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:51:06,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:51:08,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:51:10,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:51:13,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:51:15,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:51:17,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:51:19,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:51:21,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:51:23,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:51:25,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:51:27,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:51:29,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:51:31,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:51:33,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:51:35,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:51:37,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:51:39,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:51:42,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:51:44,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:51:45,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:51:47,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:51:49,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:51:51,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:51:53,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:51:55,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:51:57,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:51:59,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:52:02,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:52:04,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:52:06,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:52:08,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:52:10,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:52:12,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:52:14,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:52:16,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:52:18,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:52:20,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:52:22,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:52:24,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:52:26,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:52:29,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:52:31,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:52:33,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:52:35,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:52:37,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:52:39,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:52:41,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:52:43,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:52:45,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:52:47,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:52:49,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:52:51,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:52:53,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:52:56,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:52:58,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:53:00,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:53:02,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:53:04,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:53:06,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:53:08,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:53:10,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:53:12,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:53:15,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:53:17,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:53:19,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:53:21,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:53:23,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:53:26,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:53:28,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:53:30,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:53:32,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:53:36,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:53:38,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:53:40,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:53:42,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:53:44,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:53:47,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:53:49,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:53:51,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:53:53,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:53:55,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:53:58,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:54:02,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:54:12,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:54:16,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:54:18,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:54:20,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:54:22,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:54:29,997 INFO L130 PetriNetUnfolder]: 19571/34745 cut-off events. [2022-12-13 02:54:29,998 INFO L131 PetriNetUnfolder]: For 29417/29417 co-relation queries the response was YES. [2022-12-13 02:54:30,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357234 conditions, 34745 events. 19571/34745 cut-off events. For 29417/29417 co-relation queries the response was YES. Maximal size of possible extension queue 1035. Compared 277059 event pairs, 301 based on Foata normal form. 0/19506 useless extension candidates. Maximal degree in co-relation 344339. Up to 32557 conditions per place. [2022-12-13 02:54:30,215 INFO L137 encePairwiseOnDemand]: 42/58 looper letters, 3088 selfloop transitions, 249 changer transitions 0/3346 dead transitions. [2022-12-13 02:54:30,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 3346 transitions, 73139 flow [2022-12-13 02:54:30,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 02:54:30,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-13 02:54:30,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 556 transitions. [2022-12-13 02:54:30,218 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3687002652519894 [2022-12-13 02:54:30,218 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 36 predicate places. [2022-12-13 02:54:30,218 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 3346 transitions, 73139 flow [2022-12-13 02:54:30,405 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 3346 transitions, 73139 flow [2022-12-13 02:54:31,582 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:54:31,582 INFO L89 Accepts]: Start accepts. Operand has 147 places, 3346 transitions, 73139 flow [2022-12-13 02:54:31,590 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:54:31,590 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:54:31,591 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 3346 transitions, 73139 flow [2022-12-13 02:54:32,457 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 3346 transitions, 73139 flow [2022-12-13 02:54:32,458 INFO L226 LiptonReduction]: Number of co-enabled transitions 11906 [2022-12-13 02:54:32,470 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:54:32,471 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 889 [2022-12-13 02:54:32,471 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 3346 transitions, 73139 flow [2022-12-13 02:54:32,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.8) internal successors, (162), 15 states have internal predecessors, (162), 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-13 02:54:32,471 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:54:32,471 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2022-12-13 02:54:32,476 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-13 02:54:32,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:54:32,676 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 02:54:32,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:54:32,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1297883625, now seen corresponding path program 2 times [2022-12-13 02:54:32,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:54:32,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168717602] [2022-12-13 02:54:32,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:54:32,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:54:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:54:32,778 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:54:32,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:54:32,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168717602] [2022-12-13 02:54:32,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168717602] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:54:32,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80870326] [2022-12-13 02:54:32,779 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 02:54:32,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:54:32,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:54:32,807 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-13 02:54:32,808 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-13 02:54:32,899 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 02:54:32,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 02:54:32,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 02:54:32,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:54:32,948 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:54:32,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:54:33,034 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:54:33,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80870326] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:54:33,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:54:33,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-12-13 02:54:33,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310653462] [2022-12-13 02:54:33,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:54:33,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 02:54:33,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:54:33,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 02:54:33,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-12-13 02:54:33,036 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 58 [2022-12-13 02:54:33,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 3346 transitions, 73139 flow. Second operand has 18 states, 18 states have (on average 12.444444444444445) internal successors, (224), 18 states have internal predecessors, (224), 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-13 02:54:33,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:54:33,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 58 [2022-12-13 02:54:33,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:54:59,232 INFO L130 PetriNetUnfolder]: 31611/55290 cut-off events. [2022-12-13 02:54:59,232 INFO L131 PetriNetUnfolder]: For 42287/42287 co-relation queries the response was YES. [2022-12-13 02:54:59,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 624875 conditions, 55290 events. 31611/55290 cut-off events. For 42287/42287 co-relation queries the response was YES. Maximal size of possible extension queue 1177. Compared 426301 event pairs, 531 based on Foata normal form. 0/30627 useless extension candidates. Maximal degree in co-relation 600362. Up to 52397 conditions per place. [2022-12-13 02:54:59,798 INFO L137 encePairwiseOnDemand]: 48/58 looper letters, 5181 selfloop transitions, 156 changer transitions 0/5346 dead transitions. [2022-12-13 02:54:59,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 5346 transitions, 127861 flow [2022-12-13 02:54:59,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 02:54:59,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 02:54:59,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 539 transitions. [2022-12-13 02:54:59,800 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5466531440162272 [2022-12-13 02:54:59,801 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 52 predicate places. [2022-12-13 02:54:59,801 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 5346 transitions, 127861 flow [2022-12-13 02:55:00,137 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 5346 transitions, 127861 flow [2022-12-13 02:55:02,692 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:55:02,692 INFO L89 Accepts]: Start accepts. Operand has 163 places, 5346 transitions, 127861 flow [2022-12-13 02:55:02,706 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:55:02,707 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:55:02,707 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 5346 transitions, 127861 flow [2022-12-13 02:55:05,909 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 163 places, 5346 transitions, 127861 flow [2022-12-13 02:55:05,909 INFO L226 LiptonReduction]: Number of co-enabled transitions 18786 [2022-12-13 02:55:05,929 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:55:05,930 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3238 [2022-12-13 02:55:05,930 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 5346 transitions, 127861 flow [2022-12-13 02:55:05,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 12.444444444444445) internal successors, (224), 18 states have internal predecessors, (224), 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-13 02:55:05,930 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:55:05,930 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:55:05,938 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-13 02:55:06,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:55:06,136 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 02:55:06,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:55:06,137 INFO L85 PathProgramCache]: Analyzing trace with hash -543986482, now seen corresponding path program 1 times [2022-12-13 02:55:06,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:55:06,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541294896] [2022-12-13 02:55:06,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:55:06,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:55:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:55:06,272 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 02:55:06,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:55:06,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541294896] [2022-12-13 02:55:06,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541294896] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:55:06,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158942442] [2022-12-13 02:55:06,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:55:06,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:55:06,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:55:06,274 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-13 02:55:06,276 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-13 02:55:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:55:06,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 02:55:06,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:55:06,420 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 02:55:06,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:55:06,502 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 02:55:06,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158942442] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:55:06,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:55:06,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-12-13 02:55:06,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939926245] [2022-12-13 02:55:06,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:55:06,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 02:55:06,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:55:06,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 02:55:06,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-12-13 02:55:06,503 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 58 [2022-12-13 02:55:06,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 5346 transitions, 127861 flow. Second operand has 16 states, 16 states have (on average 13.3125) internal successors, (213), 16 states have internal predecessors, (213), 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-13 02:55:06,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:55:06,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 58 [2022-12-13 02:55:06,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:55:50,817 INFO L130 PetriNetUnfolder]: 34564/60550 cut-off events. [2022-12-13 02:55:50,818 INFO L131 PetriNetUnfolder]: For 45133/45133 co-relation queries the response was YES. [2022-12-13 02:55:50,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 742550 conditions, 60550 events. 34564/60550 cut-off events. For 45133/45133 co-relation queries the response was YES. Maximal size of possible extension queue 1099. Compared 475357 event pairs, 601 based on Foata normal form. 0/33610 useless extension candidates. Maximal degree in co-relation 711931. Up to 57402 conditions per place. [2022-12-13 02:55:51,221 INFO L137 encePairwiseOnDemand]: 46/58 looper letters, 5746 selfloop transitions, 283 changer transitions 0/6038 dead transitions. [2022-12-13 02:55:51,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 6038 transitions, 156571 flow [2022-12-13 02:55:51,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 02:55:51,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 02:55:51,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 436 transitions. [2022-12-13 02:55:51,222 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4421906693711968 [2022-12-13 02:55:51,223 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 68 predicate places. [2022-12-13 02:55:51,223 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 6038 transitions, 156571 flow [2022-12-13 02:55:51,607 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 179 places, 6038 transitions, 156571 flow [2022-12-13 02:55:54,857 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:55:54,858 INFO L89 Accepts]: Start accepts. Operand has 179 places, 6038 transitions, 156571 flow [2022-12-13 02:55:54,875 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:55:54,875 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:55:54,875 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 6038 transitions, 156571 flow [2022-12-13 02:55:57,915 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 6038 transitions, 156571 flow [2022-12-13 02:55:57,916 INFO L226 LiptonReduction]: Number of co-enabled transitions 20962 [2022-12-13 02:55:57,934 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:55:57,935 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3078 [2022-12-13 02:55:57,935 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 6038 transitions, 156571 flow [2022-12-13 02:55:57,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 13.3125) internal successors, (213), 16 states have internal predecessors, (213), 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-13 02:55:57,935 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:55:57,935 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:55:57,940 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-13 02:55:58,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 02:55:58,141 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 02:55:58,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:55:58,141 INFO L85 PathProgramCache]: Analyzing trace with hash 144498496, now seen corresponding path program 1 times [2022-12-13 02:55:58,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:55:58,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005730850] [2022-12-13 02:55:58,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:55:58,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:55:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:55:58,210 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:55:58,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:55:58,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005730850] [2022-12-13 02:55:58,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005730850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:55:58,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:55:58,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:55:58,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302074932] [2022-12-13 02:55:58,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:55:58,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:55:58,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:55:58,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:55:58,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:55:58,212 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 58 [2022-12-13 02:55:58,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 6038 transitions, 156571 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-13 02:55:58,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:55:58,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 58 [2022-12-13 02:55:58,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:56:46,323 INFO L130 PetriNetUnfolder]: 34382/60227 cut-off events. [2022-12-13 02:56:46,323 INFO L131 PetriNetUnfolder]: For 45031/45031 co-relation queries the response was YES. [2022-12-13 02:56:46,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 796448 conditions, 60227 events. 34382/60227 cut-off events. For 45031/45031 co-relation queries the response was YES. Maximal size of possible extension queue 1001. Compared 473295 event pairs, 441 based on Foata normal form. 6/33393 useless extension candidates. Maximal degree in co-relation 763534. Up to 57106 conditions per place. [2022-12-13 02:56:46,835 INFO L137 encePairwiseOnDemand]: 49/58 looper letters, 5891 selfloop transitions, 102 changer transitions 0/6002 dead transitions. [2022-12-13 02:56:46,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 6002 transitions, 167617 flow [2022-12-13 02:56:46,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:56:46,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:56:46,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 163 transitions. [2022-12-13 02:56:46,836 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5620689655172414 [2022-12-13 02:56:46,836 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 72 predicate places. [2022-12-13 02:56:46,836 INFO L82 GeneralOperation]: Start removeDead. Operand has 183 places, 6002 transitions, 167617 flow [2022-12-13 02:56:47,229 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 183 places, 6002 transitions, 167617 flow [2022-12-13 02:56:51,009 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:56:51,009 INFO L89 Accepts]: Start accepts. Operand has 183 places, 6002 transitions, 167617 flow [2022-12-13 02:56:51,031 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:56:51,031 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:56:51,031 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 6002 transitions, 167617 flow [2022-12-13 02:56:54,481 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 183 places, 6002 transitions, 167617 flow [2022-12-13 02:56:54,503 INFO L226 LiptonReduction]: Number of co-enabled transitions 20816 [2022-12-13 02:56:54,533 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:56:54,536 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3527 [2022-12-13 02:56:54,536 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 6002 transitions, 167617 flow [2022-12-13 02:56:54,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-13 02:56:54,536 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:56:54,536 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:56:54,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 02:56:54,536 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 02:56:54,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:56:54,537 INFO L85 PathProgramCache]: Analyzing trace with hash -252447994, now seen corresponding path program 1 times [2022-12-13 02:56:54,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:56:54,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333163298] [2022-12-13 02:56:54,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:56:54,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:56:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:56:56,754 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:56:56,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:56:56,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333163298] [2022-12-13 02:56:56,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333163298] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:56:56,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734970655] [2022-12-13 02:56:56,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:56:56,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:56:56,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:56:56,757 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-13 02:56:56,758 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-13 02:56:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:56:56,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-13 02:56:57,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:56:57,396 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 22 treesize of output 17 [2022-12-13 02:56:57,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:56:57,876 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 72 treesize of output 43 [2022-12-13 02:56:58,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 46 [2022-12-13 02:57:09,296 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:57:09,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:57:11,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-12-13 02:57:11,859 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:57:11,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734970655] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:57:11,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:57:11,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18, 18] total 59 [2022-12-13 02:57:11,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23587022] [2022-12-13 02:57:11,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:57:11,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-12-13 02:57:11,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:57:11,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-12-13 02:57:11,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=3222, Unknown=2, NotChecked=0, Total=3540 [2022-12-13 02:57:11,862 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 58 [2022-12-13 02:57:11,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 6002 transitions, 167617 flow. Second operand has 60 states, 60 states have (on average 10.75) internal successors, (645), 60 states have internal predecessors, (645), 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-13 02:57:11,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:57:11,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 58 [2022-12-13 02:57:11,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:57:24,084 WARN L233 SmtUtils]: Spent 6.76s on a formula simplification. DAG size of input: 137 DAG size of output: 134 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:57:52,542 WARN L233 SmtUtils]: Spent 6.79s on a formula simplification. DAG size of input: 239 DAG size of output: 84 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:58:23,510 WARN L233 SmtUtils]: Spent 6.84s on a formula simplification. DAG size of input: 242 DAG size of output: 87 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 03:02:05,638 INFO L130 PetriNetUnfolder]: 70455/123955 cut-off events. [2022-12-13 03:02:05,639 INFO L131 PetriNetUnfolder]: For 90378/90378 co-relation queries the response was YES. [2022-12-13 03:02:05,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1756344 conditions, 123955 events. 70455/123955 cut-off events. For 90378/90378 co-relation queries the response was YES. Maximal size of possible extension queue 1865. Compared 1076680 event pairs, 281 based on Foata normal form. 0/68371 useless extension candidates. Maximal degree in co-relation 1682011. Up to 117980 conditions per place. [2022-12-13 03:02:06,653 INFO L137 encePairwiseOnDemand]: 38/58 looper letters, 10904 selfloop transitions, 953 changer transitions 100/11966 dead transitions. [2022-12-13 03:02:06,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 11966 transitions, 357840 flow [2022-12-13 03:02:06,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-12-13 03:02:06,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2022-12-13 03:02:06,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 1968 transitions. [2022-12-13 03:02:06,683 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36881559220389803 [2022-12-13 03:02:06,683 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 163 predicate places. [2022-12-13 03:02:06,684 INFO L82 GeneralOperation]: Start removeDead. Operand has 274 places, 11966 transitions, 357840 flow [2022-12-13 03:02:07,986 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 274 places, 11866 transitions, 354780 flow [2022-12-13 03:02:19,539 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:02:19,540 INFO L89 Accepts]: Start accepts. Operand has 274 places, 11866 transitions, 354780 flow [2022-12-13 03:02:19,600 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:02:19,600 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:02:19,601 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 274 places, 11866 transitions, 354780 flow Received shutdown request... [2022-12-13 03:02:20,398 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-13 03:02:20,411 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 03:02:21,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 03:02:21,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Cannot interrupt operation gracefully because timeout expired. Forcing shutdown