/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack_longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:06:01,126 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:06:01,129 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:06:01,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:06:01,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:06:01,151 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:06:01,152 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:06:01,153 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:06:01,154 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:06:01,155 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:06:01,156 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:06:01,156 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:06:01,157 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:06:01,157 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:06:01,158 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:06:01,159 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:06:01,159 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:06:01,167 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:06:01,169 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:06:01,170 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:06:01,171 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:06:01,171 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:06:01,172 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:06:01,173 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:06:01,175 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:06:01,175 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:06:01,175 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:06:01,178 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:06:01,178 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:06:01,179 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:06:01,179 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:06:01,180 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:06:01,180 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:06:01,181 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:06:01,181 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:06:01,181 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:06:01,182 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:06:01,182 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:06:01,182 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:06:01,182 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:06:01,183 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:06:01,186 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:06:01,210 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:06:01,210 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:06:01,211 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:06:01,212 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:06:01,212 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:06:01,212 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:06:01,212 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:06:01,212 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:06:01,212 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:06:01,212 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:06:01,212 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:06:01,212 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:06:01,213 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:06:01,213 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:06:01,213 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:06:01,213 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:06:01,213 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:06:01,213 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:06:01,213 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:06:01,214 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:06:01,214 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:06:01,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:06:01,215 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:06:01,217 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:06:01,218 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:06:01,218 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:06:01,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:06:01,218 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:06:01,218 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:06:01,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:06:01,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:06:01,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:06:01,505 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:06:01,507 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:06:01,508 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longest-2.i [2022-12-06 04:06:02,608 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:06:02,839 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:06:02,839 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-2.i [2022-12-06 04:06:02,863 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e11cfdf1a/228d35552ec44676a5b85680448146b8/FLAG581cd3654 [2022-12-06 04:06:02,879 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e11cfdf1a/228d35552ec44676a5b85680448146b8 [2022-12-06 04:06:02,881 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:06:02,883 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:06:02,884 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:06:02,884 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:06:02,886 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:06:02,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:06:02" (1/1) ... [2022-12-06 04:06:02,887 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53929c4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:02, skipping insertion in model container [2022-12-06 04:06:02,887 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:06:02" (1/1) ... [2022-12-06 04:06:02,892 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:06:02,932 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:06:03,177 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_longest-2.i[41530,41543] [2022-12-06 04:06:03,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:06:03,219 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:06:03,256 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_longest-2.i[41530,41543] [2022-12-06 04:06:03,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:06:03,310 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:06:03,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:03 WrapperNode [2022-12-06 04:06:03,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:06:03,312 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:06:03,312 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:06:03,313 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:06:03,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:03" (1/1) ... [2022-12-06 04:06:03,343 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:03" (1/1) ... [2022-12-06 04:06:03,368 INFO L138 Inliner]: procedures = 277, calls = 38, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 148 [2022-12-06 04:06:03,368 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:06:03,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:06:03,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:06:03,369 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:06:03,375 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:03" (1/1) ... [2022-12-06 04:06:03,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:03" (1/1) ... [2022-12-06 04:06:03,388 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:03" (1/1) ... [2022-12-06 04:06:03,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:03" (1/1) ... [2022-12-06 04:06:03,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:03" (1/1) ... [2022-12-06 04:06:03,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:03" (1/1) ... [2022-12-06 04:06:03,398 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:03" (1/1) ... [2022-12-06 04:06:03,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:03" (1/1) ... [2022-12-06 04:06:03,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:06:03,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:06:03,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:06:03,401 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:06:03,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:03" (1/1) ... [2022-12-06 04:06:03,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:06:03,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:06:03,430 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:06:03,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:06:03,464 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-06 04:06:03,464 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-06 04:06:03,465 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-06 04:06:03,465 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-06 04:06:03,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:06:03,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:06:03,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:06:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:06:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-06 04:06:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:06:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:06:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:06:03,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:06:03,467 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:06:03,611 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:06:03,613 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:06:03,824 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:06:03,831 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:06:03,831 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 04:06:03,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:06:03 BoogieIcfgContainer [2022-12-06 04:06:03,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:06:03,834 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:06:03,834 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:06:03,836 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:06:03,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:06:02" (1/3) ... [2022-12-06 04:06:03,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d5c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:06:03, skipping insertion in model container [2022-12-06 04:06:03,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:03" (2/3) ... [2022-12-06 04:06:03,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d5c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:06:03, skipping insertion in model container [2022-12-06 04:06:03,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:06:03" (3/3) ... [2022-12-06 04:06:03,837 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longest-2.i [2022-12-06 04:06:03,852 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:06:03,852 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:06:03,852 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:06:03,919 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 04:06:03,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 150 transitions, 316 flow [2022-12-06 04:06:04,017 INFO L130 PetriNetUnfolder]: 10/148 cut-off events. [2022-12-06 04:06:04,018 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 04:06:04,023 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-06 04:06:04,024 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 150 transitions, 316 flow [2022-12-06 04:06:04,030 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 139 transitions, 287 flow [2022-12-06 04:06:04,031 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:04,052 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 139 transitions, 287 flow [2022-12-06 04:06:04,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 139 transitions, 287 flow [2022-12-06 04:06:04,101 INFO L130 PetriNetUnfolder]: 10/139 cut-off events. [2022-12-06 04:06:04,102 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 04:06:04,104 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-06 04:06:04,109 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 139 transitions, 287 flow [2022-12-06 04:06:04,109 INFO L188 LiptonReduction]: Number of co-enabled transitions 6382 [2022-12-06 04:06:07,553 INFO L203 LiptonReduction]: Total number of compositions: 109 [2022-12-06 04:06:07,563 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:06:07,567 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;@391bf76a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:06:07,567 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 04:06:07,570 INFO L130 PetriNetUnfolder]: 1/18 cut-off events. [2022-12-06 04:06:07,570 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 04:06:07,570 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:07,571 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-06 04:06:07,571 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:06:07,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:07,574 INFO L85 PathProgramCache]: Analyzing trace with hash 973860878, now seen corresponding path program 1 times [2022-12-06 04:06:07,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:07,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253554625] [2022-12-06 04:06:07,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:07,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:07,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:07,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:07,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253554625] [2022-12-06 04:06:07,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253554625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:07,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:07,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:06:07,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323034993] [2022-12-06 04:06:07,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:07,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:06:07,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:07,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:06:07,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:06:07,783 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 40 [2022-12-06 04:06:07,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:07,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:07,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 40 [2022-12-06 04:06:07,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:07,924 INFO L130 PetriNetUnfolder]: 828/1410 cut-off events. [2022-12-06 04:06:07,925 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-12-06 04:06:07,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2835 conditions, 1410 events. 828/1410 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5969 event pairs, 371 based on Foata normal form. 0/1040 useless extension candidates. Maximal degree in co-relation 2635. Up to 880 conditions per place. [2022-12-06 04:06:07,933 INFO L137 encePairwiseOnDemand]: 33/40 looper letters, 55 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2022-12-06 04:06:07,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 61 transitions, 253 flow [2022-12-06 04:06:07,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:06:07,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:06:07,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-12-06 04:06:07,941 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2022-12-06 04:06:07,942 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 89 flow. Second operand 3 states and 73 transitions. [2022-12-06 04:06:07,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 61 transitions, 253 flow [2022-12-06 04:06:07,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 61 transitions, 245 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:06:07,946 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 97 flow [2022-12-06 04:06:07,947 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2022-12-06 04:06:07,949 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2022-12-06 04:06:07,949 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:07,950 INFO L89 Accepts]: Start accepts. Operand has 40 places, 39 transitions, 97 flow [2022-12-06 04:06:07,951 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:07,951 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:07,952 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 39 transitions, 97 flow [2022-12-06 04:06:07,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 39 transitions, 97 flow [2022-12-06 04:06:07,958 INFO L130 PetriNetUnfolder]: 9/67 cut-off events. [2022-12-06 04:06:07,958 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:06:07,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 67 events. 9/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 148 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 74. Up to 9 conditions per place. [2022-12-06 04:06:07,959 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 39 transitions, 97 flow [2022-12-06 04:06:07,959 INFO L188 LiptonReduction]: Number of co-enabled transitions 656 [2022-12-06 04:06:07,983 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:06:07,984 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 04:06:07,984 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 97 flow [2022-12-06 04:06:07,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:07,985 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:07,985 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:07,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:06:07,985 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:06:07,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:07,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1325177997, now seen corresponding path program 1 times [2022-12-06 04:06:07,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:07,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688800670] [2022-12-06 04:06:07,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:07,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:08,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:08,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:08,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688800670] [2022-12-06 04:06:08,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688800670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:08,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:08,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:06:08,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905525880] [2022-12-06 04:06:08,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:08,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:06:08,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:08,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:06:08,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:06:08,057 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2022-12-06 04:06:08,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:08,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:08,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2022-12-06 04:06:08,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:08,215 INFO L130 PetriNetUnfolder]: 686/1260 cut-off events. [2022-12-06 04:06:08,215 INFO L131 PetriNetUnfolder]: For 111/111 co-relation queries the response was YES. [2022-12-06 04:06:08,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2547 conditions, 1260 events. 686/1260 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 6454 event pairs, 313 based on Foata normal form. 0/1024 useless extension candidates. Maximal degree in co-relation 2130. Up to 1025 conditions per place. [2022-12-06 04:06:08,220 INFO L137 encePairwiseOnDemand]: 35/38 looper letters, 48 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2022-12-06 04:06:08,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 57 transitions, 242 flow [2022-12-06 04:06:08,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:06:08,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:06:08,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-12-06 04:06:08,223 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6052631578947368 [2022-12-06 04:06:08,223 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 97 flow. Second operand 3 states and 69 transitions. [2022-12-06 04:06:08,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 57 transitions, 242 flow [2022-12-06 04:06:08,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 57 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:06:08,226 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 109 flow [2022-12-06 04:06:08,226 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=42, PETRI_TRANSITIONS=40} [2022-12-06 04:06:08,227 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2022-12-06 04:06:08,227 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:08,227 INFO L89 Accepts]: Start accepts. Operand has 42 places, 40 transitions, 109 flow [2022-12-06 04:06:08,227 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:08,228 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:08,228 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 40 transitions, 109 flow [2022-12-06 04:06:08,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 40 transitions, 109 flow [2022-12-06 04:06:08,236 INFO L130 PetriNetUnfolder]: 12/93 cut-off events. [2022-12-06 04:06:08,236 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 04:06:08,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 93 events. 12/93 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 262 event pairs, 1 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 109. Up to 11 conditions per place. [2022-12-06 04:06:08,237 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 40 transitions, 109 flow [2022-12-06 04:06:08,237 INFO L188 LiptonReduction]: Number of co-enabled transitions 696 [2022-12-06 04:06:08,245 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:06:08,247 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 04:06:08,247 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 109 flow [2022-12-06 04:06:08,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:08,247 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:08,247 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:08,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:06:08,248 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:06:08,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:08,248 INFO L85 PathProgramCache]: Analyzing trace with hash 963601012, now seen corresponding path program 1 times [2022-12-06 04:06:08,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:08,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840643535] [2022-12-06 04:06:08,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:08,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:08,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:08,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:08,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840643535] [2022-12-06 04:06:08,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840643535] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:06:08,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531293749] [2022-12-06 04:06:08,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:08,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:06:08,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:06:08,359 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:06:08,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 04:06:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:08,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 04:06:08,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:06:08,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:08,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:06:08,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:08,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531293749] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:06:08,543 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:06:08,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-06 04:06:08,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615372589] [2022-12-06 04:06:08,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:06:08,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 04:06:08,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:08,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 04:06:08,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-06 04:06:08,545 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 38 [2022-12-06 04:06:08,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 109 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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-06 04:06:08,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:08,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 38 [2022-12-06 04:06:08,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:09,046 INFO L130 PetriNetUnfolder]: 2004/3438 cut-off events. [2022-12-06 04:06:09,046 INFO L131 PetriNetUnfolder]: For 880/880 co-relation queries the response was YES. [2022-12-06 04:06:09,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7606 conditions, 3438 events. 2004/3438 cut-off events. For 880/880 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 17981 event pairs, 302 based on Foata normal form. 88/2886 useless extension candidates. Maximal degree in co-relation 6886. Up to 999 conditions per place. [2022-12-06 04:06:09,060 INFO L137 encePairwiseOnDemand]: 30/38 looper letters, 166 selfloop transitions, 26 changer transitions 5/200 dead transitions. [2022-12-06 04:06:09,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 200 transitions, 913 flow [2022-12-06 04:06:09,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 04:06:09,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 04:06:09,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 236 transitions. [2022-12-06 04:06:09,062 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5175438596491229 [2022-12-06 04:06:09,062 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 109 flow. Second operand 12 states and 236 transitions. [2022-12-06 04:06:09,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 200 transitions, 913 flow [2022-12-06 04:06:09,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 200 transitions, 898 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:06:09,067 INFO L231 Difference]: Finished difference. Result has 60 places, 65 transitions, 321 flow [2022-12-06 04:06:09,067 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=321, PETRI_PLACES=60, PETRI_TRANSITIONS=65} [2022-12-06 04:06:09,068 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2022-12-06 04:06:09,068 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:09,068 INFO L89 Accepts]: Start accepts. Operand has 60 places, 65 transitions, 321 flow [2022-12-06 04:06:09,069 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:09,069 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:09,069 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 65 transitions, 321 flow [2022-12-06 04:06:09,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 65 transitions, 321 flow [2022-12-06 04:06:09,082 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L1008-->L1008-1: Formula: (not (< 0 v_~top~0_13)) InVars {~top~0=v_~top~0_13} OutVars{~top~0=v_~top~0_13} AuxVars[] AssignedVars[][22], [Black: 160#(= ~top~0 0), Black: 253#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 225#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 114#L996-2true, Black: 170#(<= ~top~0 1), Black: 251#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 255#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), Black: 166#true, 164#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), Black: 215#(not (<= 800 ~top~0)), 174#(<= ~top~0 0), t2Thread1of1ForFork0InUse, 135#L1008-1true, 23#L1022-4true]) [2022-12-06 04:06:09,082 INFO L382 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-12-06 04:06:09,082 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-06 04:06:09,082 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 04:06:09,082 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-06 04:06:09,083 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([578] L1008-->L973: Formula: (and (< 0 v_~top~0_114) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_17| |v_~#arr~0.base_35|) (= |v_~#arr~0.offset_30| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_17|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_30|, ~top~0=v_~top~0_114, ~#arr~0.base=|v_~#arr~0.base_35|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_39|, ~#arr~0.offset=|v_~#arr~0.offset_30|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_35|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_15|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_17|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_45|, ~top~0=v_~top~0_114, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_57|, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_39|, ~#arr~0.base=|v_~#arr~0.base_35|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_17|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base][36], [Black: 160#(= ~top~0 0), Black: 253#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 225#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 114#L996-2true, Black: 170#(<= ~top~0 1), Black: 251#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 255#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), Black: 166#true, 164#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), Black: 174#(<= ~top~0 0), 215#(not (<= 800 ~top~0)), 38#L973true, t2Thread1of1ForFork0InUse, 23#L1022-4true]) [2022-12-06 04:06:09,083 INFO L382 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-12-06 04:06:09,083 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-06 04:06:09,083 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 04:06:09,083 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-06 04:06:09,086 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L1008-->L1008-1: Formula: (not (< 0 v_~top~0_13)) InVars {~top~0=v_~top~0_13} OutVars{~top~0=v_~top~0_13} AuxVars[] AssignedVars[][22], [Black: 160#(= ~top~0 0), Black: 253#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 225#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), Black: 170#(<= ~top~0 1), Black: 251#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 164#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), Black: 255#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), Black: 166#true, Black: 215#(not (<= 800 ~top~0)), 174#(<= ~top~0 0), t2Thread1of1ForFork0InUse, 123#L945-1true, 135#L1008-1true, 23#L1022-4true]) [2022-12-06 04:06:09,086 INFO L382 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-06 04:06:09,086 INFO L385 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-06 04:06:09,086 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-06 04:06:09,086 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-06 04:06:09,087 INFO L130 PetriNetUnfolder]: 72/329 cut-off events. [2022-12-06 04:06:09,088 INFO L131 PetriNetUnfolder]: For 320/331 co-relation queries the response was YES. [2022-12-06 04:06:09,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 684 conditions, 329 events. 72/329 cut-off events. For 320/331 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1785 event pairs, 2 based on Foata normal form. 1/232 useless extension candidates. Maximal degree in co-relation 663. Up to 47 conditions per place. [2022-12-06 04:06:09,091 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 65 transitions, 321 flow [2022-12-06 04:06:09,091 INFO L188 LiptonReduction]: Number of co-enabled transitions 1108 [2022-12-06 04:06:09,109 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [394] L945-->L945-1: Formula: (= |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3| v_~top~0_5) InVars {~top~0=v_~top~0_5} OutVars{~top~0=v_~top~0_5, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_inc_top_#t~post31#1] and [412] L1008-->L1008-1: Formula: (not (< 0 v_~top~0_13)) InVars {~top~0=v_~top~0_13} OutVars{~top~0=v_~top~0_13} AuxVars[] AssignedVars[] [2022-12-06 04:06:09,117 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [394] L945-->L945-1: Formula: (= |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3| v_~top~0_5) InVars {~top~0=v_~top~0_5} OutVars{~top~0=v_~top~0_5, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_inc_top_#t~post31#1] and [463] L949-1-->L947: Formula: (= (+ v_~top~0_17 1) |v_t2Thread1of1ForFork0_dec_top_#t~post32#1_14|) InVars {t2Thread1of1ForFork0_dec_top_#t~post32#1=|v_t2Thread1of1ForFork0_dec_top_#t~post32#1_14|} OutVars{~top~0=v_~top~0_17} AuxVars[] AssignedVars[t2Thread1of1ForFork0_dec_top_#t~post32#1, ~top~0] [2022-12-06 04:06:09,125 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [394] L945-->L945-1: Formula: (= |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3| v_~top~0_5) InVars {~top~0=v_~top~0_5} OutVars{~top~0=v_~top~0_5, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_inc_top_#t~post31#1] and [567] L973-->pop_returnLabel#1: Formula: (and (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_37| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_15|) (= (+ 2 |v_t2Thread1of1ForFork0_pop_#res#1_31|) 0) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_15| |v_t2Thread1of1ForFork0_pop_~stack#1.base_37|) (= v_~top~0_107 0)) InVars {t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_15|, ~top~0=v_~top~0_107, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_15|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_37|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_13|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_15|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_31|, ~top~0=v_~top~0_107, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_37|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_15|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_~stack#1.offset] [2022-12-06 04:06:09,171 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [567] L973-->pop_returnLabel#1: Formula: (and (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_37| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_15|) (= (+ 2 |v_t2Thread1of1ForFork0_pop_#res#1_31|) 0) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_15| |v_t2Thread1of1ForFork0_pop_~stack#1.base_37|) (= v_~top~0_107 0)) InVars {t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_15|, ~top~0=v_~top~0_107, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_15|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_37|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_13|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_15|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_31|, ~top~0=v_~top~0_107, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_37|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_15|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_~stack#1.offset] and [587] L945-1-->L996-2: Formula: (and (= |v_t1Thread1of1ForFork1_push_#res#1_51| 0) (= |v_t1Thread1of1ForFork1_#t~ret41#1_69| |v_t1Thread1of1ForFork1_push_#res#1_51|) (= (+ 1 |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_94|) v_~top~0_130)) InVars {t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_94|} OutVars{t1Thread1of1ForFork1_#t~ret41#1=|v_t1Thread1of1ForFork1_#t~ret41#1_69|, ~top~0=v_~top~0_130, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_51|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_#t~ret41#1, ~top~0, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_inc_top_#t~post31#1] [2022-12-06 04:06:09,213 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] L1008-->L1008-1: Formula: (not (< 0 v_~top~0_13)) InVars {~top~0=v_~top~0_13} OutVars{~top~0=v_~top~0_13} AuxVars[] AssignedVars[] and [587] L945-1-->L996-2: Formula: (and (= |v_t1Thread1of1ForFork1_push_#res#1_51| 0) (= |v_t1Thread1of1ForFork1_#t~ret41#1_69| |v_t1Thread1of1ForFork1_push_#res#1_51|) (= (+ 1 |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_94|) v_~top~0_130)) InVars {t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_94|} OutVars{t1Thread1of1ForFork1_#t~ret41#1=|v_t1Thread1of1ForFork1_#t~ret41#1_69|, ~top~0=v_~top~0_130, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_51|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_#t~ret41#1, ~top~0, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_inc_top_#t~post31#1] [2022-12-06 04:06:09,233 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 04:06:09,234 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 04:06:09,234 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 63 transitions, 344 flow [2022-12-06 04:06:09,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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-06 04:06:09,235 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:09,235 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:09,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 04:06:09,445 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-06 04:06:09,446 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:06:09,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:09,448 INFO L85 PathProgramCache]: Analyzing trace with hash 657019038, now seen corresponding path program 1 times [2022-12-06 04:06:09,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:09,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492109683] [2022-12-06 04:06:09,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:09,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:09,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:09,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:09,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492109683] [2022-12-06 04:06:09,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492109683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:09,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:09,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:06:09,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137061361] [2022-12-06 04:06:09,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:09,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 04:06:09,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:09,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 04:06:09,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 04:06:09,468 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 46 [2022-12-06 04:06:09,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 63 transitions, 344 flow. Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:09,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:09,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 46 [2022-12-06 04:06:09,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:09,663 INFO L130 PetriNetUnfolder]: 1584/2898 cut-off events. [2022-12-06 04:06:09,663 INFO L131 PetriNetUnfolder]: For 2985/3014 co-relation queries the response was YES. [2022-12-06 04:06:09,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7286 conditions, 2898 events. 1584/2898 cut-off events. For 2985/3014 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 16667 event pairs, 1140 based on Foata normal form. 29/2425 useless extension candidates. Maximal degree in co-relation 6603. Up to 2596 conditions per place. [2022-12-06 04:06:09,678 INFO L137 encePairwiseOnDemand]: 45/46 looper letters, 51 selfloop transitions, 0 changer transitions 0/62 dead transitions. [2022-12-06 04:06:09,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 62 transitions, 433 flow [2022-12-06 04:06:09,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 04:06:09,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 04:06:09,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2022-12-06 04:06:09,680 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2022-12-06 04:06:09,680 INFO L175 Difference]: Start difference. First operand has 58 places, 63 transitions, 344 flow. Second operand 2 states and 52 transitions. [2022-12-06 04:06:09,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 62 transitions, 433 flow [2022-12-06 04:06:09,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 62 transitions, 406 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 04:06:09,693 INFO L231 Difference]: Finished difference. Result has 56 places, 62 transitions, 304 flow [2022-12-06 04:06:09,694 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=304, PETRI_PLACES=56, PETRI_TRANSITIONS=62} [2022-12-06 04:06:09,695 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2022-12-06 04:06:09,695 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:09,695 INFO L89 Accepts]: Start accepts. Operand has 56 places, 62 transitions, 304 flow [2022-12-06 04:06:09,696 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:09,697 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:09,697 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 62 transitions, 304 flow [2022-12-06 04:06:09,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 62 transitions, 304 flow [2022-12-06 04:06:09,713 INFO L130 PetriNetUnfolder]: 63/316 cut-off events. [2022-12-06 04:06:09,713 INFO L131 PetriNetUnfolder]: For 246/259 co-relation queries the response was YES. [2022-12-06 04:06:09,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 316 events. 63/316 cut-off events. For 246/259 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1727 event pairs, 2 based on Foata normal form. 1/219 useless extension candidates. Maximal degree in co-relation 599. Up to 43 conditions per place. [2022-12-06 04:06:09,717 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 62 transitions, 304 flow [2022-12-06 04:06:09,717 INFO L188 LiptonReduction]: Number of co-enabled transitions 1044 [2022-12-06 04:06:09,725 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L1008-->L973: Formula: (and (< 0 v_~top~0_114) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_17| |v_~#arr~0.base_35|) (= |v_~#arr~0.offset_30| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_17|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_30|, ~top~0=v_~top~0_114, ~#arr~0.base=|v_~#arr~0.base_35|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_39|, ~#arr~0.offset=|v_~#arr~0.offset_30|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_35|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_15|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_17|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_45|, ~top~0=v_~top~0_114, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_57|, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_39|, ~#arr~0.base=|v_~#arr~0.base_35|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_17|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base] and [597] L945-->pop_returnLabel#1: Formula: (and (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_39| |v_t2Thread1of1ForFork0_pop_~stack#1.base_63|) (= (+ 2 |v_t2Thread1of1ForFork0_pop_#res#1_72|) 0) (= v_~top~0_252 0) (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_63| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_39|) (= v_~top~0_252 |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_225|)) InVars {t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_39|, ~top~0=v_~top~0_252, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_39|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_63|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_29|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_39|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_72|, ~top~0=v_~top~0_252, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_63|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_39|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_225|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t1Thread1of1ForFork1_inc_top_#t~post31#1] [2022-12-06 04:06:09,733 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:06:09,735 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-06 04:06:09,735 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 62 transitions, 308 flow [2022-12-06 04:06:09,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:09,735 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:09,735 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:09,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:06:09,736 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:06:09,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:09,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1498366853, now seen corresponding path program 1 times [2022-12-06 04:06:09,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:09,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9839] [2022-12-06 04:06:09,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:09,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:09,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:09,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:09,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9839] [2022-12-06 04:06:09,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9839] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:09,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:09,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:06:09,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974083287] [2022-12-06 04:06:09,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:09,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:06:09,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:09,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:06:09,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:06:09,848 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 45 [2022-12-06 04:06:09,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 62 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:09,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:09,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 45 [2022-12-06 04:06:09,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:09,946 INFO L130 PetriNetUnfolder]: 552/1117 cut-off events. [2022-12-06 04:06:09,946 INFO L131 PetriNetUnfolder]: For 400/400 co-relation queries the response was YES. [2022-12-06 04:06:09,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2609 conditions, 1117 events. 552/1117 cut-off events. For 400/400 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5487 event pairs, 98 based on Foata normal form. 0/987 useless extension candidates. Maximal degree in co-relation 2513. Up to 752 conditions per place. [2022-12-06 04:06:09,969 INFO L137 encePairwiseOnDemand]: 39/45 looper letters, 40 selfloop transitions, 6 changer transitions 3/60 dead transitions. [2022-12-06 04:06:09,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 60 transitions, 327 flow [2022-12-06 04:06:09,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:06:09,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:06:09,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-06 04:06:09,970 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4740740740740741 [2022-12-06 04:06:09,970 INFO L175 Difference]: Start difference. First operand has 55 places, 62 transitions, 308 flow. Second operand 3 states and 64 transitions. [2022-12-06 04:06:09,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 60 transitions, 327 flow [2022-12-06 04:06:09,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 60 transitions, 323 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 04:06:09,973 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 210 flow [2022-12-06 04:06:09,973 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2022-12-06 04:06:09,975 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2022-12-06 04:06:09,975 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:09,975 INFO L89 Accepts]: Start accepts. Operand has 52 places, 48 transitions, 210 flow [2022-12-06 04:06:09,976 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:09,976 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:09,976 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 48 transitions, 210 flow [2022-12-06 04:06:09,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 48 transitions, 210 flow [2022-12-06 04:06:09,992 INFO L130 PetriNetUnfolder]: 17/142 cut-off events. [2022-12-06 04:06:09,992 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-12-06 04:06:09,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 142 events. 17/142 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 492 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 254. Up to 18 conditions per place. [2022-12-06 04:06:09,993 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 48 transitions, 210 flow [2022-12-06 04:06:09,993 INFO L188 LiptonReduction]: Number of co-enabled transitions 436 [2022-12-06 04:06:11,333 INFO L203 LiptonReduction]: Total number of compositions: 12 [2022-12-06 04:06:11,334 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1359 [2022-12-06 04:06:11,334 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 42 transitions, 238 flow [2022-12-06 04:06:11,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:11,334 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:11,334 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:11,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:06:11,335 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:06:11,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:11,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1348600435, now seen corresponding path program 1 times [2022-12-06 04:06:11,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:11,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210172669] [2022-12-06 04:06:11,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:11,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:11,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:11,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:11,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210172669] [2022-12-06 04:06:11,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210172669] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:11,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:11,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:06:11,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506663655] [2022-12-06 04:06:11,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:11,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:06:11,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:11,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:06:11,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:06:11,781 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 40 [2022-12-06 04:06:11,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 238 flow. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:11,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:11,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 40 [2022-12-06 04:06:11,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:12,054 INFO L130 PetriNetUnfolder]: 840/1600 cut-off events. [2022-12-06 04:06:12,054 INFO L131 PetriNetUnfolder]: For 1704/1704 co-relation queries the response was YES. [2022-12-06 04:06:12,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4607 conditions, 1600 events. 840/1600 cut-off events. For 1704/1704 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8686 event pairs, 320 based on Foata normal form. 12/1515 useless extension candidates. Maximal degree in co-relation 3094. Up to 694 conditions per place. [2022-12-06 04:06:12,061 INFO L137 encePairwiseOnDemand]: 31/40 looper letters, 94 selfloop transitions, 11 changer transitions 9/118 dead transitions. [2022-12-06 04:06:12,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 118 transitions, 858 flow [2022-12-06 04:06:12,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:06:12,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:06:12,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2022-12-06 04:06:12,062 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5541666666666667 [2022-12-06 04:06:12,063 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 238 flow. Second operand 6 states and 133 transitions. [2022-12-06 04:06:12,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 118 transitions, 858 flow [2022-12-06 04:06:12,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 118 transitions, 794 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 04:06:12,067 INFO L231 Difference]: Finished difference. Result has 50 places, 51 transitions, 326 flow [2022-12-06 04:06:12,067 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=326, PETRI_PLACES=50, PETRI_TRANSITIONS=51} [2022-12-06 04:06:12,067 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2022-12-06 04:06:12,068 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:12,068 INFO L89 Accepts]: Start accepts. Operand has 50 places, 51 transitions, 326 flow [2022-12-06 04:06:12,068 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:12,068 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:12,068 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 51 transitions, 326 flow [2022-12-06 04:06:12,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 51 transitions, 326 flow [2022-12-06 04:06:12,083 INFO L130 PetriNetUnfolder]: 48/235 cut-off events. [2022-12-06 04:06:12,083 INFO L131 PetriNetUnfolder]: For 309/310 co-relation queries the response was YES. [2022-12-06 04:06:12,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 561 conditions, 235 events. 48/235 cut-off events. For 309/310 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1236 event pairs, 0 based on Foata normal form. 1/209 useless extension candidates. Maximal degree in co-relation 395. Up to 42 conditions per place. [2022-12-06 04:06:12,085 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 51 transitions, 326 flow [2022-12-06 04:06:12,085 INFO L188 LiptonReduction]: Number of co-enabled transitions 450 [2022-12-06 04:06:12,368 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 04:06:12,368 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 300 [2022-12-06 04:06:12,368 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 46 transitions, 324 flow [2022-12-06 04:06:12,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:12,369 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:12,369 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:12,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:06:12,369 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:06:12,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:12,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1603038933, now seen corresponding path program 1 times [2022-12-06 04:06:12,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:12,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500143407] [2022-12-06 04:06:12,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:12,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:12,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:12,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:12,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500143407] [2022-12-06 04:06:12,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500143407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:12,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:12,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:06:12,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112973866] [2022-12-06 04:06:12,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:12,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:06:12,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:12,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:06:12,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:06:12,631 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2022-12-06 04:06:12,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 46 transitions, 324 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:12,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:12,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2022-12-06 04:06:12,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:12,911 INFO L130 PetriNetUnfolder]: 867/1668 cut-off events. [2022-12-06 04:06:12,912 INFO L131 PetriNetUnfolder]: For 2550/2550 co-relation queries the response was YES. [2022-12-06 04:06:12,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4717 conditions, 1668 events. 867/1668 cut-off events. For 2550/2550 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 9405 event pairs, 219 based on Foata normal form. 30/1698 useless extension candidates. Maximal degree in co-relation 3560. Up to 496 conditions per place. [2022-12-06 04:06:12,918 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 72 selfloop transitions, 14 changer transitions 11/100 dead transitions. [2022-12-06 04:06:12,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 100 transitions, 771 flow [2022-12-06 04:06:12,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:06:12,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:06:12,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2022-12-06 04:06:12,920 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.527027027027027 [2022-12-06 04:06:12,920 INFO L175 Difference]: Start difference. First operand has 44 places, 46 transitions, 324 flow. Second operand 6 states and 117 transitions. [2022-12-06 04:06:12,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 100 transitions, 771 flow [2022-12-06 04:06:12,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 100 transitions, 711 flow, removed 30 selfloop flow, removed 1 redundant places. [2022-12-06 04:06:12,924 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 346 flow [2022-12-06 04:06:12,924 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=346, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2022-12-06 04:06:12,925 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2022-12-06 04:06:12,925 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:12,925 INFO L89 Accepts]: Start accepts. Operand has 51 places, 48 transitions, 346 flow [2022-12-06 04:06:12,926 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:12,926 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:12,926 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 48 transitions, 346 flow [2022-12-06 04:06:12,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 48 transitions, 346 flow [2022-12-06 04:06:12,946 INFO L130 PetriNetUnfolder]: 39/224 cut-off events. [2022-12-06 04:06:12,946 INFO L131 PetriNetUnfolder]: For 326/330 co-relation queries the response was YES. [2022-12-06 04:06:12,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 224 events. 39/224 cut-off events. For 326/330 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1262 event pairs, 1 based on Foata normal form. 2/200 useless extension candidates. Maximal degree in co-relation 385. Up to 40 conditions per place. [2022-12-06 04:06:12,947 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 48 transitions, 346 flow [2022-12-06 04:06:12,947 INFO L188 LiptonReduction]: Number of co-enabled transitions 406 [2022-12-06 04:06:13,057 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:06:13,058 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-06 04:06:13,058 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 344 flow [2022-12-06 04:06:13,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:13,059 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:13,059 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:13,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:06:13,059 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:06:13,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:13,059 INFO L85 PathProgramCache]: Analyzing trace with hash 477676419, now seen corresponding path program 1 times [2022-12-06 04:06:13,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:13,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373896628] [2022-12-06 04:06:13,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:13,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:13,130 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:13,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:13,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373896628] [2022-12-06 04:06:13,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373896628] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:06:13,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135302351] [2022-12-06 04:06:13,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:13,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:06:13,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:06:13,135 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:06:13,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 04:06:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:13,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 04:06:13,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:06:13,307 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:13,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:06:13,350 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:13,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135302351] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:06:13,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:06:13,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-06 04:06:13,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790122939] [2022-12-06 04:06:13,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:06:13,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 04:06:13,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:13,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 04:06:13,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2022-12-06 04:06:13,353 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-06 04:06:13,353 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 344 flow. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:13,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:13,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-06 04:06:13,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:13,804 INFO L130 PetriNetUnfolder]: 1348/2588 cut-off events. [2022-12-06 04:06:13,805 INFO L131 PetriNetUnfolder]: For 4417/4417 co-relation queries the response was YES. [2022-12-06 04:06:13,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7606 conditions, 2588 events. 1348/2588 cut-off events. For 4417/4417 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 15550 event pairs, 319 based on Foata normal form. 82/2670 useless extension candidates. Maximal degree in co-relation 5772. Up to 453 conditions per place. [2022-12-06 04:06:13,816 INFO L137 encePairwiseOnDemand]: 17/32 looper letters, 146 selfloop transitions, 50 changer transitions 4/202 dead transitions. [2022-12-06 04:06:13,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 202 transitions, 1443 flow [2022-12-06 04:06:13,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 04:06:13,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 04:06:13,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 218 transitions. [2022-12-06 04:06:13,818 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3784722222222222 [2022-12-06 04:06:13,818 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 344 flow. Second operand 18 states and 218 transitions. [2022-12-06 04:06:13,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 202 transitions, 1443 flow [2022-12-06 04:06:13,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 202 transitions, 1407 flow, removed 16 selfloop flow, removed 2 redundant places. [2022-12-06 04:06:13,827 INFO L231 Difference]: Finished difference. Result has 73 places, 83 transitions, 806 flow [2022-12-06 04:06:13,827 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=806, PETRI_PLACES=73, PETRI_TRANSITIONS=83} [2022-12-06 04:06:13,827 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places. [2022-12-06 04:06:13,827 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:13,827 INFO L89 Accepts]: Start accepts. Operand has 73 places, 83 transitions, 806 flow [2022-12-06 04:06:13,828 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:13,828 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:13,828 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 83 transitions, 806 flow [2022-12-06 04:06:13,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 83 transitions, 806 flow [2022-12-06 04:06:13,852 INFO L130 PetriNetUnfolder]: 65/347 cut-off events. [2022-12-06 04:06:13,853 INFO L131 PetriNetUnfolder]: For 885/889 co-relation queries the response was YES. [2022-12-06 04:06:13,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1067 conditions, 347 events. 65/347 cut-off events. For 885/889 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2147 event pairs, 1 based on Foata normal form. 2/308 useless extension candidates. Maximal degree in co-relation 954. Up to 78 conditions per place. [2022-12-06 04:06:13,856 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 83 transitions, 806 flow [2022-12-06 04:06:13,856 INFO L188 LiptonReduction]: Number of co-enabled transitions 708 [2022-12-06 04:06:14,220 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 04:06:14,221 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 394 [2022-12-06 04:06:14,221 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 77 transitions, 776 flow [2022-12-06 04:06:14,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:14,221 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:14,221 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:14,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 04:06:14,422 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-06 04:06:14,422 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:06:14,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:14,422 INFO L85 PathProgramCache]: Analyzing trace with hash 681524893, now seen corresponding path program 1 times [2022-12-06 04:06:14,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:14,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743603996] [2022-12-06 04:06:14,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:14,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:14,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:06:14,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:14,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743603996] [2022-12-06 04:06:14,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743603996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:14,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:14,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:06:14,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046705099] [2022-12-06 04:06:14,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:14,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:06:14,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:14,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:06:14,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:06:14,700 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 44 [2022-12-06 04:06:14,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 77 transitions, 776 flow. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:14,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:14,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 44 [2022-12-06 04:06:14,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:15,300 INFO L130 PetriNetUnfolder]: 2108/4028 cut-off events. [2022-12-06 04:06:15,300 INFO L131 PetriNetUnfolder]: For 10031/10031 co-relation queries the response was YES. [2022-12-06 04:06:15,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13332 conditions, 4028 events. 2108/4028 cut-off events. For 10031/10031 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 27243 event pairs, 713 based on Foata normal form. 24/4052 useless extension candidates. Maximal degree in co-relation 12673. Up to 1357 conditions per place. [2022-12-06 04:06:15,327 INFO L137 encePairwiseOnDemand]: 25/44 looper letters, 113 selfloop transitions, 76 changer transitions 1/192 dead transitions. [2022-12-06 04:06:15,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 192 transitions, 2024 flow [2022-12-06 04:06:15,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 04:06:15,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 04:06:15,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions. [2022-12-06 04:06:15,329 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37272727272727274 [2022-12-06 04:06:15,329 INFO L175 Difference]: Start difference. First operand has 67 places, 77 transitions, 776 flow. Second operand 10 states and 164 transitions. [2022-12-06 04:06:15,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 192 transitions, 2024 flow [2022-12-06 04:06:15,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 192 transitions, 1844 flow, removed 90 selfloop flow, removed 0 redundant places. [2022-12-06 04:06:15,361 INFO L231 Difference]: Finished difference. Result has 80 places, 128 transitions, 1413 flow [2022-12-06 04:06:15,362 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1413, PETRI_PLACES=80, PETRI_TRANSITIONS=128} [2022-12-06 04:06:15,362 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 38 predicate places. [2022-12-06 04:06:15,362 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:15,362 INFO L89 Accepts]: Start accepts. Operand has 80 places, 128 transitions, 1413 flow [2022-12-06 04:06:15,364 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:15,364 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:15,364 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 128 transitions, 1413 flow [2022-12-06 04:06:15,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 128 transitions, 1413 flow [2022-12-06 04:06:15,407 INFO L130 PetriNetUnfolder]: 116/595 cut-off events. [2022-12-06 04:06:15,407 INFO L131 PetriNetUnfolder]: For 1599/1607 co-relation queries the response was YES. [2022-12-06 04:06:15,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1966 conditions, 595 events. 116/595 cut-off events. For 1599/1607 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4513 event pairs, 0 based on Foata normal form. 2/524 useless extension candidates. Maximal degree in co-relation 1830. Up to 142 conditions per place. [2022-12-06 04:06:15,412 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 128 transitions, 1413 flow [2022-12-06 04:06:15,412 INFO L188 LiptonReduction]: Number of co-enabled transitions 1028 [2022-12-06 04:06:15,413 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:06:15,413 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-06 04:06:15,414 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 128 transitions, 1413 flow [2022-12-06 04:06:15,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:15,414 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:15,414 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:15,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:06:15,414 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:06:15,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:15,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1781957431, now seen corresponding path program 2 times [2022-12-06 04:06:15,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:15,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704530290] [2022-12-06 04:06:15,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:15,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:16,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:16,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:16,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704530290] [2022-12-06 04:06:16,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704530290] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:06:16,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951930796] [2022-12-06 04:06:16,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 04:06:16,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:06:16,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:06:16,259 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:06:16,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 04:06:16,343 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-06 04:06:16,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 04:06:16,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 04:06:16,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:06:16,379 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-06 04:06:16,379 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-06 04:06:16,438 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 17 treesize of output 13 [2022-12-06 04:06:16,484 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 59 treesize of output 54 [2022-12-06 04:06:16,567 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-06 04:06:20,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:06:20,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:06:20,291 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:06:20,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-06 04:06:20,297 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 81 treesize of output 57 [2022-12-06 04:06:20,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-12-06 04:06:20,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:06:20,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951930796] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:06:20,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:06:20,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 17 [2022-12-06 04:06:20,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588123130] [2022-12-06 04:06:20,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:06:20,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 04:06:20,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:20,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 04:06:20,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=259, Unknown=4, NotChecked=0, Total=342 [2022-12-06 04:06:20,352 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 44 [2022-12-06 04:06:20,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 128 transitions, 1413 flow. Second operand has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:20,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:20,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 44 [2022-12-06 04:06:20,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:23,235 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-06 04:06:25,650 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-06 04:06:27,690 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-06 04:06:34,361 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-06 04:06:36,385 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-06 04:06:38,565 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-06 04:06:40,654 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-06 04:06:43,209 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-06 04:06:45,295 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-06 04:06:47,906 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-06 04:06:52,203 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-06 04:06:54,400 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-06 04:06:57,777 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-06 04:06:59,802 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-06 04:07:01,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:07:03,924 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-06 04:07:06,637 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-06 04:07:08,708 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-06 04:07:11,585 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-06 04:07:14,329 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-06 04:07:16,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:07:18,498 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-06 04:07:20,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:07:22,034 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-06 04:07:24,170 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-06 04:07:28,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:07:30,522 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-06 04:07:31,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:07:32,208 INFO L130 PetriNetUnfolder]: 2940/5613 cut-off events. [2022-12-06 04:07:32,208 INFO L131 PetriNetUnfolder]: For 15274/15274 co-relation queries the response was YES. [2022-12-06 04:07:32,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19341 conditions, 5613 events. 2940/5613 cut-off events. For 15274/15274 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 40610 event pairs, 521 based on Foata normal form. 18/5631 useless extension candidates. Maximal degree in co-relation 18582. Up to 984 conditions per place. [2022-12-06 04:07:32,240 INFO L137 encePairwiseOnDemand]: 22/44 looper letters, 167 selfloop transitions, 145 changer transitions 6/320 dead transitions. [2022-12-06 04:07:32,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 320 transitions, 3328 flow [2022-12-06 04:07:32,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 04:07:32,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 04:07:32,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 284 transitions. [2022-12-06 04:07:32,243 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29338842975206614 [2022-12-06 04:07:32,243 INFO L175 Difference]: Start difference. First operand has 80 places, 128 transitions, 1413 flow. Second operand 22 states and 284 transitions. [2022-12-06 04:07:32,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 320 transitions, 3328 flow [2022-12-06 04:07:32,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 320 transitions, 3299 flow, removed 14 selfloop flow, removed 1 redundant places. [2022-12-06 04:07:32,340 INFO L231 Difference]: Finished difference. Result has 104 places, 186 transitions, 2433 flow [2022-12-06 04:07:32,340 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1392, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2433, PETRI_PLACES=104, PETRI_TRANSITIONS=186} [2022-12-06 04:07:32,340 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 62 predicate places. [2022-12-06 04:07:32,340 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:07:32,340 INFO L89 Accepts]: Start accepts. Operand has 104 places, 186 transitions, 2433 flow [2022-12-06 04:07:32,341 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:07:32,342 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:07:32,342 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 186 transitions, 2433 flow [2022-12-06 04:07:32,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 186 transitions, 2433 flow [2022-12-06 04:07:32,441 INFO L130 PetriNetUnfolder]: 309/1307 cut-off events. [2022-12-06 04:07:32,441 INFO L131 PetriNetUnfolder]: For 4936/5014 co-relation queries the response was YES. [2022-12-06 04:07:32,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5051 conditions, 1307 events. 309/1307 cut-off events. For 4936/5014 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 11607 event pairs, 17 based on Foata normal form. 19/1147 useless extension candidates. Maximal degree in co-relation 4737. Up to 323 conditions per place. [2022-12-06 04:07:32,455 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 186 transitions, 2433 flow [2022-12-06 04:07:32,455 INFO L188 LiptonReduction]: Number of co-enabled transitions 1398 [2022-12-06 04:07:33,102 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:07:33,103 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 763 [2022-12-06 04:07:33,103 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 186 transitions, 2457 flow [2022-12-06 04:07:33,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:07:33,103 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:07:33,103 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:07:33,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 04:07:33,304 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-06 04:07:33,304 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:07:33,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:07:33,304 INFO L85 PathProgramCache]: Analyzing trace with hash -2093625879, now seen corresponding path program 1 times [2022-12-06 04:07:33,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:07:33,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104675505] [2022-12-06 04:07:33,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:07:33,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:07:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:07:33,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-06 04:07:33,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:07:33,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104675505] [2022-12-06 04:07:33,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104675505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:07:33,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:07:33,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:07:33,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63140078] [2022-12-06 04:07:33,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:07:33,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:07:33,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:07:33,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:07:33,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:07:33,630 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 47 [2022-12-06 04:07:33,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 186 transitions, 2457 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:07:33,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:07:33,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 47 [2022-12-06 04:07:33,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:07:34,806 INFO L130 PetriNetUnfolder]: 4130/7925 cut-off events. [2022-12-06 04:07:34,806 INFO L131 PetriNetUnfolder]: For 29979/29979 co-relation queries the response was YES. [2022-12-06 04:07:34,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31300 conditions, 7925 events. 4130/7925 cut-off events. For 29979/29979 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 60722 event pairs, 2250 based on Foata normal form. 6/7931 useless extension candidates. Maximal degree in co-relation 30316. Up to 4962 conditions per place. [2022-12-06 04:07:34,846 INFO L137 encePairwiseOnDemand]: 30/47 looper letters, 244 selfloop transitions, 68 changer transitions 0/314 dead transitions. [2022-12-06 04:07:34,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 314 transitions, 4466 flow [2022-12-06 04:07:34,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 04:07:34,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 04:07:34,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 137 transitions. [2022-12-06 04:07:34,848 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32387706855791965 [2022-12-06 04:07:34,848 INFO L175 Difference]: Start difference. First operand has 104 places, 186 transitions, 2457 flow. Second operand 9 states and 137 transitions. [2022-12-06 04:07:34,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 314 transitions, 4466 flow [2022-12-06 04:07:34,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 314 transitions, 4168 flow, removed 97 selfloop flow, removed 6 redundant places. [2022-12-06 04:07:34,934 INFO L231 Difference]: Finished difference. Result has 110 places, 231 transitions, 3180 flow [2022-12-06 04:07:34,934 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2262, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3180, PETRI_PLACES=110, PETRI_TRANSITIONS=231} [2022-12-06 04:07:34,935 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 68 predicate places. [2022-12-06 04:07:34,935 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:07:34,935 INFO L89 Accepts]: Start accepts. Operand has 110 places, 231 transitions, 3180 flow [2022-12-06 04:07:34,936 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:07:34,936 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:07:34,936 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 231 transitions, 3180 flow [2022-12-06 04:07:34,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 231 transitions, 3180 flow [2022-12-06 04:07:35,100 INFO L130 PetriNetUnfolder]: 286/1285 cut-off events. [2022-12-06 04:07:35,100 INFO L131 PetriNetUnfolder]: For 5004/5107 co-relation queries the response was YES. [2022-12-06 04:07:35,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4854 conditions, 1285 events. 286/1285 cut-off events. For 5004/5107 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11525 event pairs, 28 based on Foata normal form. 17/1137 useless extension candidates. Maximal degree in co-relation 4603. Up to 314 conditions per place. [2022-12-06 04:07:35,114 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 231 transitions, 3180 flow [2022-12-06 04:07:35,114 INFO L188 LiptonReduction]: Number of co-enabled transitions 1726 [2022-12-06 04:07:35,948 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:07:35,949 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1014 [2022-12-06 04:07:35,949 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 231 transitions, 3186 flow [2022-12-06 04:07:35,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:07:35,949 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:07:35,949 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:07:35,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:07:35,949 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:07:35,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:07:35,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1607610805, now seen corresponding path program 1 times [2022-12-06 04:07:35,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:07:35,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284112389] [2022-12-06 04:07:35,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:07:35,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:07:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:07:36,522 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:07:36,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:07:36,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284112389] [2022-12-06 04:07:36,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284112389] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:07:36,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587094030] [2022-12-06 04:07:36,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:07:36,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:07:36,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:07:36,524 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:07:36,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 04:07:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:07:36,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-06 04:07:36,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:07:36,852 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 17 treesize of output 13 [2022-12-06 04:07:36,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 04:07:36,962 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-06 04:07:37,044 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-06 04:07:39,076 WARN L859 $PredicateComparison]: unable to prove that (exists ((aux_div_v_arrayElimCell_9_48 Int) (aux_mod_v_arrayElimCell_9_48 Int)) (let ((.cse0 (* aux_div_v_arrayElimCell_9_48 4294967296))) (and (<= (+ .cse0 aux_mod_v_arrayElimCell_9_48 1) 0) (<= 4294966496 aux_mod_v_arrayElimCell_9_48) (< aux_mod_v_arrayElimCell_9_48 4294967296) (< 0 (+ .cse0 4294967297 aux_mod_v_arrayElimCell_9_48)) (= (mod (+ (* 4294967295 aux_mod_v_arrayElimCell_9_48) 4294967295) 4294967296) |c_t2Thread1of1ForFork0_pop_#res#1|)))) is different from true [2022-12-06 04:07:39,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 04:07:39,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:07:39,236 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:07:39,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587094030] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:07:39,236 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:07:39,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 17 [2022-12-06 04:07:39,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507198950] [2022-12-06 04:07:39,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:07:39,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 04:07:39,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:07:39,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 04:07:39,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=222, Unknown=1, NotChecked=30, Total=306 [2022-12-06 04:07:39,237 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 48 [2022-12-06 04:07:39,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 231 transitions, 3186 flow. Second operand has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 18 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:07:39,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:07:39,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 48 [2022-12-06 04:07:39,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:08:42,521 INFO L130 PetriNetUnfolder]: 7087/13555 cut-off events. [2022-12-06 04:08:42,521 INFO L131 PetriNetUnfolder]: For 52737/52737 co-relation queries the response was YES. [2022-12-06 04:08:42,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52642 conditions, 13555 events. 7087/13555 cut-off events. For 52737/52737 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 113868 event pairs, 940 based on Foata normal form. 40/13595 useless extension candidates. Maximal degree in co-relation 51561. Up to 3438 conditions per place. [2022-12-06 04:08:42,595 INFO L137 encePairwiseOnDemand]: 11/48 looper letters, 379 selfloop transitions, 455 changer transitions 104/940 dead transitions. [2022-12-06 04:08:42,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 940 transitions, 10340 flow [2022-12-06 04:08:42,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-12-06 04:08:42,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2022-12-06 04:08:42,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 877 transitions. [2022-12-06 04:08:42,601 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21495098039215688 [2022-12-06 04:08:42,601 INFO L175 Difference]: Start difference. First operand has 110 places, 231 transitions, 3186 flow. Second operand 85 states and 877 transitions. [2022-12-06 04:08:42,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 940 transitions, 10340 flow [2022-12-06 04:08:42,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 940 transitions, 10315 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-06 04:08:42,893 INFO L231 Difference]: Finished difference. Result has 200 places, 508 transitions, 7742 flow [2022-12-06 04:08:42,893 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3165, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=191, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=85, PETRI_FLOW=7742, PETRI_PLACES=200, PETRI_TRANSITIONS=508} [2022-12-06 04:08:42,893 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 158 predicate places. [2022-12-06 04:08:42,893 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:08:42,893 INFO L89 Accepts]: Start accepts. Operand has 200 places, 508 transitions, 7742 flow [2022-12-06 04:08:42,895 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:08:42,895 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:08:42,895 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 508 transitions, 7742 flow [2022-12-06 04:08:42,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 508 transitions, 7742 flow [2022-12-06 04:08:43,384 INFO L130 PetriNetUnfolder]: 1211/4088 cut-off events. [2022-12-06 04:08:43,385 INFO L131 PetriNetUnfolder]: For 27155/28239 co-relation queries the response was YES. [2022-12-06 04:08:43,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20762 conditions, 4088 events. 1211/4088 cut-off events. For 27155/28239 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 42353 event pairs, 167 based on Foata normal form. 55/3693 useless extension candidates. Maximal degree in co-relation 20175. Up to 1018 conditions per place. [2022-12-06 04:08:43,440 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 508 transitions, 7742 flow [2022-12-06 04:08:43,440 INFO L188 LiptonReduction]: Number of co-enabled transitions 3384 [2022-12-06 04:08:48,931 INFO L203 LiptonReduction]: Total number of compositions: 18 [2022-12-06 04:08:48,931 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6038 [2022-12-06 04:08:48,932 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 494 transitions, 7660 flow [2022-12-06 04:08:48,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 18 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:48,932 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:08:48,932 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:08:48,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 04:08:49,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:08:49,133 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:08:49,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:08:49,133 INFO L85 PathProgramCache]: Analyzing trace with hash -2061517104, now seen corresponding path program 1 times [2022-12-06 04:08:49,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:08:49,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468209581] [2022-12-06 04:08:49,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:08:49,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:08:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:08:49,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:08:49,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:08:49,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468209581] [2022-12-06 04:08:49,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468209581] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:08:49,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324148059] [2022-12-06 04:08:49,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:08:49,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:08:49,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:08:49,680 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:08:49,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 04:08:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:08:49,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 76 conjunts are in the unsatisfiable core [2022-12-06 04:08:49,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:08:49,885 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-06 04:08:49,885 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-06 04:08:49,918 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 17 treesize of output 13 [2022-12-06 04:08:49,960 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 59 treesize of output 54 [2022-12-06 04:08:50,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 04:08:50,069 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 52 treesize of output 38 [2022-12-06 04:08:50,149 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 79 treesize of output 46 [2022-12-06 04:08:52,178 WARN L859 $PredicateComparison]: unable to prove that (exists ((aux_mod_v_arrayElimCell_15_49 Int) (aux_div_v_arrayElimCell_15_49 Int)) (let ((.cse0 (* aux_div_v_arrayElimCell_15_49 4294967296))) (and (<= (+ aux_mod_v_arrayElimCell_15_49 .cse0 1) 0) (= |c_t2Thread1of1ForFork0_pop_#res#1| (mod (+ 4294967295 (* 4294967295 aux_mod_v_arrayElimCell_15_49)) 4294967296)) (<= 4294966496 aux_mod_v_arrayElimCell_15_49) (< aux_mod_v_arrayElimCell_15_49 4294967296) (< 0 (+ aux_mod_v_arrayElimCell_15_49 4294967297 .cse0))))) is different from true [2022-12-06 04:08:52,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 04:08:52,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:08:52,347 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:08:52,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-06 04:08:52,351 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 81 treesize of output 57 [2022-12-06 04:08:52,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-12-06 04:08:52,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:08:52,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324148059] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:08:52,396 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:08:52,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-12-06 04:08:52,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066142066] [2022-12-06 04:08:52,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:08:52,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 04:08:52,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:08:52,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 04:08:52,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=270, Unknown=3, NotChecked=34, Total=380 [2022-12-06 04:08:52,397 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 75 [2022-12-06 04:08:52,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 494 transitions, 7660 flow. Second operand has 20 states, 20 states have (on average 3.8) internal successors, (76), 20 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-06 04:08:52,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:08:52,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 75 [2022-12-06 04:08:52,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:14,019 INFO L130 PetriNetUnfolder]: 19586/37854 cut-off events. [2022-12-06 04:09:14,019 INFO L131 PetriNetUnfolder]: For 397228/397228 co-relation queries the response was YES. [2022-12-06 04:09:14,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224122 conditions, 37854 events. 19586/37854 cut-off events. For 397228/397228 co-relation queries the response was YES. Maximal size of possible extension queue 1808. Compared 368365 event pairs, 2404 based on Foata normal form. 430/38284 useless extension candidates. Maximal degree in co-relation 220809. Up to 13969 conditions per place. [2022-12-06 04:09:14,733 INFO L137 encePairwiseOnDemand]: 17/75 looper letters, 657 selfloop transitions, 1231 changer transitions 208/2098 dead transitions. [2022-12-06 04:09:14,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 2098 transitions, 32976 flow [2022-12-06 04:09:14,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-12-06 04:09:14,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2022-12-06 04:09:14,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 1221 transitions. [2022-12-06 04:09:14,737 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1596078431372549 [2022-12-06 04:09:14,737 INFO L175 Difference]: Start difference. First operand has 186 places, 494 transitions, 7660 flow. Second operand 102 states and 1221 transitions. [2022-12-06 04:09:14,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 2098 transitions, 32976 flow [2022-12-06 04:09:15,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 2098 transitions, 31373 flow, removed 329 selfloop flow, removed 8 redundant places. [2022-12-06 04:09:15,751 INFO L231 Difference]: Finished difference. Result has 299 places, 1367 transitions, 24356 flow [2022-12-06 04:09:15,752 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=6533, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=346, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=102, PETRI_FLOW=24356, PETRI_PLACES=299, PETRI_TRANSITIONS=1367} [2022-12-06 04:09:15,752 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 257 predicate places. [2022-12-06 04:09:15,752 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:15,752 INFO L89 Accepts]: Start accepts. Operand has 299 places, 1367 transitions, 24356 flow [2022-12-06 04:09:15,755 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:15,755 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:15,755 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 299 places, 1367 transitions, 24356 flow [2022-12-06 04:09:15,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 299 places, 1367 transitions, 24356 flow [2022-12-06 04:09:17,901 INFO L130 PetriNetUnfolder]: 3409/11630 cut-off events. [2022-12-06 04:09:17,901 INFO L131 PetriNetUnfolder]: For 101602/104739 co-relation queries the response was YES. [2022-12-06 04:09:17,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67130 conditions, 11630 events. 3409/11630 cut-off events. For 101602/104739 co-relation queries the response was YES. Maximal size of possible extension queue 791. Compared 140280 event pairs, 779 based on Foata normal form. 139/10507 useless extension candidates. Maximal degree in co-relation 65442. Up to 2938 conditions per place. [2022-12-06 04:09:18,167 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 299 places, 1367 transitions, 24356 flow [2022-12-06 04:09:18,167 INFO L188 LiptonReduction]: Number of co-enabled transitions 9266 [2022-12-06 04:09:19,898 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [669] L991-6-->L991-6: Formula: (let ((.cse0 (select |v_#pthreadsMutex_791| |v_~#m~0.base_345|)) (.cse1 (mod |v_t1Thread1of1ForFork1_~tmp~0#1_210| 4294967296))) (and (= (select .cse0 |v_~#m~0.offset_345|) 0) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_199| |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_207|) (= |v_t1Thread1of1ForFork1_push_#res#1_336| 0) (= |v_t1Thread1of1ForFork1_~i~0#1_331| (+ |v_t1Thread1of1ForFork1_~i~0#1_332| 1)) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_199| (ite (< .cse1 800) 1 0)) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_185| |v_~#arr~0.offset_207|) (= |v_t1Thread1of1ForFork1_get_top_#res#1_200| v_~top~0_666) (not (= |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_207| 0)) (= (store |v_#memory_int_402| |v_t1Thread1of1ForFork1_push_~stack#1.base_207| (store (select |v_#memory_int_402| |v_t1Thread1of1ForFork1_push_~stack#1.base_207|) (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_200| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_207|) |v_t1Thread1of1ForFork1_push_~x#1_207|)) |v_#memory_int_401|) (< |v_t1Thread1of1ForFork1_~i~0#1_332| 800) (= (store |v_#pthreadsMutex_791| |v_~#m~0.base_345| (store .cse0 |v_~#m~0.offset_345| 0)) |v_#pthreadsMutex_789|) (= v_~top~0_665 (+ v_~top~0_666 1)) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.base_185| |v_~#arr~0.base_212|) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_185| |v_t1Thread1of1ForFork1_push_~stack#1.offset_207|) (= |v_t1Thread1of1ForFork1_push_#in~x#1_185| |v_t1Thread1of1ForFork1_push_~x#1_207|) (not (= 800 v_~top~0_666)) (<= |v_t1Thread1of1ForFork1_get_top_#res#1_200| 2147483647) (<= 0 (+ |v_t1Thread1of1ForFork1_get_top_#res#1_200| 2147483648)) (= |v_t1Thread1of1ForFork1_#t~nondet40#1_325| |v_t1Thread1of1ForFork1_~tmp~0#1_210|) (= |v_t1Thread1of1ForFork1_push_~stack#1.base_207| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_185|) (= |v_t1Thread1of1ForFork1_push_#in~x#1_185| (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_791|, ~#arr~0.offset=|v_~#arr~0.offset_207|, ~#m~0.base=|v_~#m~0.base_345|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_332|, ~#m~0.offset=|v_~#m~0.offset_345|, #memory_int=|v_#memory_int_402|, ~top~0=v_~top~0_666, ~#arr~0.base=|v_~#arr~0.base_212|, t1Thread1of1ForFork1_#t~nondet40#1=|v_t1Thread1of1ForFork1_#t~nondet40#1_325|} OutVars{t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_331|, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_199|, t1Thread1of1ForFork1_push_#in~stack#1.offset=|v_t1Thread1of1ForFork1_push_#in~stack#1.offset_185|, ~top~0=v_~top~0_665, t1Thread1of1ForFork1_push_#in~x#1=|v_t1Thread1of1ForFork1_push_#in~x#1_185|, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_336|, t1Thread1of1ForFork1_get_top_#res#1=|v_t1Thread1of1ForFork1_get_top_#res#1_200|, t1Thread1of1ForFork1_#t~nondet39#1=|v_t1Thread1of1ForFork1_#t~nondet39#1_195|, t1Thread1of1ForFork1_push_~stack#1.base=|v_t1Thread1of1ForFork1_push_~stack#1.base_207|, ~#arr~0.base=|v_~#arr~0.base_212|, t1Thread1of1ForFork1_#t~post38#1=|v_t1Thread1of1ForFork1_#t~post38#1_139|, #pthreadsMutex=|v_#pthreadsMutex_789|, ~#arr~0.offset=|v_~#arr~0.offset_207|, t1Thread1of1ForFork1_push_~x#1=|v_t1Thread1of1ForFork1_push_~x#1_207|, t1Thread1of1ForFork1_push_#t~ret34#1=|v_t1Thread1of1ForFork1_push_#t~ret34#1_229|, t1Thread1of1ForFork1_push_#in~stack#1.base=|v_t1Thread1of1ForFork1_push_#in~stack#1.base_185|, ~#m~0.base=|v_~#m~0.base_345|, ~#m~0.offset=|v_~#m~0.offset_345|, t1Thread1of1ForFork1_~tmp~0#1=|v_t1Thread1of1ForFork1_~tmp~0#1_210|, #memory_int=|v_#memory_int_401|, t1Thread1of1ForFork1_#t~ret41#1=|v_t1Thread1of1ForFork1_#t~ret41#1_277|, t1Thread1of1ForFork1_push_~stack#1.offset=|v_t1Thread1of1ForFork1_push_~stack#1.offset_207|, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_207|, t1Thread1of1ForFork1_push_#t~nondet33#1=|v_t1Thread1of1ForFork1_push_#t~nondet33#1_184|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_476|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_#t~post38#1, #pthreadsMutex, t1Thread1of1ForFork1_push_~x#1, t1Thread1of1ForFork1_~i~0#1, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, t1Thread1of1ForFork1_push_#in~stack#1.offset, t1Thread1of1ForFork1_push_#t~ret34#1, t1Thread1of1ForFork1_push_#in~stack#1.base, ~top~0, t1Thread1of1ForFork1_push_#in~x#1, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_#t~nondet40#1, t1Thread1of1ForFork1_get_top_#res#1, t1Thread1of1ForFork1_~tmp~0#1, #memory_int, t1Thread1of1ForFork1_#t~ret41#1, t1Thread1of1ForFork1_#t~nondet39#1, t1Thread1of1ForFork1_push_~stack#1.offset, t1Thread1of1ForFork1_push_~stack#1.base, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1, t1Thread1of1ForFork1_push_#t~nondet33#1, t1Thread1of1ForFork1_inc_top_#t~post31#1] and [563] L1021-4-->L1022-3: Formula: (and (= |v_#pthreadsForks_26| |v_ULTIMATE.start_main_#t~pre47#1_21|) (= |v_#memory_int_87| (store |v_#memory_int_88| |v_ULTIMATE.start_main_~#id2~0#1.base_21| (store (select |v_#memory_int_88| |v_ULTIMATE.start_main_~#id2~0#1.base_21|) |v_ULTIMATE.start_main_~#id2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre47#1_21|))) (= |v_#pthreadsForks_25| (+ |v_#pthreadsForks_26| 1))) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_26|, #memory_int=|v_#memory_int_88|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~nondet46#1=|v_ULTIMATE.start_main_#t~nondet46#1_15|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_25|, #memory_int=|v_#memory_int_87|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_21|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_21|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre47#1, ULTIMATE.start_main_#t~pre45#1] [2022-12-06 04:09:21,601 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [711] L991-6-->L945: Formula: (let ((.cse2 (mod |v_t1Thread1of1ForFork1_#t~nondet40#1_713| 4294967296)) (.cse3 (mod |v_t1Thread1of1ForFork1_~tmp~0#1_407| 4294967296)) (.cse0 (select |v_#pthreadsMutex_1351| |v_~#m~0.base_584|))) (and (= (select .cse0 |v_~#m~0.offset_584|) 0) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_381| |v_~#arr~0.offset_442|) (= |v_t1Thread1of1ForFork1_push_#in~x#1_381| |v_t1Thread1of1ForFork1_push_~x#1_403|) (= (let ((.cse1 (store |v_#memory_int_838| |v_~#arr~0.base_447| (store (select |v_#memory_int_838| |v_~#arr~0.base_447|) (+ |v_~#arr~0.offset_442| (* v_~top~0_1099 4)) (ite (<= .cse2 2147483647) .cse2 (+ .cse2 (- 4294967296))))))) (store .cse1 |v_t1Thread1of1ForFork1_push_~stack#1.base_403| (store (select .cse1 |v_t1Thread1of1ForFork1_push_~stack#1.base_403|) (+ |v_t1Thread1of1ForFork1_push_~stack#1.offset_403| (* |v_t1Thread1of1ForFork1_get_top_#res#1_396| 4)) |v_t1Thread1of1ForFork1_push_~x#1_403|))) |v_#memory_int_836|) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_395| (ite (< .cse3 800) 1 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_663| 800) (= |v_t1Thread1of1ForFork1_~i~0#1_663| (+ |v_t1Thread1of1ForFork1_~i~0#1_664| 1)) (= (+ v_~top~0_1099 1) v_~top~0_1098) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.base_381| |v_~#arr~0.base_447|) (not (= |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_403| 0)) (= |v_t1Thread1of1ForFork1_get_top_#res#1_396| v_~top~0_1098) (not (= 0 (ite (< .cse2 800) 1 0))) (<= 0 (+ v_~top~0_1099 2147483648)) (= |v_t1Thread1of1ForFork1_push_~stack#1.base_403| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_381|) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_381| |v_t1Thread1of1ForFork1_push_~stack#1.offset_403|) (= |v_t1Thread1of1ForFork1_push_#in~x#1_381| (ite (<= .cse3 2147483647) .cse3 (+ (- 4294967296) .cse3))) (not (= v_~top~0_1099 800)) (= |v_t1Thread1of1ForFork1_#t~nondet40#1_712| |v_t1Thread1of1ForFork1_~tmp~0#1_407|) (= |v_#pthreadsMutex_1349| (store |v_#pthreadsMutex_1351| |v_~#m~0.base_584| (store .cse0 |v_~#m~0.offset_584| 1))) (not (= v_~top~0_1098 800)) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_395| |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_403|) (<= |v_t1Thread1of1ForFork1_get_top_#res#1_396| 2147483647))) InVars {#pthreadsMutex=|v_#pthreadsMutex_1351|, ~#arr~0.offset=|v_~#arr~0.offset_442|, ~#m~0.base=|v_~#m~0.base_584|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_664|, ~#m~0.offset=|v_~#m~0.offset_584|, #memory_int=|v_#memory_int_838|, ~top~0=v_~top~0_1099, ~#arr~0.base=|v_~#arr~0.base_447|, t1Thread1of1ForFork1_#t~nondet40#1=|v_t1Thread1of1ForFork1_#t~nondet40#1_713|} OutVars{t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_663|, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_395|, t1Thread1of1ForFork1_push_#in~stack#1.offset=|v_t1Thread1of1ForFork1_push_#in~stack#1.offset_381|, ~top~0=v_~top~0_1098, t1Thread1of1ForFork1_push_#in~x#1=|v_t1Thread1of1ForFork1_push_#in~x#1_381|, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_563|, t1Thread1of1ForFork1_get_top_#res#1=|v_t1Thread1of1ForFork1_get_top_#res#1_396|, t1Thread1of1ForFork1_#t~nondet39#1=|v_t1Thread1of1ForFork1_#t~nondet39#1_391|, t1Thread1of1ForFork1_push_~stack#1.base=|v_t1Thread1of1ForFork1_push_~stack#1.base_403|, ~#arr~0.base=|v_~#arr~0.base_447|, #pthreadsMutex=|v_#pthreadsMutex_1349|, ~#arr~0.offset=|v_~#arr~0.offset_442|, t1Thread1of1ForFork1_#t~post38#1=|v_t1Thread1of1ForFork1_#t~post38#1_277|, t1Thread1of1ForFork1_push_~x#1=|v_t1Thread1of1ForFork1_push_~x#1_403|, t1Thread1of1ForFork1_push_#t~ret34#1=|v_t1Thread1of1ForFork1_push_#t~ret34#1_425|, t1Thread1of1ForFork1_push_#in~stack#1.base=|v_t1Thread1of1ForFork1_push_#in~stack#1.base_381|, ~#m~0.base=|v_~#m~0.base_584|, ~#m~0.offset=|v_~#m~0.offset_584|, t1Thread1of1ForFork1_~tmp~0#1=|v_t1Thread1of1ForFork1_~tmp~0#1_407|, #memory_int=|v_#memory_int_836|, t1Thread1of1ForFork1_#t~ret41#1=|v_t1Thread1of1ForFork1_#t~ret41#1_415|, t1Thread1of1ForFork1_push_~stack#1.offset=|v_t1Thread1of1ForFork1_push_~stack#1.offset_403|, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_403|, t1Thread1of1ForFork1_push_#t~nondet33#1=|v_t1Thread1of1ForFork1_push_#t~nondet33#1_380|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_703|} AuxVars[|v_t1Thread1of1ForFork1_#t~nondet40#1_712|] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_#t~post38#1, t1Thread1of1ForFork1_push_~x#1, t1Thread1of1ForFork1_~i~0#1, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, t1Thread1of1ForFork1_push_#in~stack#1.offset, t1Thread1of1ForFork1_push_#t~ret34#1, t1Thread1of1ForFork1_push_#in~stack#1.base, ~top~0, t1Thread1of1ForFork1_push_#in~x#1, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_#t~nondet40#1, t1Thread1of1ForFork1_get_top_#res#1, t1Thread1of1ForFork1_~tmp~0#1, #memory_int, t1Thread1of1ForFork1_#t~ret41#1, t1Thread1of1ForFork1_#t~nondet39#1, t1Thread1of1ForFork1_push_~stack#1.offset, t1Thread1of1ForFork1_push_~stack#1.base, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1, t1Thread1of1ForFork1_push_#t~nondet33#1, t1Thread1of1ForFork1_inc_top_#t~post31#1] and [563] L1021-4-->L1022-3: Formula: (and (= |v_#pthreadsForks_26| |v_ULTIMATE.start_main_#t~pre47#1_21|) (= |v_#memory_int_87| (store |v_#memory_int_88| |v_ULTIMATE.start_main_~#id2~0#1.base_21| (store (select |v_#memory_int_88| |v_ULTIMATE.start_main_~#id2~0#1.base_21|) |v_ULTIMATE.start_main_~#id2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre47#1_21|))) (= |v_#pthreadsForks_25| (+ |v_#pthreadsForks_26| 1))) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_26|, #memory_int=|v_#memory_int_88|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~nondet46#1=|v_ULTIMATE.start_main_#t~nondet46#1_15|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_25|, #memory_int=|v_#memory_int_87|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_21|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_21|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre47#1, ULTIMATE.start_main_#t~pre45#1] [2022-12-06 04:09:23,500 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [714] L991-6-->L1022-3: Formula: (let ((.cse0 (mod |v_t1Thread1of1ForFork1_~tmp~0#1_442| 4294967296)) (.cse1 (select |v_#pthreadsMutex_1422| |v_~#m~0.base_617|)) (.cse4 (mod |v_t1Thread1of1ForFork1_#t~nondet40#1_783| 4294967296))) (and (= |v_t1Thread1of1ForFork1_push_#in~x#1_416| (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_430| (ite (< .cse0 800) 1 0)) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_416| |v_t1Thread1of1ForFork1_push_~stack#1.offset_438|) (= v_~top~0_1160 (+ v_~top~0_1161 1)) (= (select .cse1 |v_~#m~0.offset_617|) 0) (= |v_t1Thread1of1ForFork1_get_top_#res#1_431| v_~top~0_1160) (= (+ |v_#pthreadsForks_60| 1) |v_#pthreadsForks_59|) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_416| |v_~#arr~0.offset_482|) (<= |v_t1Thread1of1ForFork1_get_top_#res#1_431| 2147483647) (not (= v_~top~0_1160 800)) (<= 0 (+ v_~top~0_1161 2147483648)) (= |v_#pthreadsForks_60| |v_ULTIMATE.start_main_#t~pre47#1_304|) (= |v_t1Thread1of1ForFork1_~i~0#1_716| (+ |v_t1Thread1of1ForFork1_~i~0#1_717| 1)) (= (store |v_#pthreadsMutex_1422| |v_~#m~0.base_617| (store .cse1 |v_~#m~0.offset_617| 1)) |v_#pthreadsMutex_1421|) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_430| |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_438|) (= (let ((.cse2 (let ((.cse3 (store |v_#memory_int_913| |v_~#arr~0.base_487| (store (select |v_#memory_int_913| |v_~#arr~0.base_487|) (+ (* v_~top~0_1161 4) |v_~#arr~0.offset_482|) (ite (<= .cse4 2147483647) .cse4 (+ .cse4 (- 4294967296))))))) (store .cse3 |v_t1Thread1of1ForFork1_push_~stack#1.base_438| (store (select .cse3 |v_t1Thread1of1ForFork1_push_~stack#1.base_438|) (+ |v_t1Thread1of1ForFork1_push_~stack#1.offset_438| (* |v_t1Thread1of1ForFork1_get_top_#res#1_431| 4)) |v_t1Thread1of1ForFork1_push_~x#1_438|))))) (store .cse2 |v_ULTIMATE.start_main_~#id2~0#1.base_93| (store (select .cse2 |v_ULTIMATE.start_main_~#id2~0#1.base_93|) |v_ULTIMATE.start_main_~#id2~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre47#1_304|))) |v_#memory_int_911|) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.base_416| |v_~#arr~0.base_487|) (not (= v_~top~0_1161 800)) (= |v_t1Thread1of1ForFork1_push_~stack#1.base_438| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_416|) (not (= |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_438| 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_716| 800) (= |v_t1Thread1of1ForFork1_push_#in~x#1_416| |v_t1Thread1of1ForFork1_push_~x#1_438|) (not (= (ite (< .cse4 800) 1 0) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_1422|, ~#arr~0.offset=|v_~#arr~0.offset_482|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_39|, ~#m~0.base=|v_~#m~0.base_617|, #pthreadsForks=|v_#pthreadsForks_60|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_717|, ~#m~0.offset=|v_~#m~0.offset_617|, #memory_int=|v_#memory_int_913|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_93|, ~top~0=v_~top~0_1161, ~#arr~0.base=|v_~#arr~0.base_487|, t1Thread1of1ForFork1_#t~nondet40#1=|v_t1Thread1of1ForFork1_#t~nondet40#1_783|} OutVars{t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_716|, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_430|, t1Thread1of1ForFork1_push_#in~stack#1.offset=|v_t1Thread1of1ForFork1_push_#in~stack#1.offset_416|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_304|, ~top~0=v_~top~0_1160, t1Thread1of1ForFork1_push_#in~x#1=|v_t1Thread1of1ForFork1_push_#in~x#1_416|, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_602|, t1Thread1of1ForFork1_get_top_#res#1=|v_t1Thread1of1ForFork1_get_top_#res#1_431|, #pthreadsForks=|v_#pthreadsForks_59|, t1Thread1of1ForFork1_#t~nondet39#1=|v_t1Thread1of1ForFork1_#t~nondet39#1_426|, t1Thread1of1ForFork1_push_~stack#1.base=|v_t1Thread1of1ForFork1_push_~stack#1.base_438|, ~#arr~0.base=|v_~#arr~0.base_487|, #pthreadsMutex=|v_#pthreadsMutex_1421|, ~#arr~0.offset=|v_~#arr~0.offset_482|, t1Thread1of1ForFork1_#t~post38#1=|v_t1Thread1of1ForFork1_#t~post38#1_297|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_39|, t1Thread1of1ForFork1_push_~x#1=|v_t1Thread1of1ForFork1_push_~x#1_438|, t1Thread1of1ForFork1_push_#t~ret34#1=|v_t1Thread1of1ForFork1_push_#t~ret34#1_460|, t1Thread1of1ForFork1_push_#in~stack#1.base=|v_t1Thread1of1ForFork1_push_#in~stack#1.base_416|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_41|, ULTIMATE.start_main_#t~nondet46#1=|v_ULTIMATE.start_main_#t~nondet46#1_33|, ~#m~0.base=|v_~#m~0.base_617|, ~#m~0.offset=|v_~#m~0.offset_617|, t1Thread1of1ForFork1_~tmp~0#1=|v_t1Thread1of1ForFork1_~tmp~0#1_442|, #memory_int=|v_#memory_int_911|, t1Thread1of1ForFork1_#t~ret41#1=|v_t1Thread1of1ForFork1_#t~ret41#1_435|, t1Thread1of1ForFork1_push_~stack#1.offset=|v_t1Thread1of1ForFork1_push_~stack#1.offset_438|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_93|, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_438|, t1Thread1of1ForFork1_push_#t~nondet33#1=|v_t1Thread1of1ForFork1_push_#t~nondet33#1_415|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_742|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_~i~0#1, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, t1Thread1of1ForFork1_push_#in~stack#1.offset, ULTIMATE.start_main_#t~pre47#1, ~top~0, t1Thread1of1ForFork1_push_#in~x#1, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_#t~nondet40#1, t1Thread1of1ForFork1_get_top_#res#1, #pthreadsForks, t1Thread1of1ForFork1_#t~nondet39#1, t1Thread1of1ForFork1_push_~stack#1.base, #pthreadsMutex, t1Thread1of1ForFork1_#t~post38#1, t1Thread1of1ForFork1_push_~x#1, t1Thread1of1ForFork1_push_#t~ret34#1, t1Thread1of1ForFork1_push_#in~stack#1.base, ULTIMATE.start_main_#t~pre45#1, ULTIMATE.start_main_#t~nondet46#1, t1Thread1of1ForFork1_~tmp~0#1, #memory_int, t1Thread1of1ForFork1_#t~ret41#1, t1Thread1of1ForFork1_push_~stack#1.offset, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1, t1Thread1of1ForFork1_push_#t~nondet33#1, t1Thread1of1ForFork1_inc_top_#t~post31#1] and [627] L945-->L991-6: Formula: (and (= |v_t1Thread1of1ForFork1_~i~0#1_136| (+ |v_t1Thread1of1ForFork1_~i~0#1_137| 1)) (= (store |v_#pthreadsMutex_403| |v_~#m~0.base_188| (store (select |v_#pthreadsMutex_403| |v_~#m~0.base_188|) |v_~#m~0.offset_188| 0)) |v_#pthreadsMutex_402|) (= (+ v_~top~0_411 1) v_~top~0_410) (= |v_t1Thread1of1ForFork1_push_#res#1_166| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_403|, ~#m~0.base=|v_~#m~0.base_188|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_137|, ~#m~0.offset=|v_~#m~0.offset_188|, ~top~0=v_~top~0_411} OutVars{t1Thread1of1ForFork1_#t~post38#1=|v_t1Thread1of1ForFork1_#t~post38#1_69|, #pthreadsMutex=|v_#pthreadsMutex_402|, ~#m~0.base=|v_~#m~0.base_188|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_136|, ~#m~0.offset=|v_~#m~0.offset_188|, t1Thread1of1ForFork1_#t~ret41#1=|v_t1Thread1of1ForFork1_#t~ret41#1_194|, ~top~0=v_~top~0_410, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_166|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_301|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_#t~post38#1, #pthreadsMutex, t1Thread1of1ForFork1_~i~0#1, t1Thread1of1ForFork1_#t~ret41#1, ~top~0, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_inc_top_#t~post31#1] [2022-12-06 04:09:24,039 INFO L203 LiptonReduction]: Total number of compositions: 14 [2022-12-06 04:09:24,040 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8288 [2022-12-06 04:09:24,040 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 1357 transitions, 24339 flow [2022-12-06 04:09:24,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.8) internal successors, (76), 20 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-06 04:09:24,040 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:24,040 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:24,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-06 04:09:24,247 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,SelfDestructingSolverStorable12 [2022-12-06 04:09:24,247 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:24,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:24,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1505073838, now seen corresponding path program 1 times [2022-12-06 04:09:24,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:24,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576125223] [2022-12-06 04:09:24,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:24,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:24,346 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:24,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:24,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576125223] [2022-12-06 04:09:24,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576125223] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:09:24,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177983227] [2022-12-06 04:09:24,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:24,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:09:24,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:09:24,348 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:09:24,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 04:09:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:24,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 04:09:24,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:09:24,487 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:24,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:09:24,572 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:24,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177983227] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:09:24,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:09:24,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-12-06 04:09:24,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450830857] [2022-12-06 04:09:24,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:09:24,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 04:09:24,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:24,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 04:09:24,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2022-12-06 04:09:24,575 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 102 [2022-12-06 04:09:24,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 1357 transitions, 24339 flow. Second operand has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:24,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:24,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 102 [2022-12-06 04:09:24,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:40,023 INFO L130 PetriNetUnfolder]: 26348/50510 cut-off events. [2022-12-06 04:09:40,023 INFO L131 PetriNetUnfolder]: For 722606/722606 co-relation queries the response was YES. [2022-12-06 04:09:40,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339319 conditions, 50510 events. 26348/50510 cut-off events. For 722606/722606 co-relation queries the response was YES. Maximal size of possible extension queue 2351. Compared 503954 event pairs, 7082 based on Foata normal form. 422/50932 useless extension candidates. Maximal degree in co-relation 325609. Up to 19026 conditions per place. [2022-12-06 04:09:40,702 INFO L137 encePairwiseOnDemand]: 25/102 looper letters, 780 selfloop transitions, 1375 changer transitions 55/2212 dead transitions. [2022-12-06 04:09:40,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 2212 transitions, 41302 flow [2022-12-06 04:09:40,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-06 04:09:40,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-06 04:09:40,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 438 transitions. [2022-12-06 04:09:40,707 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16515837104072398 [2022-12-06 04:09:40,707 INFO L175 Difference]: Start difference. First operand has 288 places, 1357 transitions, 24339 flow. Second operand 26 states and 438 transitions. [2022-12-06 04:09:40,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 2212 transitions, 41302 flow [2022-12-06 04:09:45,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 2212 transitions, 40722 flow, removed 248 selfloop flow, removed 7 redundant places. [2022-12-06 04:09:45,309 INFO L231 Difference]: Finished difference. Result has 318 places, 1796 transitions, 36546 flow [2022-12-06 04:09:45,310 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=23571, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=983, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=36546, PETRI_PLACES=318, PETRI_TRANSITIONS=1796} [2022-12-06 04:09:45,310 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 276 predicate places. [2022-12-06 04:09:45,310 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:45,310 INFO L89 Accepts]: Start accepts. Operand has 318 places, 1796 transitions, 36546 flow [2022-12-06 04:09:45,313 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:45,314 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:45,314 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 318 places, 1796 transitions, 36546 flow [2022-12-06 04:09:45,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 318 places, 1796 transitions, 36546 flow [2022-12-06 04:09:49,008 INFO L130 PetriNetUnfolder]: 5108/16760 cut-off events. [2022-12-06 04:09:49,008 INFO L131 PetriNetUnfolder]: For 198336/204035 co-relation queries the response was YES. [2022-12-06 04:09:49,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106461 conditions, 16760 events. 5108/16760 cut-off events. For 198336/204035 co-relation queries the response was YES. Maximal size of possible extension queue 1122. Compared 210327 event pairs, 1374 based on Foata normal form. 162/15012 useless extension candidates. Maximal degree in co-relation 103730. Up to 4712 conditions per place. [2022-12-06 04:09:49,359 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 318 places, 1796 transitions, 36546 flow [2022-12-06 04:09:49,359 INFO L188 LiptonReduction]: Number of co-enabled transitions 12548 [2022-12-06 04:09:49,789 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 04:09:49,790 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4480 [2022-12-06 04:09:49,790 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 1794 transitions, 36541 flow [2022-12-06 04:09:49,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:49,790 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:49,790 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:49,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-06 04:09:49,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:09:49,997 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:49,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:49,997 INFO L85 PathProgramCache]: Analyzing trace with hash 146936535, now seen corresponding path program 1 times [2022-12-06 04:09:49,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:49,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362171098] [2022-12-06 04:09:49,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:49,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:50,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:09:50,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:50,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362171098] [2022-12-06 04:09:50,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362171098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:50,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:50,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:09:50,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778396993] [2022-12-06 04:09:50,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:50,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:09:50,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:50,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:09:50,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:09:50,277 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 111 [2022-12-06 04:09:50,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 1794 transitions, 36541 flow. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:50,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:50,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 111 [2022-12-06 04:09:50,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:16,468 INFO L130 PetriNetUnfolder]: 34031/65692 cut-off events. [2022-12-06 04:10:16,468 INFO L131 PetriNetUnfolder]: For 1031554/1031554 co-relation queries the response was YES. [2022-12-06 04:10:17,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457993 conditions, 65692 events. 34031/65692 cut-off events. For 1031554/1031554 co-relation queries the response was YES. Maximal size of possible extension queue 2969. Compared 686266 event pairs, 13595 based on Foata normal form. 6/65698 useless extension candidates. Maximal degree in co-relation 449024. Up to 33735 conditions per place. [2022-12-06 04:10:18,005 INFO L137 encePairwiseOnDemand]: 78/111 looper letters, 2042 selfloop transitions, 489 changer transitions 12/2545 dead transitions. [2022-12-06 04:10:18,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 2545 transitions, 56020 flow [2022-12-06 04:10:18,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:10:18,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:10:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 231 transitions. [2022-12-06 04:10:18,007 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34684684684684686 [2022-12-06 04:10:18,007 INFO L175 Difference]: Start difference. First operand has 316 places, 1794 transitions, 36541 flow. Second operand 6 states and 231 transitions. [2022-12-06 04:10:18,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 2545 transitions, 56020 flow [2022-12-06 04:10:26,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 2545 transitions, 55456 flow, removed 280 selfloop flow, removed 1 redundant places. [2022-12-06 04:10:26,100 INFO L231 Difference]: Finished difference. Result has 324 places, 1977 transitions, 42827 flow [2022-12-06 04:10:26,102 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=36096, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1794, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=308, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=42827, PETRI_PLACES=324, PETRI_TRANSITIONS=1977} [2022-12-06 04:10:26,102 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 282 predicate places. [2022-12-06 04:10:26,102 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:26,102 INFO L89 Accepts]: Start accepts. Operand has 324 places, 1977 transitions, 42827 flow [2022-12-06 04:10:26,107 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:26,107 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:26,107 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 324 places, 1977 transitions, 42827 flow [2022-12-06 04:10:26,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 324 places, 1977 transitions, 42827 flow [2022-12-06 04:10:30,686 INFO L130 PetriNetUnfolder]: 6034/20068 cut-off events. [2022-12-06 04:10:30,686 INFO L131 PetriNetUnfolder]: For 265322/272510 co-relation queries the response was YES. [2022-12-06 04:10:30,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130113 conditions, 20068 events. 6034/20068 cut-off events. For 265322/272510 co-relation queries the response was YES. Maximal size of possible extension queue 1309. Compared 261481 event pairs, 1574 based on Foata normal form. 195/17966 useless extension candidates. Maximal degree in co-relation 127057. Up to 5468 conditions per place. [2022-12-06 04:10:31,179 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 324 places, 1977 transitions, 42827 flow [2022-12-06 04:10:31,179 INFO L188 LiptonReduction]: Number of co-enabled transitions 13874 [2022-12-06 04:10:31,217 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:31,218 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5116 [2022-12-06 04:10:31,218 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 1977 transitions, 42827 flow [2022-12-06 04:10:31,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:31,218 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:31,218 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:31,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 04:10:31,218 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:31,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:31,219 INFO L85 PathProgramCache]: Analyzing trace with hash 356639303, now seen corresponding path program 1 times [2022-12-06 04:10:31,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:31,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394710977] [2022-12-06 04:10:31,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:31,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:31,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:10:31,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:31,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394710977] [2022-12-06 04:10:31,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394710977] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:31,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:31,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:10:31,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382465002] [2022-12-06 04:10:31,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:31,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:10:31,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:31,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:10:31,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:10:31,528 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 111 [2022-12-06 04:10:31,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 1977 transitions, 42827 flow. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:31,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:31,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 111 [2022-12-06 04:10:31,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:01,753 INFO L130 PetriNetUnfolder]: 34995/67526 cut-off events. [2022-12-06 04:11:01,754 INFO L131 PetriNetUnfolder]: For 1121203/1121203 co-relation queries the response was YES. [2022-12-06 04:11:03,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475254 conditions, 67526 events. 34995/67526 cut-off events. For 1121203/1121203 co-relation queries the response was YES. Maximal size of possible extension queue 3034. Compared 707883 event pairs, 13783 based on Foata normal form. 6/67532 useless extension candidates. Maximal degree in co-relation 466120. Up to 29867 conditions per place. [2022-12-06 04:11:03,548 INFO L137 encePairwiseOnDemand]: 79/111 looper letters, 1950 selfloop transitions, 688 changer transitions 21/2661 dead transitions. [2022-12-06 04:11:03,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 2661 transitions, 59855 flow [2022-12-06 04:11:03,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 04:11:03,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 04:11:03,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 249 transitions. [2022-12-06 04:11:03,551 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22432432432432434 [2022-12-06 04:11:03,551 INFO L175 Difference]: Start difference. First operand has 324 places, 1977 transitions, 42827 flow. Second operand 10 states and 249 transitions. [2022-12-06 04:11:03,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 2661 transitions, 59855 flow [2022-12-06 04:11:11,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 2661 transitions, 59794 flow, removed 30 selfloop flow, removed 1 redundant places. [2022-12-06 04:11:12,019 INFO L231 Difference]: Finished difference. Result has 334 places, 2040 transitions, 46584 flow [2022-12-06 04:11:12,020 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=42770, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1977, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=625, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=46584, PETRI_PLACES=334, PETRI_TRANSITIONS=2040} [2022-12-06 04:11:12,021 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 292 predicate places. [2022-12-06 04:11:12,021 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:12,021 INFO L89 Accepts]: Start accepts. Operand has 334 places, 2040 transitions, 46584 flow [2022-12-06 04:11:12,027 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:12,027 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:12,027 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 334 places, 2040 transitions, 46584 flow [2022-12-06 04:11:12,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 334 places, 2040 transitions, 46584 flow [2022-12-06 04:11:16,883 INFO L130 PetriNetUnfolder]: 6117/20369 cut-off events. [2022-12-06 04:11:16,883 INFO L131 PetriNetUnfolder]: For 302740/310122 co-relation queries the response was YES. [2022-12-06 04:11:17,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134877 conditions, 20369 events. 6117/20369 cut-off events. For 302740/310122 co-relation queries the response was YES. Maximal size of possible extension queue 1334. Compared 266437 event pairs, 1591 based on Foata normal form. 201/18240 useless extension candidates. Maximal degree in co-relation 131718. Up to 5553 conditions per place. [2022-12-06 04:11:17,321 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 334 places, 2040 transitions, 46584 flow [2022-12-06 04:11:17,322 INFO L188 LiptonReduction]: Number of co-enabled transitions 14296 [2022-12-06 04:11:17,380 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:11:17,381 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5360 [2022-12-06 04:11:17,381 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 2040 transitions, 46584 flow [2022-12-06 04:11:17,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:17,381 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:17,382 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:17,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 04:11:17,382 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:17,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:17,382 INFO L85 PathProgramCache]: Analyzing trace with hash -822314835, now seen corresponding path program 1 times [2022-12-06 04:11:17,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:17,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984021475] [2022-12-06 04:11:17,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:17,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:18,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:11:18,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:18,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984021475] [2022-12-06 04:11:18,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984021475] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:11:18,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335411803] [2022-12-06 04:11:18,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:18,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:11:18,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:11:18,618 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:11:18,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 04:11:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:18,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 83 conjunts are in the unsatisfiable core [2022-12-06 04:11:18,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:11:18,752 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-06 04:11:18,753 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-06 04:11:18,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2022-12-06 04:11:18,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-12-06 04:11:18,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 04:11:18,878 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-06 04:11:19,085 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 79 treesize of output 46 [2022-12-06 04:11:21,113 WARN L859 $PredicateComparison]: unable to prove that (exists ((aux_div_v_arrayElimCell_22_49 Int) (aux_mod_v_arrayElimCell_22_49 Int)) (let ((.cse0 (* aux_div_v_arrayElimCell_22_49 4294967296))) (and (< 0 (+ .cse0 aux_mod_v_arrayElimCell_22_49 4294967297)) (= |c_t2Thread1of1ForFork0_pop_#res#1| (mod (+ 4294967295 (* 4294967295 aux_mod_v_arrayElimCell_22_49)) 4294967296)) (< aux_mod_v_arrayElimCell_22_49 4294967296) (<= (+ .cse0 aux_mod_v_arrayElimCell_22_49 1) 0) (<= 4294966496 aux_mod_v_arrayElimCell_22_49)))) is different from true [2022-12-06 04:11:21,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 04:11:21,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:11:21,336 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:11:21,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2022-12-06 04:11:21,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 58 [2022-12-06 04:11:21,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2022-12-06 04:11:21,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:11:21,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335411803] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:11:21,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:11:21,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2022-12-06 04:11:21,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910495429] [2022-12-06 04:11:21,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:11:21,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 04:11:21,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:21,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 04:11:21,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=224, Unknown=1, NotChecked=30, Total=306 [2022-12-06 04:11:21,384 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 111 [2022-12-06 04:11:21,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 2040 transitions, 46584 flow. Second operand has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:21,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:21,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 111 [2022-12-06 04:11:21,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:12:25,413 INFO L130 PetriNetUnfolder]: 47199/91132 cut-off events. [2022-12-06 04:12:25,414 INFO L131 PetriNetUnfolder]: For 1586216/1586216 co-relation queries the response was YES. [2022-12-06 04:12:27,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 645087 conditions, 91132 events. 47199/91132 cut-off events. For 1586216/1586216 co-relation queries the response was YES. Maximal size of possible extension queue 4150. Compared 993096 event pairs, 14223 based on Foata normal form. 142/91274 useless extension candidates. Maximal degree in co-relation 635159. Up to 39224 conditions per place. [2022-12-06 04:12:27,675 INFO L137 encePairwiseOnDemand]: 52/111 looper letters, 1957 selfloop transitions, 1486 changer transitions 92/3537 dead transitions. [2022-12-06 04:12:27,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 3537 transitions, 79912 flow [2022-12-06 04:12:27,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-12-06 04:12:27,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2022-12-06 04:12:27,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 769 transitions. [2022-12-06 04:12:27,677 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1413862842434271 [2022-12-06 04:12:27,678 INFO L175 Difference]: Start difference. First operand has 334 places, 2040 transitions, 46584 flow. Second operand 49 states and 769 transitions. [2022-12-06 04:12:27,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 3537 transitions, 79912 flow [2022-12-06 04:12:41,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 3537 transitions, 79389 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 04:12:41,234 INFO L231 Difference]: Finished difference. Result has 403 places, 2596 transitions, 65462 flow [2022-12-06 04:12:41,236 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=45473, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2016, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=937, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=879, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=65462, PETRI_PLACES=403, PETRI_TRANSITIONS=2596} [2022-12-06 04:12:41,236 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 361 predicate places. [2022-12-06 04:12:41,236 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:12:41,236 INFO L89 Accepts]: Start accepts. Operand has 403 places, 2596 transitions, 65462 flow [2022-12-06 04:12:41,245 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:12:41,246 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:12:41,246 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 403 places, 2596 transitions, 65462 flow [2022-12-06 04:12:41,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 402 places, 2596 transitions, 65462 flow [2022-12-06 04:12:49,887 INFO L130 PetriNetUnfolder]: 8122/27372 cut-off events. [2022-12-06 04:12:49,887 INFO L131 PetriNetUnfolder]: For 487749/498598 co-relation queries the response was YES. [2022-12-06 04:12:50,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197253 conditions, 27372 events. 8122/27372 cut-off events. For 487749/498598 co-relation queries the response was YES. Maximal size of possible extension queue 1801. Compared 377777 event pairs, 1940 based on Foata normal form. 307/24683 useless extension candidates. Maximal degree in co-relation 195044. Up to 7129 conditions per place. [2022-12-06 04:12:50,951 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 402 places, 2596 transitions, 65462 flow [2022-12-06 04:12:50,952 INFO L188 LiptonReduction]: Number of co-enabled transitions 17902 [2022-12-06 04:12:51,173 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] L991-6-->L945-1: Formula: (let ((.cse1 (select |v_#pthreadsMutex_395| |v_~#m~0.base_184|)) (.cse0 (mod |v_t1Thread1of1ForFork1_~tmp~0#1_93| 4294967296))) (and (= (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))) |v_t1Thread1of1ForFork1_push_#in~x#1_70|) (= |v_t1Thread1of1ForFork1_get_top_#res#1_88| v_~top~0_406) (= v_~top~0_406 |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_295|) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_70| |v_t1Thread1of1ForFork1_push_~stack#1.offset_92|) (= |v_~#arr~0.base_83| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_70|) (not (= |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_92| 0)) (= (select .cse1 |v_~#m~0.offset_184|) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_130| 800) (not (= 800 v_~top~0_406)) (= |v_#pthreadsMutex_394| (store |v_#pthreadsMutex_395| |v_~#m~0.base_184| (store .cse1 |v_~#m~0.offset_184| 1))) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84| |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_92|) (<= |v_t1Thread1of1ForFork1_get_top_#res#1_88| 2147483647) (<= 0 (+ |v_t1Thread1of1ForFork1_get_top_#res#1_88| 2147483648)) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_70| |v_~#arr~0.offset_78|) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84| (ite (< .cse0 800) 1 0)) (= |v_t1Thread1of1ForFork1_#t~nondet40#1_113| |v_t1Thread1of1ForFork1_~tmp~0#1_93|) (= |v_t1Thread1of1ForFork1_push_~x#1_92| |v_t1Thread1of1ForFork1_push_#in~x#1_70|) (= |v_t1Thread1of1ForFork1_push_~stack#1.base_92| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_70|) (= |v_#memory_int_168| (store |v_#memory_int_169| |v_t1Thread1of1ForFork1_push_~stack#1.base_92| (store (select |v_#memory_int_169| |v_t1Thread1of1ForFork1_push_~stack#1.base_92|) (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_88| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_92|) |v_t1Thread1of1ForFork1_push_~x#1_92|))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_395|, ~#arr~0.offset=|v_~#arr~0.offset_78|, ~#m~0.base=|v_~#m~0.base_184|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_130|, ~#m~0.offset=|v_~#m~0.offset_184|, #memory_int=|v_#memory_int_169|, ~top~0=v_~top~0_406, ~#arr~0.base=|v_~#arr~0.base_83|, t1Thread1of1ForFork1_#t~nondet40#1=|v_t1Thread1of1ForFork1_#t~nondet40#1_113|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_394|, ~#arr~0.offset=|v_~#arr~0.offset_78|, t1Thread1of1ForFork1_push_~x#1=|v_t1Thread1of1ForFork1_push_~x#1_92|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_130|, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|, t1Thread1of1ForFork1_push_#t~ret34#1=|v_t1Thread1of1ForFork1_push_#t~ret34#1_112|, t1Thread1of1ForFork1_push_#in~stack#1.base=|v_t1Thread1of1ForFork1_push_#in~stack#1.base_70|, t1Thread1of1ForFork1_push_#in~stack#1.offset=|v_t1Thread1of1ForFork1_push_#in~stack#1.offset_70|, ~top~0=v_~top~0_406, t1Thread1of1ForFork1_push_#in~x#1=|v_t1Thread1of1ForFork1_push_#in~x#1_70|, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_162|, t1Thread1of1ForFork1_get_top_#res#1=|v_t1Thread1of1ForFork1_get_top_#res#1_88|, ~#m~0.base=|v_~#m~0.base_184|, ~#m~0.offset=|v_~#m~0.offset_184|, t1Thread1of1ForFork1_~tmp~0#1=|v_t1Thread1of1ForFork1_~tmp~0#1_93|, #memory_int=|v_#memory_int_168|, t1Thread1of1ForFork1_push_~stack#1.offset=|v_t1Thread1of1ForFork1_push_~stack#1.offset_92|, t1Thread1of1ForFork1_#t~nondet39#1=|v_t1Thread1of1ForFork1_#t~nondet39#1_80|, t1Thread1of1ForFork1_push_~stack#1.base=|v_t1Thread1of1ForFork1_push_~stack#1.base_92|, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_92|, t1Thread1of1ForFork1_push_#t~nondet33#1=|v_t1Thread1of1ForFork1_push_#t~nondet33#1_63|, ~#arr~0.base=|v_~#arr~0.base_83|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_295|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_push_~x#1, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, t1Thread1of1ForFork1_push_#t~ret34#1, t1Thread1of1ForFork1_push_#in~stack#1.base, t1Thread1of1ForFork1_push_#in~stack#1.offset, t1Thread1of1ForFork1_push_#in~x#1, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_#t~nondet40#1, t1Thread1of1ForFork1_get_top_#res#1, t1Thread1of1ForFork1_~tmp~0#1, #memory_int, t1Thread1of1ForFork1_push_~stack#1.offset, t1Thread1of1ForFork1_#t~nondet39#1, t1Thread1of1ForFork1_push_~stack#1.base, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1, t1Thread1of1ForFork1_push_#t~nondet33#1, t1Thread1of1ForFork1_inc_top_#t~post31#1] and [563] L1021-4-->L1022-3: Formula: (and (= |v_#pthreadsForks_26| |v_ULTIMATE.start_main_#t~pre47#1_21|) (= |v_#memory_int_87| (store |v_#memory_int_88| |v_ULTIMATE.start_main_~#id2~0#1.base_21| (store (select |v_#memory_int_88| |v_ULTIMATE.start_main_~#id2~0#1.base_21|) |v_ULTIMATE.start_main_~#id2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre47#1_21|))) (= |v_#pthreadsForks_25| (+ |v_#pthreadsForks_26| 1))) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_26|, #memory_int=|v_#memory_int_88|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~nondet46#1=|v_ULTIMATE.start_main_#t~nondet46#1_15|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_25|, #memory_int=|v_#memory_int_87|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_21|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_21|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre47#1, ULTIMATE.start_main_#t~pre45#1] [2022-12-06 04:12:55,596 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 04:12:55,597 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14361 [2022-12-06 04:12:55,597 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 2591 transitions, 65475 flow [2022-12-06 04:12:55,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:12:55,598 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:12:55,598 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:12:55,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-06 04:12:55,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:12:55,800 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:12:55,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:12:55,800 INFO L85 PathProgramCache]: Analyzing trace with hash -972409946, now seen corresponding path program 1 times [2022-12-06 04:12:55,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:12:55,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723374335] [2022-12-06 04:12:55,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:12:55,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:12:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:12:56,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:12:56,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:12:56,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723374335] [2022-12-06 04:12:56,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723374335] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:12:56,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530413985] [2022-12-06 04:12:56,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:12:56,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:12:56,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:12:56,174 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:12:56,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 04:12:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:12:56,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 72 conjunts are in the unsatisfiable core [2022-12-06 04:12:56,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:12:56,358 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 17 treesize of output 13 [2022-12-06 04:12:56,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 04:12:56,441 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 60 treesize of output 40 [2022-12-06 04:12:56,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 79 treesize of output 46 [2022-12-06 04:12:58,537 WARN L859 $PredicateComparison]: unable to prove that (exists ((aux_mod_v_arrayElimCell_26_49 Int) (aux_div_v_arrayElimCell_26_49 Int)) (let ((.cse0 (* aux_div_v_arrayElimCell_26_49 4294967296))) (and (<= (+ .cse0 aux_mod_v_arrayElimCell_26_49 1) 0) (< 0 (+ .cse0 aux_mod_v_arrayElimCell_26_49 4294967297)) (< aux_mod_v_arrayElimCell_26_49 4294967296) (= |c_t2Thread1of1ForFork0_pop_#res#1| (mod (+ 4294967295 (* 4294967295 aux_mod_v_arrayElimCell_26_49)) 4294967296)) (<= 4294966496 aux_mod_v_arrayElimCell_26_49)))) is different from true [2022-12-06 04:12:58,538 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 04:12:58,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:12:58,625 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:12:58,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530413985] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:12:58,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:12:58,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 16 [2022-12-06 04:12:58,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418530827] [2022-12-06 04:12:58,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:12:58,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 04:12:58,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:12:58,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 04:12:58,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=194, Unknown=1, NotChecked=28, Total=272 [2022-12-06 04:12:58,626 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 123 [2022-12-06 04:12:58,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 2591 transitions, 65475 flow. Second operand has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:12:58,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:12:58,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 123 [2022-12-06 04:12:58,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand