/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack_longest-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:15:29,597 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:15:29,599 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:15:29,625 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:15:29,625 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:15:29,627 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:15:29,630 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:15:29,642 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:15:29,646 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:15:29,650 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:15:29,651 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:15:29,653 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:15:29,653 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:15:29,655 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:15:29,656 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:15:29,658 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:15:29,660 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:15:29,661 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:15:29,664 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:15:29,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:15:29,669 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:15:29,670 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:15:29,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:15:29,672 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:15:29,677 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:15:29,678 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:15:29,678 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:15:29,679 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:15:29,680 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:15:29,680 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:15:29,680 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:15:29,682 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:15:29,683 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:15:29,683 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:15:29,684 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:15:29,684 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:15:29,684 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:15:29,685 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:15:29,685 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:15:29,685 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:15:29,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:15:29,687 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:15:29,719 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:15:29,719 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:15:29,721 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:15:29,721 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:15:29,721 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:15:29,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:15:29,722 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:15:29,722 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:15:29,722 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:15:29,722 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:15:29,723 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:15:29,723 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:15:29,723 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:15:29,723 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:15:29,723 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:15:29,724 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:15:29,724 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:15:29,724 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:15:29,724 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:15:29,724 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:15:29,724 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:15:29,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:15:29,724 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:15:29,725 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:15:29,725 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:15:29,725 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:15:29,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:15:29,725 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:15:29,725 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 06:15:30,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:15:30,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:15:30,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:15:30,062 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:15:30,062 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:15:30,063 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longest-1.i [2022-12-06 06:15:31,192 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:15:31,538 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:15:31,539 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-1.i [2022-12-06 06:15:31,565 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2e9ed103/8b4159b02e0a48dbb28c112f621ae4a2/FLAGbc628cbaf [2022-12-06 06:15:31,580 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2e9ed103/8b4159b02e0a48dbb28c112f621ae4a2 [2022-12-06 06:15:31,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:15:31,584 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:15:31,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:15:31,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:15:31,587 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:15:31,590 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:15:31" (1/1) ... [2022-12-06 06:15:31,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@546b0e00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:31, skipping insertion in model container [2022-12-06 06:15:31,591 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:15:31" (1/1) ... [2022-12-06 06:15:31,596 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:15:31,647 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:15:31,994 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-1.i[41530,41543] [2022-12-06 06:15:32,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:15:32,038 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:15:32,075 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-1.i[41530,41543] [2022-12-06 06:15:32,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:15:32,146 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:15:32,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:32 WrapperNode [2022-12-06 06:15:32,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:15:32,148 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:15:32,148 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:15:32,150 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:15:32,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:32" (1/1) ... [2022-12-06 06:15:32,185 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:32" (1/1) ... [2022-12-06 06:15:32,213 INFO L138 Inliner]: procedures = 277, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 155 [2022-12-06 06:15:32,213 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:15:32,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:15:32,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:15:32,214 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:15:32,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:32" (1/1) ... [2022-12-06 06:15:32,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:32" (1/1) ... [2022-12-06 06:15:32,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:32" (1/1) ... [2022-12-06 06:15:32,238 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:32" (1/1) ... [2022-12-06 06:15:32,243 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:32" (1/1) ... [2022-12-06 06:15:32,246 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:32" (1/1) ... [2022-12-06 06:15:32,247 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:32" (1/1) ... [2022-12-06 06:15:32,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:32" (1/1) ... [2022-12-06 06:15:32,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:15:32,262 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:15:32,262 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:15:32,262 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:15:32,263 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:32" (1/1) ... [2022-12-06 06:15:32,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:15:32,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:15:32,292 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 06:15:32,313 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 06:15:32,329 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-06 06:15:32,329 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-06 06:15:32,330 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-06 06:15:32,330 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-06 06:15:32,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:15:32,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:15:32,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 06:15:32,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:15:32,331 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-06 06:15:32,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:15:32,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:15:32,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:15:32,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:15:32,332 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 06:15:32,498 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:15:32,500 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:15:32,817 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:15:32,826 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:15:32,827 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 06:15:32,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:15:32 BoogieIcfgContainer [2022-12-06 06:15:32,829 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:15:32,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:15:32,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:15:32,834 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:15:32,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:15:31" (1/3) ... [2022-12-06 06:15:32,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d028afc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:15:32, skipping insertion in model container [2022-12-06 06:15:32,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:32" (2/3) ... [2022-12-06 06:15:32,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d028afc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:15:32, skipping insertion in model container [2022-12-06 06:15:32,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:15:32" (3/3) ... [2022-12-06 06:15:32,838 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longest-1.i [2022-12-06 06:15:32,857 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:15:32,857 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:15:32,858 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:15:32,964 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 06:15:32,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 157 transitions, 330 flow [2022-12-06 06:15:33,133 INFO L130 PetriNetUnfolder]: 10/155 cut-off events. [2022-12-06 06:15:33,134 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 06:15:33,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 155 events. 10/155 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 375 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 117. Up to 3 conditions per place. [2022-12-06 06:15:33,141 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 157 transitions, 330 flow [2022-12-06 06:15:33,148 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 146 transitions, 301 flow [2022-12-06 06:15:33,150 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:33,180 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 146 transitions, 301 flow [2022-12-06 06:15:33,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 146 transitions, 301 flow [2022-12-06 06:15:33,224 INFO L130 PetriNetUnfolder]: 10/146 cut-off events. [2022-12-06 06:15:33,224 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 06:15:33,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 146 events. 10/146 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 308 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 117. Up to 3 conditions per place. [2022-12-06 06:15:33,235 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 146 transitions, 301 flow [2022-12-06 06:15:33,237 INFO L188 LiptonReduction]: Number of co-enabled transitions 7212 [2022-12-06 06:15:37,285 INFO L203 LiptonReduction]: Total number of compositions: 119 [2022-12-06 06:15:37,296 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:15:37,301 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;@36e2b101, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:15:37,301 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:15:37,305 INFO L130 PetriNetUnfolder]: 1/21 cut-off events. [2022-12-06 06:15:37,305 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 06:15:37,305 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:37,306 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-06 06:15:37,306 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 06:15:37,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:37,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1682314067, now seen corresponding path program 1 times [2022-12-06 06:15:37,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:37,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841210817] [2022-12-06 06:15:37,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:37,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:37,508 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 06:15:37,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:37,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841210817] [2022-12-06 06:15:37,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841210817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:37,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:37,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:15:37,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411211679] [2022-12-06 06:15:37,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:37,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:15:37,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:37,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:15:37,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:15:37,540 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 42 [2022-12-06 06:15:37,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 06:15:37,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:37,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 42 [2022-12-06 06:15:37,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:37,809 INFO L130 PetriNetUnfolder]: 1116/1910 cut-off events. [2022-12-06 06:15:37,809 INFO L131 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2022-12-06 06:15:37,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3780 conditions, 1910 events. 1116/1910 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9673 event pairs, 336 based on Foata normal form. 0/1378 useless extension candidates. Maximal degree in co-relation 3543. Up to 1047 conditions per place. [2022-12-06 06:15:37,821 INFO L137 encePairwiseOnDemand]: 35/42 looper letters, 62 selfloop transitions, 4 changer transitions 0/70 dead transitions. [2022-12-06 06:15:37,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 70 transitions, 287 flow [2022-12-06 06:15:37,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:15:37,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:15:37,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2022-12-06 06:15:37,832 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6587301587301587 [2022-12-06 06:15:37,833 INFO L175 Difference]: Start difference. First operand has 44 places, 42 transitions, 93 flow. Second operand 3 states and 83 transitions. [2022-12-06 06:15:37,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 70 transitions, 287 flow [2022-12-06 06:15:37,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 70 transitions, 279 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:15:37,840 INFO L231 Difference]: Finished difference. Result has 43 places, 43 transitions, 114 flow [2022-12-06 06:15:37,841 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=43, PETRI_TRANSITIONS=43} [2022-12-06 06:15:37,845 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, -1 predicate places. [2022-12-06 06:15:37,845 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:37,846 INFO L89 Accepts]: Start accepts. Operand has 43 places, 43 transitions, 114 flow [2022-12-06 06:15:37,848 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:37,848 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:37,849 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 43 transitions, 114 flow [2022-12-06 06:15:37,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 43 transitions, 114 flow [2022-12-06 06:15:37,860 INFO L130 PetriNetUnfolder]: 19/120 cut-off events. [2022-12-06 06:15:37,860 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 06:15:37,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 120 events. 19/120 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 473 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 145. Up to 17 conditions per place. [2022-12-06 06:15:37,862 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 43 transitions, 114 flow [2022-12-06 06:15:37,862 INFO L188 LiptonReduction]: Number of co-enabled transitions 832 [2022-12-06 06:15:37,899 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:15:37,904 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-06 06:15:37,904 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 43 transitions, 114 flow [2022-12-06 06:15:37,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 06:15:37,905 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:37,905 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:37,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:15:37,906 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:15:37,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:37,906 INFO L85 PathProgramCache]: Analyzing trace with hash 405438763, now seen corresponding path program 1 times [2022-12-06 06:15:37,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:37,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776214986] [2022-12-06 06:15:37,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:37,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:38,049 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 06:15:38,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:38,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776214986] [2022-12-06 06:15:38,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776214986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:38,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:38,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:15:38,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226724946] [2022-12-06 06:15:38,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:38,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:15:38,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:38,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:15:38,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:15:38,052 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2022-12-06 06:15:38,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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 06:15:38,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:38,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2022-12-06 06:15:38,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:38,197 INFO L130 PetriNetUnfolder]: 989/1750 cut-off events. [2022-12-06 06:15:38,197 INFO L131 PetriNetUnfolder]: For 241/241 co-relation queries the response was YES. [2022-12-06 06:15:38,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3621 conditions, 1750 events. 989/1750 cut-off events. For 241/241 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8945 event pairs, 447 based on Foata normal form. 44/1379 useless extension candidates. Maximal degree in co-relation 3139. Up to 1283 conditions per place. [2022-12-06 06:15:38,204 INFO L137 encePairwiseOnDemand]: 35/40 looper letters, 47 selfloop transitions, 2 changer transitions 5/62 dead transitions. [2022-12-06 06:15:38,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 62 transitions, 267 flow [2022-12-06 06:15:38,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:15:38,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:15:38,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-12-06 06:15:38,205 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2022-12-06 06:15:38,205 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 114 flow. Second operand 3 states and 76 transitions. [2022-12-06 06:15:38,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 62 transitions, 267 flow [2022-12-06 06:15:38,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 62 transitions, 257 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:15:38,207 INFO L231 Difference]: Finished difference. Result has 44 places, 44 transitions, 124 flow [2022-12-06 06:15:38,207 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=44, PETRI_TRANSITIONS=44} [2022-12-06 06:15:38,208 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2022-12-06 06:15:38,208 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:38,208 INFO L89 Accepts]: Start accepts. Operand has 44 places, 44 transitions, 124 flow [2022-12-06 06:15:38,209 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:38,209 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:38,209 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 44 transitions, 124 flow [2022-12-06 06:15:38,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 44 transitions, 124 flow [2022-12-06 06:15:38,215 INFO L130 PetriNetUnfolder]: 26/109 cut-off events. [2022-12-06 06:15:38,215 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2022-12-06 06:15:38,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 109 events. 26/109 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 339 event pairs, 1 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 147. Up to 25 conditions per place. [2022-12-06 06:15:38,216 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 44 transitions, 124 flow [2022-12-06 06:15:38,216 INFO L188 LiptonReduction]: Number of co-enabled transitions 816 [2022-12-06 06:15:38,228 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:15:38,229 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 06:15:38,229 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 44 transitions, 124 flow [2022-12-06 06:15:38,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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 06:15:38,229 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:38,229 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:38,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:15:38,230 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 06:15:38,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:38,230 INFO L85 PathProgramCache]: Analyzing trace with hash -652865259, now seen corresponding path program 1 times [2022-12-06 06:15:38,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:38,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374541211] [2022-12-06 06:15:38,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:38,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:38,288 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 06:15:38,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:38,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374541211] [2022-12-06 06:15:38,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374541211] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:38,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:38,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:15:38,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933957538] [2022-12-06 06:15:38,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:38,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:15:38,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:38,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:15:38,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:15:38,290 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2022-12-06 06:15:38,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 44 transitions, 124 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 06:15:38,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:38,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2022-12-06 06:15:38,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:38,524 INFO L130 PetriNetUnfolder]: 1576/2742 cut-off events. [2022-12-06 06:15:38,524 INFO L131 PetriNetUnfolder]: For 285/287 co-relation queries the response was YES. [2022-12-06 06:15:38,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5885 conditions, 2742 events. 1576/2742 cut-off events. For 285/287 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 15660 event pairs, 802 based on Foata normal form. 2/2069 useless extension candidates. Maximal degree in co-relation 5328. Up to 1672 conditions per place. [2022-12-06 06:15:38,536 INFO L137 encePairwiseOnDemand]: 37/40 looper letters, 60 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2022-12-06 06:15:38,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 70 transitions, 319 flow [2022-12-06 06:15:38,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:15:38,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:15:38,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-12-06 06:15:38,539 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.65 [2022-12-06 06:15:38,539 INFO L175 Difference]: Start difference. First operand has 44 places, 44 transitions, 124 flow. Second operand 3 states and 78 transitions. [2022-12-06 06:15:38,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 70 transitions, 319 flow [2022-12-06 06:15:38,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 70 transitions, 317 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:15:38,541 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 137 flow [2022-12-06 06:15:38,542 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2022-12-06 06:15:38,543 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2022-12-06 06:15:38,543 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:38,543 INFO L89 Accepts]: Start accepts. Operand has 46 places, 45 transitions, 137 flow [2022-12-06 06:15:38,544 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:38,544 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:38,544 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 45 transitions, 137 flow [2022-12-06 06:15:38,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 45 transitions, 137 flow [2022-12-06 06:15:38,555 INFO L130 PetriNetUnfolder]: 46/186 cut-off events. [2022-12-06 06:15:38,556 INFO L131 PetriNetUnfolder]: For 24/28 co-relation queries the response was YES. [2022-12-06 06:15:38,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 186 events. 46/186 cut-off events. For 24/28 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 792 event pairs, 7 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 267. Up to 49 conditions per place. [2022-12-06 06:15:38,557 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 45 transitions, 137 flow [2022-12-06 06:15:38,557 INFO L188 LiptonReduction]: Number of co-enabled transitions 860 [2022-12-06 06:15:38,565 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:15:38,567 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 06:15:38,567 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 137 flow [2022-12-06 06:15:38,567 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 06:15:38,567 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:38,567 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:38,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:15:38,567 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:15:38,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:38,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1354961207, now seen corresponding path program 1 times [2022-12-06 06:15:38,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:38,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014525826] [2022-12-06 06:15:38,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:38,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:38,657 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 06:15:38,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:38,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014525826] [2022-12-06 06:15:38,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014525826] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:15:38,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033981274] [2022-12-06 06:15:38,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:38,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:15:38,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:15:38,662 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 06:15:38,672 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 06:15:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:38,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 06:15:38,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:15:38,775 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 06:15:38,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:15:38,803 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 06:15:38,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033981274] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:15:38,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:15:38,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-06 06:15:38,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683983349] [2022-12-06 06:15:38,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:15:38,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 06:15:38,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:38,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 06:15:38,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-06 06:15:38,805 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 40 [2022-12-06 06:15:38,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 137 flow. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 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 06:15:38,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:38,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 40 [2022-12-06 06:15:38,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:39,471 INFO L130 PetriNetUnfolder]: 2809/4837 cut-off events. [2022-12-06 06:15:39,472 INFO L131 PetriNetUnfolder]: For 1383/1383 co-relation queries the response was YES. [2022-12-06 06:15:39,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11062 conditions, 4837 events. 2809/4837 cut-off events. For 1383/1383 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 27521 event pairs, 691 based on Foata normal form. 56/3953 useless extension candidates. Maximal degree in co-relation 10240. Up to 1474 conditions per place. [2022-12-06 06:15:39,493 INFO L137 encePairwiseOnDemand]: 34/40 looper letters, 187 selfloop transitions, 22 changer transitions 0/213 dead transitions. [2022-12-06 06:15:39,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 213 transitions, 1027 flow [2022-12-06 06:15:39,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 06:15:39,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 06:15:39,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 248 transitions. [2022-12-06 06:15:39,498 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.62 [2022-12-06 06:15:39,498 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 137 flow. Second operand 10 states and 248 transitions. [2022-12-06 06:15:39,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 213 transitions, 1027 flow [2022-12-06 06:15:39,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 213 transitions, 1015 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:15:39,506 INFO L231 Difference]: Finished difference. Result has 58 places, 63 transitions, 306 flow [2022-12-06 06:15:39,506 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=306, PETRI_PLACES=58, PETRI_TRANSITIONS=63} [2022-12-06 06:15:39,508 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places. [2022-12-06 06:15:39,508 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:39,508 INFO L89 Accepts]: Start accepts. Operand has 58 places, 63 transitions, 306 flow [2022-12-06 06:15:39,510 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:39,510 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:39,510 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 63 transitions, 306 flow [2022-12-06 06:15:39,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 63 transitions, 306 flow [2022-12-06 06:15:39,540 INFO L130 PetriNetUnfolder]: 111/456 cut-off events. [2022-12-06 06:15:39,540 INFO L131 PetriNetUnfolder]: For 307/339 co-relation queries the response was YES. [2022-12-06 06:15:39,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 868 conditions, 456 events. 111/456 cut-off events. For 307/339 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2680 event pairs, 7 based on Foata normal form. 2/328 useless extension candidates. Maximal degree in co-relation 849. Up to 109 conditions per place. [2022-12-06 06:15:39,544 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 63 transitions, 306 flow [2022-12-06 06:15:39,544 INFO L188 LiptonReduction]: Number of co-enabled transitions 1222 [2022-12-06 06:15:39,557 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [409] 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 [609] L1008-1-->pop_returnLabel#1: Formula: (and (= |v_~#arr~0.offset_46| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_29|) (= |v_t2Thread1of1ForFork0_get_top_#res#1_61| 0) (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_39| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_29|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_29| |v_t2Thread1of1ForFork0_pop_~stack#1.base_39|) (not (= (mod v_~flag~0_72 256) 0)) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_29| |v_~#arr~0.base_49|) (= (+ 2 |v_t2Thread1of1ForFork0_pop_#res#1_49|) 0) (= |v_t2Thread1of1ForFork0_get_top_#res#1_61| v_~top~0_110)) InVars {~#arr~0.offset=|v_~#arr~0.offset_46|, ~flag~0=v_~flag~0_72, ~top~0=v_~top~0_110, ~#arr~0.base=|v_~#arr~0.base_49|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_46|, t2Thread1of1ForFork0_pop_#t~ret35#1=|v_t2Thread1of1ForFork0_pop_#t~ret35#1_59|, t2Thread1of1ForFork0_get_top_#res#1=|v_t2Thread1of1ForFork0_get_top_#res#1_61|, ~flag~0=v_~flag~0_72, t2Thread1of1ForFork0_pop_#t~nondet36#1=|v_t2Thread1of1ForFork0_pop_#t~nondet36#1_27|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_49|, ~top~0=v_~top~0_110, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_39|, t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_39|, t2Thread1of1ForFork0_pop_#t~mem38#1=|v_t2Thread1of1ForFork0_pop_#t~mem38#1_41|, t2Thread1of1ForFork0_#t~nondet44#1=|v_t2Thread1of1ForFork0_#t~nondet44#1_65|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_29|, t2Thread1of1ForFork0_pop_#t~ret37#1=|v_t2Thread1of1ForFork0_pop_#t~ret37#1_45|, ~#arr~0.base=|v_~#arr~0.base_49|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_29|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem38#1, t2Thread1of1ForFork0_pop_#t~ret35#1, t2Thread1of1ForFork0_get_top_#res#1, t2Thread1of1ForFork0_#t~nondet44#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#t~ret37#1, t2Thread1of1ForFork0_pop_#t~nondet36#1, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base] [2022-12-06 06:15:39,612 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [409] 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 [450] L949-1-->L949-2: Formula: (= |v_t2Thread1of1ForFork0_dec_top_#t~post32#1_5| (+ 1 v_~top~0_9)) InVars {t2Thread1of1ForFork0_dec_top_#t~post32#1=|v_t2Thread1of1ForFork0_dec_top_#t~post32#1_5|} OutVars{t2Thread1of1ForFork0_dec_top_#t~post32#1=|v_t2Thread1of1ForFork0_dec_top_#t~post32#1_5|, ~top~0=v_~top~0_9} AuxVars[] AssignedVars[~top~0] [2022-12-06 06:15:39,634 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:15:39,636 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-06 06:15:39,636 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 62 transitions, 310 flow [2022-12-06 06:15:39,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 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 06:15:39,636 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:39,636 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:39,645 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 06:15:39,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:15:39,843 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 06:15:39,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:39,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1119306924, now seen corresponding path program 1 times [2022-12-06 06:15:39,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:39,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111258828] [2022-12-06 06:15:39,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:39,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:39,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:39,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:39,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111258828] [2022-12-06 06:15:39,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111258828] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:39,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:39,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:15:39,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837186009] [2022-12-06 06:15:39,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:39,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:15:39,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:39,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:15:39,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:15:39,918 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2022-12-06 06:15:39,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 62 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:39,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:39,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2022-12-06 06:15:39,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:40,047 INFO L130 PetriNetUnfolder]: 832/1687 cut-off events. [2022-12-06 06:15:40,048 INFO L131 PetriNetUnfolder]: For 705/705 co-relation queries the response was YES. [2022-12-06 06:15:40,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3874 conditions, 1687 events. 832/1687 cut-off events. For 705/705 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 8810 event pairs, 126 based on Foata normal form. 88/1567 useless extension candidates. Maximal degree in co-relation 2550. Up to 1152 conditions per place. [2022-12-06 06:15:40,068 INFO L137 encePairwiseOnDemand]: 36/43 looper letters, 39 selfloop transitions, 7 changer transitions 4/61 dead transitions. [2022-12-06 06:15:40,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 61 transitions, 343 flow [2022-12-06 06:15:40,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:15:40,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:15:40,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-12-06 06:15:40,069 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5271317829457365 [2022-12-06 06:15:40,069 INFO L175 Difference]: Start difference. First operand has 57 places, 62 transitions, 310 flow. Second operand 3 states and 68 transitions. [2022-12-06 06:15:40,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 61 transitions, 343 flow [2022-12-06 06:15:40,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 61 transitions, 331 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-06 06:15:40,072 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 214 flow [2022-12-06 06:15:40,072 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2022-12-06 06:15:40,073 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 11 predicate places. [2022-12-06 06:15:40,073 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:40,073 INFO L89 Accepts]: Start accepts. Operand has 55 places, 48 transitions, 214 flow [2022-12-06 06:15:40,073 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:40,074 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:40,074 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 48 transitions, 214 flow [2022-12-06 06:15:40,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 48 transitions, 214 flow [2022-12-06 06:15:40,084 INFO L130 PetriNetUnfolder]: 30/191 cut-off events. [2022-12-06 06:15:40,084 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-12-06 06:15:40,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 191 events. 30/191 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 749 event pairs, 1 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 342. Up to 33 conditions per place. [2022-12-06 06:15:40,085 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 48 transitions, 214 flow [2022-12-06 06:15:40,086 INFO L188 LiptonReduction]: Number of co-enabled transitions 444 [2022-12-06 06:15:40,904 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 06:15:40,905 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 832 [2022-12-06 06:15:40,905 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 210 flow [2022-12-06 06:15:40,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:40,905 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:40,905 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:40,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:15:40,905 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 06:15:40,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:40,906 INFO L85 PathProgramCache]: Analyzing trace with hash 524626414, now seen corresponding path program 1 times [2022-12-06 06:15:40,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:40,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227880104] [2022-12-06 06:15:40,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:40,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:40,971 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 06:15:40,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:40,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227880104] [2022-12-06 06:15:40,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227880104] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:40,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:40,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:15:40,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713891953] [2022-12-06 06:15:40,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:40,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:15:40,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:40,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:15:40,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:15:40,974 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2022-12-06 06:15:40,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 210 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:40,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:40,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2022-12-06 06:15:40,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:41,146 INFO L130 PetriNetUnfolder]: 622/1213 cut-off events. [2022-12-06 06:15:41,146 INFO L131 PetriNetUnfolder]: For 684/684 co-relation queries the response was YES. [2022-12-06 06:15:41,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3148 conditions, 1213 events. 622/1213 cut-off events. For 684/684 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5601 event pairs, 161 based on Foata normal form. 30/1193 useless extension candidates. Maximal degree in co-relation 2490. Up to 497 conditions per place. [2022-12-06 06:15:41,152 INFO L137 encePairwiseOnDemand]: 26/37 looper letters, 64 selfloop transitions, 10 changer transitions 1/79 dead transitions. [2022-12-06 06:15:41,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 79 transitions, 471 flow [2022-12-06 06:15:41,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:15:41,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:15:41,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2022-12-06 06:15:41,162 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5081081081081081 [2022-12-06 06:15:41,162 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 210 flow. Second operand 5 states and 94 transitions. [2022-12-06 06:15:41,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 79 transitions, 471 flow [2022-12-06 06:15:41,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 79 transitions, 453 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 06:15:41,165 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 239 flow [2022-12-06 06:15:41,165 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=239, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-06 06:15:41,166 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2022-12-06 06:15:41,166 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:41,166 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 239 flow [2022-12-06 06:15:41,166 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:41,166 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:41,166 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 239 flow [2022-12-06 06:15:41,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 42 transitions, 239 flow [2022-12-06 06:15:41,177 INFO L130 PetriNetUnfolder]: 30/167 cut-off events. [2022-12-06 06:15:41,178 INFO L131 PetriNetUnfolder]: For 169/169 co-relation queries the response was YES. [2022-12-06 06:15:41,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 167 events. 30/167 cut-off events. For 169/169 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 651 event pairs, 1 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 333. Up to 25 conditions per place. [2022-12-06 06:15:41,179 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 42 transitions, 239 flow [2022-12-06 06:15:41,179 INFO L188 LiptonReduction]: Number of co-enabled transitions 382 [2022-12-06 06:15:41,703 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [588] L945-1-->push_returnLabel#1: Formula: (and (= |v_t1Thread1of1ForFork1_push_#res#1_25| 0) (= v_~top~0_71 (+ 1 |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_42|))) InVars {t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_42|} OutVars{~top~0=v_~top~0_71, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_25|} AuxVars[] AssignedVars[~top~0, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_inc_top_#t~post31#1] and [614] L991-6-->L959-1: Formula: (let ((.cse1 (mod |v_t1Thread1of1ForFork1_~tmp~0#1_Out_8| 4294967296)) (.cse0 (select |v_#pthreadsMutex_In_9| |v_~#m~0.base_In_13|))) (and (= (select .cse0 |v_~#m~0.offset_In_13|) 0) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_8| (ite (< .cse1 800) 1 0)) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_Out_8| |v_t1Thread1of1ForFork1_push_~stack#1.offset_Out_8|) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.base_Out_8| |v_t1Thread1of1ForFork1_push_~stack#1.base_Out_8|) (= (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) |v_t1Thread1of1ForFork1_push_#in~x#1_Out_8|) (not (= |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_8| 0)) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_8| |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_8|) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.base_Out_8| |v_~#arr~0.base_In_5|) (= (store |v_#pthreadsMutex_In_9| |v_~#m~0.base_In_13| (store .cse0 |v_~#m~0.offset_In_13| 1)) |v_#pthreadsMutex_Out_20|) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_Out_8| |v_~#arr~0.offset_In_4|) (< |v_t1Thread1of1ForFork1_~i~0#1_In_2| 800) (= |v_t1Thread1of1ForFork1_#t~nondet41#1_In_3| |v_t1Thread1of1ForFork1_~tmp~0#1_Out_8|))) InVars {~#arr~0.offset=|v_~#arr~0.offset_In_4|, #pthreadsMutex=|v_#pthreadsMutex_In_9|, ~#m~0.base=|v_~#m~0.base_In_13|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_In_2|, ~#m~0.offset=|v_~#m~0.offset_In_13|, ~#arr~0.base=|v_~#arr~0.base_In_5|, t1Thread1of1ForFork1_#t~nondet41#1=|v_t1Thread1of1ForFork1_#t~nondet41#1_In_3|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_Out_20|, ~#arr~0.offset=|v_~#arr~0.offset_In_4|, t1Thread1of1ForFork1_push_~x#1=|v_t1Thread1of1ForFork1_push_~x#1_Out_6|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_In_2|, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_8|, t1Thread1of1ForFork1_push_#in~stack#1.base=|v_t1Thread1of1ForFork1_push_#in~stack#1.base_Out_8|, t1Thread1of1ForFork1_push_#in~stack#1.offset=|v_t1Thread1of1ForFork1_push_#in~stack#1.offset_Out_8|, t1Thread1of1ForFork1_push_#t~ret34#1=|v_t1Thread1of1ForFork1_push_#t~ret34#1_Out_8|, t1Thread1of1ForFork1_push_#in~x#1=|v_t1Thread1of1ForFork1_push_#in~x#1_Out_8|, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_Out_12|, t1Thread1of1ForFork1_#t~nondet40#1=|v_t1Thread1of1ForFork1_#t~nondet40#1_Out_6|, ~#m~0.base=|v_~#m~0.base_In_13|, ~#m~0.offset=|v_~#m~0.offset_In_13|, t1Thread1of1ForFork1_~tmp~0#1=|v_t1Thread1of1ForFork1_~tmp~0#1_Out_8|, t1Thread1of1ForFork1_push_~stack#1.offset=|v_t1Thread1of1ForFork1_push_~stack#1.offset_Out_8|, t1Thread1of1ForFork1_push_~stack#1.base=|v_t1Thread1of1ForFork1_push_~stack#1.base_Out_8|, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_8|, t1Thread1of1ForFork1_push_#t~nondet33#1=|v_t1Thread1of1ForFork1_push_#t~nondet33#1_Out_10|, ~#arr~0.base=|v_~#arr~0.base_In_5|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_push_~x#1, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, t1Thread1of1ForFork1_push_#in~stack#1.base, t1Thread1of1ForFork1_push_#in~stack#1.offset, t1Thread1of1ForFork1_push_#t~ret34#1, t1Thread1of1ForFork1_push_#in~x#1, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_#t~nondet40#1, t1Thread1of1ForFork1_~tmp~0#1, t1Thread1of1ForFork1_push_~stack#1.offset, t1Thread1of1ForFork1_push_~stack#1.base, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1, t1Thread1of1ForFork1_push_#t~nondet33#1, t1Thread1of1ForFork1_#t~nondet41#1] [2022-12-06 06:15:41,793 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:15:41,794 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 628 [2022-12-06 06:15:41,794 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 251 flow [2022-12-06 06:15:41,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:41,794 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:41,794 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:41,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:15:41,794 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 06:15:41,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:41,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1315229543, now seen corresponding path program 1 times [2022-12-06 06:15:41,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:41,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859437319] [2022-12-06 06:15:41,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:41,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:42,253 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 06:15:42,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:42,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859437319] [2022-12-06 06:15:42,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859437319] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:42,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:42,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:15:42,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711763309] [2022-12-06 06:15:42,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:42,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:15:42,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:42,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:15:42,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:15:42,256 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-06 06:15:42,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 251 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:42,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:42,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-06 06:15:42,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:42,576 INFO L130 PetriNetUnfolder]: 994/1925 cut-off events. [2022-12-06 06:15:42,577 INFO L131 PetriNetUnfolder]: For 2458/2458 co-relation queries the response was YES. [2022-12-06 06:15:42,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5225 conditions, 1925 events. 994/1925 cut-off events. For 2458/2458 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 10759 event pairs, 351 based on Foata normal form. 0/1743 useless extension candidates. Maximal degree in co-relation 2958. Up to 934 conditions per place. [2022-12-06 06:15:42,586 INFO L137 encePairwiseOnDemand]: 26/36 looper letters, 89 selfloop transitions, 11 changer transitions 12/117 dead transitions. [2022-12-06 06:15:42,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 117 transitions, 819 flow [2022-12-06 06:15:42,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:15:42,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:15:42,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2022-12-06 06:15:42,587 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-06 06:15:42,588 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 251 flow. Second operand 7 states and 132 transitions. [2022-12-06 06:15:42,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 117 transitions, 819 flow [2022-12-06 06:15:42,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 117 transitions, 799 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 06:15:42,594 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 348 flow [2022-12-06 06:15:42,594 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=348, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2022-12-06 06:15:42,595 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places. [2022-12-06 06:15:42,595 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:42,595 INFO L89 Accepts]: Start accepts. Operand has 58 places, 49 transitions, 348 flow [2022-12-06 06:15:42,596 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:42,596 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:42,596 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 49 transitions, 348 flow [2022-12-06 06:15:42,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 49 transitions, 348 flow [2022-12-06 06:15:42,613 INFO L130 PetriNetUnfolder]: 59/283 cut-off events. [2022-12-06 06:15:42,613 INFO L131 PetriNetUnfolder]: For 471/472 co-relation queries the response was YES. [2022-12-06 06:15:42,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 283 events. 59/283 cut-off events. For 471/472 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1520 event pairs, 1 based on Foata normal form. 1/236 useless extension candidates. Maximal degree in co-relation 578. Up to 45 conditions per place. [2022-12-06 06:15:42,617 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 49 transitions, 348 flow [2022-12-06 06:15:42,618 INFO L188 LiptonReduction]: Number of co-enabled transitions 440 [2022-12-06 06:15:43,351 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:15:43,351 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 756 [2022-12-06 06:15:43,352 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 356 flow [2022-12-06 06:15:43,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:43,352 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:43,352 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:43,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:15:43,352 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:15:43,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:43,352 INFO L85 PathProgramCache]: Analyzing trace with hash 826278057, now seen corresponding path program 1 times [2022-12-06 06:15:43,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:43,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744401443] [2022-12-06 06:15:43,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:43,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:43,712 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 06:15:43,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:43,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744401443] [2022-12-06 06:15:43,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744401443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:43,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:43,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:15:43,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412536181] [2022-12-06 06:15:43,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:43,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:15:43,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:43,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:15:43,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:15:43,714 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2022-12-06 06:15:43,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 356 flow. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:43,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:43,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2022-12-06 06:15:43,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:44,033 INFO L130 PetriNetUnfolder]: 1075/2052 cut-off events. [2022-12-06 06:15:44,033 INFO L131 PetriNetUnfolder]: For 4527/4527 co-relation queries the response was YES. [2022-12-06 06:15:44,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6158 conditions, 2052 events. 1075/2052 cut-off events. For 4527/4527 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 11517 event pairs, 289 based on Foata normal form. 12/2064 useless extension candidates. Maximal degree in co-relation 4164. Up to 699 conditions per place. [2022-12-06 06:15:44,046 INFO L137 encePairwiseOnDemand]: 25/37 looper letters, 82 selfloop transitions, 16 changer transitions 4/107 dead transitions. [2022-12-06 06:15:44,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 107 transitions, 884 flow [2022-12-06 06:15:44,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:15:44,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:15:44,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2022-12-06 06:15:44,048 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2022-12-06 06:15:44,048 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 356 flow. Second operand 6 states and 114 transitions. [2022-12-06 06:15:44,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 107 transitions, 884 flow [2022-12-06 06:15:44,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 107 transitions, 870 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-12-06 06:15:44,055 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 487 flow [2022-12-06 06:15:44,055 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=487, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2022-12-06 06:15:44,056 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places. [2022-12-06 06:15:44,056 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:44,056 INFO L89 Accepts]: Start accepts. Operand has 63 places, 54 transitions, 487 flow [2022-12-06 06:15:44,057 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:44,057 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:44,057 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 54 transitions, 487 flow [2022-12-06 06:15:44,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 54 transitions, 487 flow [2022-12-06 06:15:44,077 INFO L130 PetriNetUnfolder]: 77/315 cut-off events. [2022-12-06 06:15:44,077 INFO L131 PetriNetUnfolder]: For 1000/1006 co-relation queries the response was YES. [2022-12-06 06:15:44,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 906 conditions, 315 events. 77/315 cut-off events. For 1000/1006 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1704 event pairs, 1 based on Foata normal form. 3/286 useless extension candidates. Maximal degree in co-relation 609. Up to 56 conditions per place. [2022-12-06 06:15:44,080 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 54 transitions, 487 flow [2022-12-06 06:15:44,080 INFO L188 LiptonReduction]: Number of co-enabled transitions 482 [2022-12-06 06:15:44,081 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:15:44,081 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 06:15:44,081 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 487 flow [2022-12-06 06:15:44,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:44,082 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:44,082 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:44,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:15:44,082 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 06:15:44,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:44,082 INFO L85 PathProgramCache]: Analyzing trace with hash -2092436881, now seen corresponding path program 1 times [2022-12-06 06:15:44,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:44,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470974147] [2022-12-06 06:15:44,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:44,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:44,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:15:44,103 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:15:44,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:15:44,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:15:44,132 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:15:44,133 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 06:15:44,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2022-12-06 06:15:44,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 06:15:44,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-12-06 06:15:44,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-12-06 06:15:44,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 06:15:44,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:15:44,135 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:44,139 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:15:44,139 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:15:44,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:15:44 BasicIcfg [2022-12-06 06:15:44,169 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:15:44,170 INFO L158 Benchmark]: Toolchain (without parser) took 12586.39ms. Allocated memory was 172.0MB in the beginning and 364.9MB in the end (delta: 192.9MB). Free memory was 147.6MB in the beginning and 152.1MB in the end (delta: -4.5MB). Peak memory consumption was 189.7MB. Max. memory is 8.0GB. [2022-12-06 06:15:44,170 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 172.0MB. Free memory is still 149.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:15:44,170 INFO L158 Benchmark]: CACSL2BoogieTranslator took 563.02ms. Allocated memory is still 172.0MB. Free memory was 147.6MB in the beginning and 118.5MB in the end (delta: 29.1MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-06 06:15:44,170 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.17ms. Allocated memory is still 172.0MB. Free memory was 118.5MB in the beginning and 115.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:15:44,170 INFO L158 Benchmark]: Boogie Preprocessor took 36.34ms. Allocated memory is still 172.0MB. Free memory was 115.8MB in the beginning and 113.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:15:44,171 INFO L158 Benchmark]: RCFGBuilder took 567.80ms. Allocated memory is still 172.0MB. Free memory was 113.7MB in the beginning and 96.4MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-06 06:15:44,171 INFO L158 Benchmark]: TraceAbstraction took 11338.11ms. Allocated memory was 172.0MB in the beginning and 364.9MB in the end (delta: 192.9MB). Free memory was 95.9MB in the beginning and 152.1MB in the end (delta: -56.2MB). Peak memory consumption was 138.3MB. Max. memory is 8.0GB. [2022-12-06 06:15:44,172 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 172.0MB. Free memory is still 149.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 563.02ms. Allocated memory is still 172.0MB. Free memory was 147.6MB in the beginning and 118.5MB in the end (delta: 29.1MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.17ms. Allocated memory is still 172.0MB. Free memory was 118.5MB in the beginning and 115.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.34ms. Allocated memory is still 172.0MB. Free memory was 115.8MB in the beginning and 113.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 567.80ms. Allocated memory is still 172.0MB. Free memory was 113.7MB in the beginning and 96.4MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 11338.11ms. Allocated memory was 172.0MB in the beginning and 364.9MB in the end (delta: 192.9MB). Free memory was 95.9MB in the beginning and 152.1MB in the end (delta: -56.2MB). Peak memory consumption was 138.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 143 PlacesBefore, 44 PlacesAfterwards, 146 TransitionsBefore, 42 TransitionsAfterwards, 7212 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 26 TrivialYvCompositions, 83 ConcurrentYvCompositions, 5 ChoiceCompositions, 119 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5273, independent: 5194, independent conditional: 5194, independent unconditional: 0, dependent: 79, dependent conditional: 79, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5273, independent: 5194, independent conditional: 0, independent unconditional: 5194, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5273, independent: 5194, independent conditional: 0, independent unconditional: 5194, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5273, independent: 5194, independent conditional: 0, independent unconditional: 5194, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4480, independent: 4432, independent conditional: 0, independent unconditional: 4432, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4480, independent: 4414, independent conditional: 0, independent unconditional: 4414, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 66, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 98, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5273, independent: 762, independent conditional: 0, independent unconditional: 762, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 4480, unknown conditional: 0, unknown unconditional: 4480] , Statistics on independence cache: Total cache size (in pairs): 7918, Positive cache size: 7870, Positive conditional cache size: 0, Positive unconditional cache size: 7870, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 832 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 124, independent: 101, independent conditional: 101, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 124, independent: 101, independent conditional: 6, independent unconditional: 95, dependent: 23, dependent conditional: 6, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 124, independent: 101, independent conditional: 1, independent unconditional: 100, dependent: 23, dependent conditional: 6, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 124, independent: 101, independent conditional: 1, independent unconditional: 100, dependent: 23, dependent conditional: 6, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 93, independent: 75, independent conditional: 1, independent unconditional: 74, dependent: 18, dependent conditional: 5, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 93, independent: 69, independent conditional: 0, independent unconditional: 69, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 24, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 18, dependent conditional: 5, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 21, dependent conditional: 3, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 124, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 93, unknown conditional: 6, unknown unconditional: 87] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 75, Positive conditional cache size: 1, Positive unconditional cache size: 74, Negative cache size: 18, Negative conditional cache size: 5, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 816 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 133, independent: 117, independent conditional: 117, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 133, independent: 117, independent conditional: 0, independent unconditional: 117, dependent: 16, dependent conditional: 1, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 133, independent: 117, independent conditional: 0, independent unconditional: 117, dependent: 16, dependent conditional: 1, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 133, independent: 117, independent conditional: 0, independent unconditional: 117, dependent: 16, dependent conditional: 1, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 70, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 70, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 133, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 70, unknown conditional: 1, unknown unconditional: 69] , Statistics on independence cache: Total cache size (in pairs): 163, Positive cache size: 138, Positive conditional cache size: 1, Positive unconditional cache size: 137, Negative cache size: 25, Negative conditional cache size: 6, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 860 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 136, independent: 121, independent conditional: 121, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 136, independent: 121, independent conditional: 8, independent unconditional: 113, dependent: 15, dependent conditional: 3, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 136, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 15, dependent conditional: 1, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 136, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 15, dependent conditional: 1, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 23, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 136, independent: 100, independent conditional: 0, independent unconditional: 100, dependent: 13, dependent conditional: 1, dependent unconditional: 12, unknown: 23, unknown conditional: 0, unknown unconditional: 23] , Statistics on independence cache: Total cache size (in pairs): 186, Positive cache size: 159, Positive conditional cache size: 1, Positive unconditional cache size: 158, Negative cache size: 27, Negative conditional cache size: 6, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 58 PlacesBefore, 57 PlacesAfterwards, 63 TransitionsBefore, 62 TransitionsAfterwards, 1222 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 365, independent: 340, independent conditional: 340, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 365, independent: 340, independent conditional: 122, independent unconditional: 218, dependent: 25, dependent conditional: 19, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 365, independent: 340, independent conditional: 88, independent unconditional: 252, dependent: 25, dependent conditional: 15, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 365, independent: 340, independent conditional: 88, independent unconditional: 252, dependent: 25, dependent conditional: 15, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 69, independent: 62, independent conditional: 20, independent unconditional: 42, dependent: 7, dependent conditional: 6, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 69, independent: 62, independent conditional: 0, independent unconditional: 62, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 6, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 6, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 365, independent: 278, independent conditional: 68, independent unconditional: 210, dependent: 18, dependent conditional: 9, dependent unconditional: 9, unknown: 69, unknown conditional: 26, unknown unconditional: 43] , Statistics on independence cache: Total cache size (in pairs): 256, Positive cache size: 222, Positive conditional cache size: 21, Positive unconditional cache size: 201, Negative cache size: 34, Negative conditional cache size: 12, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 38, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 51 PlacesBefore, 45 PlacesAfterwards, 48 TransitionsBefore, 42 TransitionsAfterwards, 444 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 101, independent: 101, independent conditional: 101, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 101, independent: 101, independent conditional: 30, independent unconditional: 71, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 101, independent: 101, independent conditional: 20, independent unconditional: 81, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 101, independent: 101, independent conditional: 20, independent unconditional: 81, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 39, independent: 39, independent conditional: 20, independent unconditional: 19, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 39, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 101, independent: 62, independent conditional: 0, independent unconditional: 62, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 39, unknown conditional: 20, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 391, Positive cache size: 357, Positive conditional cache size: 43, Positive unconditional cache size: 314, Negative cache size: 34, Negative conditional cache size: 12, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 51 PlacesBefore, 50 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 382 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 12, independent unconditional: 28, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 414, Positive cache size: 380, Positive conditional cache size: 43, Positive unconditional cache size: 337, Negative cache size: 34, Negative conditional cache size: 12, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 56 PlacesBefore, 55 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 440 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 48, independent: 48, independent conditional: 6, independent unconditional: 42, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 48, independent conditional: 6, independent unconditional: 42, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 48, independent conditional: 6, independent unconditional: 42, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, independent: 48, independent conditional: 6, independent unconditional: 42, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 442, Positive cache size: 408, Positive conditional cache size: 43, Positive unconditional cache size: 365, Negative cache size: 34, Negative conditional cache size: 12, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 482 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 442, Positive cache size: 408, Positive conditional cache size: 43, Positive unconditional cache size: 365, Negative cache size: 34, Negative conditional cache size: 12, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 941]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(800)]; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1020] 0 pthread_t id1, id2; [L1022] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1={7:0}, id2={5:0}, m={4:0}, pthread_create(&id1, ((void *)0), t1, ((void *)0))=-3, top=0] [L989] 1 int i; [L990] 1 unsigned int tmp; [L991] 1 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1023] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1={7:0}, id2={5:0}, m={4:0}, pthread_create(&id2, ((void *)0), t2, ((void *)0))=-2, top=0] [L1005] 2 int i; [L1006] 2 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L991] COND TRUE 1 i<(800) [L994] 1 tmp = __VERIFIER_nondet_uint() [L995] CALL 1 assume_abort_if_not(tmp < (800)) [L23] COND FALSE 1 !(!cond) [L995] RET 1 assume_abort_if_not(tmp < (800)) [L996] CALL, EXPR 1 push(arr,tmp) [L961] COND FALSE 1 !(top==(800)) [L968] CALL, EXPR 1 get_top() [L953] 1 return top; [L968] RET, EXPR 1 get_top() [L968] 1 stack[get_top()] = x [L969] CALL 1 inc_top() [L945] 1 top++ [L969] RET 1 inc_top() [L971] 1 return 0; VAL [\old(x)=799, \result=0, arr={3:0}, flag=0, m={4:0}, stack={3:0}, stack={3:0}, top=1, x=799] [L996] RET, EXPR 1 push(arr,tmp) [L996] COND FALSE 1 !(push(arr,tmp)==(-1)) [L998] 1 flag=(1) [L991] 1 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, tmp=799, top=1] [L1006] COND TRUE 2 i<(800) [L1009] COND TRUE 2 \read(flag) [L1011] CALL, EXPR 2 pop(arr) [L975] CALL, EXPR 2 get_top() [L953] 2 return top; [L975] RET, EXPR 2 get_top() [L975] COND FALSE 2 !(get_top()==0) [L982] CALL 2 dec_top() [L949] 2 top-- [L982] RET 2 dec_top() [L983] CALL, EXPR 2 get_top() [L953] 2 return top; [L983] RET, EXPR 2 get_top() [L983] EXPR 2 stack[get_top()] [L983] 2 return stack[get_top()]; [L1011] RET, EXPR 2 pop(arr) [L1011] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1006] 2 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1006] COND TRUE 2 i<(800) [L1009] COND TRUE 2 \read(flag) [L1011] CALL, EXPR 2 pop(arr) [L975] CALL, EXPR 2 get_top() [L953] 2 return top; [L975] RET, EXPR 2 get_top() [L975] COND TRUE 2 get_top()==0 [L978] 2 return (-2); VAL [\result=-2, arr={3:0}, flag=1, m={4:0}, stack={3:0}, stack={3:0}, top=0] [L1011] RET, EXPR 2 pop(arr) [L1011] COND TRUE 2 !(pop(arr)!=(-2)) [L1012] CALL 2 error() [L941] 2 reach_error() VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1022]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 941]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 248 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.1s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 434 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 434 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1381 IncrementalHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 5 mSDtfsCounter, 1381 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=487occurred in iteration=8, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 111 ConstructedInterpolants, 0 QuantifiedInterpolants, 855 SizeOfPredicates, 1 NumberOfNonLiveVariables, 186 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 3/9 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:15:44,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...