/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix042.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 23:42:58,470 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 23:42:58,509 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 23:42:58,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 23:42:58,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 23:42:58,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 23:42:58,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 23:42:58,533 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 23:42:58,533 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 23:42:58,534 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 23:42:58,534 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 23:42:58,534 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 23:42:58,535 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 23:42:58,535 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 23:42:58,535 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 23:42:58,535 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 23:42:58,535 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 23:42:58,536 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 23:42:58,536 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 23:42:58,536 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 23:42:58,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 23:42:58,539 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 23:42:58,539 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 23:42:58,539 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 23:42:58,542 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 23:42:58,542 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 23:42:58,542 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 23:42:58,543 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 23:42:58,543 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 23:42:58,543 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 23:42:58,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 23:42:58,544 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 23:42:58,544 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 23:42:58,544 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 23:42:58,544 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 23:42:58,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 23:42:58,544 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 23:42:58,544 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 23:42:58,545 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 23:42:58,545 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 23:42:58,545 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 23:42:58,546 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-03 23:42:58,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 23:42:58,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 23:42:58,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 23:42:58,741 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 23:42:58,743 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 23:42:58,744 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix042.opt_bound2.i [2023-08-03 23:42:59,623 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 23:42:59,776 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 23:42:59,776 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix042.opt_bound2.i [2023-08-03 23:42:59,787 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/544fb6fff/be26348416ad43a1b5b82f9b1e156605/FLAG2840c7c7f [2023-08-03 23:42:59,797 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/544fb6fff/be26348416ad43a1b5b82f9b1e156605 [2023-08-03 23:42:59,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 23:42:59,803 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 23:42:59,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 23:42:59,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 23:42:59,807 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 23:42:59,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 11:42:59" (1/1) ... [2023-08-03 23:42:59,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b1d0115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:42:59, skipping insertion in model container [2023-08-03 23:42:59,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 11:42:59" (1/1) ... [2023-08-03 23:42:59,834 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 23:42:59,929 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix042.opt_bound2.i[944,957] [2023-08-03 23:43:00,086 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 23:43:00,096 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 23:43:00,104 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix042.opt_bound2.i[944,957] [2023-08-03 23:43:00,120 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 23:43:00,121 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 23:43:00,150 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 23:43:00,167 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 23:43:00,167 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 23:43:00,171 INFO L206 MainTranslator]: Completed translation [2023-08-03 23:43:00,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:43:00 WrapperNode [2023-08-03 23:43:00,172 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 23:43:00,172 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 23:43:00,172 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 23:43:00,172 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 23:43:00,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:43:00" (1/1) ... [2023-08-03 23:43:00,186 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:43:00" (1/1) ... [2023-08-03 23:43:00,203 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 177 [2023-08-03 23:43:00,203 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 23:43:00,204 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 23:43:00,204 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 23:43:00,204 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 23:43:00,210 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:43:00" (1/1) ... [2023-08-03 23:43:00,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:43:00" (1/1) ... [2023-08-03 23:43:00,213 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:43:00" (1/1) ... [2023-08-03 23:43:00,213 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:43:00" (1/1) ... [2023-08-03 23:43:00,222 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:43:00" (1/1) ... [2023-08-03 23:43:00,224 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:43:00" (1/1) ... [2023-08-03 23:43:00,225 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:43:00" (1/1) ... [2023-08-03 23:43:00,226 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:43:00" (1/1) ... [2023-08-03 23:43:00,228 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 23:43:00,228 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 23:43:00,229 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 23:43:00,229 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 23:43:00,229 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:43:00" (1/1) ... [2023-08-03 23:43:00,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 23:43:00,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:43:00,252 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) [2023-08-03 23:43:00,253 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 [2023-08-03 23:43:00,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 23:43:00,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 23:43:00,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 23:43:00,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 23:43:00,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 23:43:00,277 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-03 23:43:00,277 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-03 23:43:00,277 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-03 23:43:00,277 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-03 23:43:00,277 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-03 23:43:00,277 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-03 23:43:00,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 23:43:00,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 23:43:00,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 23:43:00,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 23:43:00,278 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-03 23:43:00,377 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 23:43:00,379 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 23:43:00,572 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 23:43:00,688 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 23:43:00,688 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-03 23:43:00,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 11:43:00 BoogieIcfgContainer [2023-08-03 23:43:00,690 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 23:43:00,692 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 23:43:00,692 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 23:43:00,695 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 23:43:00,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 11:42:59" (1/3) ... [2023-08-03 23:43:00,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b92175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 11:43:00, skipping insertion in model container [2023-08-03 23:43:00,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:43:00" (2/3) ... [2023-08-03 23:43:00,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b92175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 11:43:00, skipping insertion in model container [2023-08-03 23:43:00,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 11:43:00" (3/3) ... [2023-08-03 23:43:00,698 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix042.opt_bound2.i [2023-08-03 23:43:00,703 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 23:43:00,709 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 23:43:00,709 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 23:43:00,709 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 23:43:00,750 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 23:43:00,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 132 transitions, 279 flow [2023-08-03 23:43:00,869 INFO L124 PetriNetUnfolderBase]: 30/460 cut-off events. [2023-08-03 23:43:00,869 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:43:00,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 460 events. 30/460 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2068 event pairs, 0 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 269. Up to 16 conditions per place. [2023-08-03 23:43:00,877 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 132 transitions, 279 flow [2023-08-03 23:43:00,880 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 103 transitions, 221 flow [2023-08-03 23:43:00,883 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 23:43:00,893 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 103 transitions, 221 flow [2023-08-03 23:43:00,895 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 103 transitions, 221 flow [2023-08-03 23:43:00,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 103 transitions, 221 flow [2023-08-03 23:43:00,918 INFO L124 PetriNetUnfolderBase]: 6/228 cut-off events. [2023-08-03 23:43:00,918 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:43:00,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 228 events. 6/228 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 691 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 153. Up to 8 conditions per place. [2023-08-03 23:43:00,920 INFO L119 LiptonReduction]: Number of co-enabled transitions 1374 [2023-08-03 23:43:03,392 INFO L134 LiptonReduction]: Checked pairs total: 3131 [2023-08-03 23:43:03,392 INFO L136 LiptonReduction]: Total number of compositions: 83 [2023-08-03 23:43:03,401 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-03 23:43:03,404 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=true, mAutomataTypeConcurrency=PETRI_NET, 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;@77cf1175, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 23:43:03,405 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-03 23:43:03,408 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 23:43:03,408 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2023-08-03 23:43:03,408 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:43:03,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:43:03,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-03 23:43:03,409 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 23:43:03,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:43:03,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1399219444, now seen corresponding path program 1 times [2023-08-03 23:43:03,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:43:03,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938494212] [2023-08-03 23:43:03,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:43:03,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:43:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:43:03,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 23:43:03,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:43:03,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938494212] [2023-08-03 23:43:03,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938494212] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:43:03,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:43:03,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 23:43:03,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745260119] [2023-08-03 23:43:03,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:43:03,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:43:03,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:43:03,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:43:03,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:43:03,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 215 [2023-08-03 23:43:03,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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) [2023-08-03 23:43:03,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:43:03,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 215 [2023-08-03 23:43:03,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:43:03,740 INFO L124 PetriNetUnfolderBase]: 372/678 cut-off events. [2023-08-03 23:43:03,741 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-03 23:43:03,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1383 conditions, 678 events. 372/678 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3213 event pairs, 210 based on Foata normal form. 0/621 useless extension candidates. Maximal degree in co-relation 1364. Up to 616 conditions per place. [2023-08-03 23:43:03,748 INFO L140 encePairwiseOnDemand]: 212/215 looper letters, 22 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2023-08-03 23:43:03,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 121 flow [2023-08-03 23:43:03,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:43:03,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:43:03,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2023-08-03 23:43:03,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5643410852713179 [2023-08-03 23:43:03,763 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2023-08-03 23:43:03,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2023-08-03 23:43:03,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:43:03,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2023-08-03 23:43:03,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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) [2023-08-03 23:43:03,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 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) [2023-08-03 23:43:03,772 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 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) [2023-08-03 23:43:03,786 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 67 flow. Second operand 3 states and 364 transitions. [2023-08-03 23:43:03,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 121 flow [2023-08-03 23:43:03,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 29 transitions, 121 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 23:43:03,789 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 75 flow [2023-08-03 23:43:03,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2023-08-03 23:43:03,792 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2023-08-03 23:43:03,793 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 75 flow [2023-08-03 23:43:03,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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) [2023-08-03 23:43:03,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:43:03,793 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 23:43:03,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 23:43:03,794 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 23:43:03,794 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:43:03,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1410705066, now seen corresponding path program 1 times [2023-08-03 23:43:03,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:43:03,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102702101] [2023-08-03 23:43:03,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:43:03,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:43:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:43:03,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 23:43:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:43:03,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 23:43:03,851 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 23:43:03,852 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-03 23:43:03,853 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-03 23:43:03,854 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-03 23:43:03,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 23:43:03,854 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 23:43:03,855 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (1/2) [2023-08-03 23:43:03,856 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 23:43:03,856 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 23:43:03,875 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 23:43:03,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 158 transitions, 352 flow [2023-08-03 23:43:04,016 INFO L124 PetriNetUnfolderBase]: 93/1429 cut-off events. [2023-08-03 23:43:04,016 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-03 23:43:04,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1527 conditions, 1429 events. 93/1429 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 9999 event pairs, 0 based on Foata normal form. 0/1252 useless extension candidates. Maximal degree in co-relation 1025. Up to 54 conditions per place. [2023-08-03 23:43:04,020 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 158 transitions, 352 flow [2023-08-03 23:43:04,021 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 294 flow [2023-08-03 23:43:04,021 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 23:43:04,022 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 294 flow [2023-08-03 23:43:04,022 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 294 flow [2023-08-03 23:43:04,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 294 flow [2023-08-03 23:43:04,066 INFO L124 PetriNetUnfolderBase]: 12/646 cut-off events. [2023-08-03 23:43:04,066 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-03 23:43:04,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 744 conditions, 646 events. 12/646 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3416 event pairs, 0 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 503. Up to 27 conditions per place. [2023-08-03 23:43:04,074 INFO L119 LiptonReduction]: Number of co-enabled transitions 3928 [2023-08-03 23:43:06,529 INFO L134 LiptonReduction]: Checked pairs total: 13292 [2023-08-03 23:43:06,529 INFO L136 LiptonReduction]: Total number of compositions: 88 [2023-08-03 23:43:06,531 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-03 23:43:06,532 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=true, mAutomataTypeConcurrency=PETRI_NET, 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;@77cf1175, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 23:43:06,532 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-03 23:43:06,547 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 23:43:06,549 INFO L124 PetriNetUnfolderBase]: 0/69 cut-off events. [2023-08-03 23:43:06,549 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-03 23:43:06,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:43:06,553 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2023-08-03 23:43:06,554 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 23:43:06,554 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:43:06,554 INFO L85 PathProgramCache]: Analyzing trace with hash 686868373, now seen corresponding path program 1 times [2023-08-03 23:43:06,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:43:06,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321115805] [2023-08-03 23:43:06,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:43:06,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:43:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:43:06,601 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-03 23:43:06,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:43:06,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321115805] [2023-08-03 23:43:06,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321115805] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:43:06,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:43:06,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 23:43:06,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817493782] [2023-08-03 23:43:06,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:43:06,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:43:06,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:43:06,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:43:06,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:43:06,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 246 [2023-08-03 23:43:06,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 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) [2023-08-03 23:43:06,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:43:06,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 246 [2023-08-03 23:43:06,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:43:12,189 INFO L124 PetriNetUnfolderBase]: 55520/77796 cut-off events. [2023-08-03 23:43:12,189 INFO L125 PetriNetUnfolderBase]: For 4362/4362 co-relation queries the response was YES. [2023-08-03 23:43:12,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154691 conditions, 77796 events. 55520/77796 cut-off events. For 4362/4362 co-relation queries the response was YES. Maximal size of possible extension queue 2843. Compared 555193 event pairs, 44754 based on Foata normal form. 0/70302 useless extension candidates. Maximal degree in co-relation 44380. Up to 71670 conditions per place. [2023-08-03 23:43:12,602 INFO L140 encePairwiseOnDemand]: 243/246 looper letters, 34 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-08-03 23:43:12,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 52 transitions, 212 flow [2023-08-03 23:43:12,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:43:12,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:43:12,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2023-08-03 23:43:12,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5867208672086721 [2023-08-03 23:43:12,606 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2023-08-03 23:43:12,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2023-08-03 23:43:12,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:43:12,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2023-08-03 23:43:12,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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) [2023-08-03 23:43:12,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 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) [2023-08-03 23:43:12,611 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 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) [2023-08-03 23:43:12,611 INFO L175 Difference]: Start difference. First operand has 61 places, 48 transitions, 132 flow. Second operand 3 states and 433 transitions. [2023-08-03 23:43:12,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 52 transitions, 212 flow [2023-08-03 23:43:12,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 52 transitions, 206 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-03 23:43:12,619 INFO L231 Difference]: Finished difference. Result has 64 places, 49 transitions, 138 flow [2023-08-03 23:43:12,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=64, PETRI_TRANSITIONS=49} [2023-08-03 23:43:12,619 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 3 predicate places. [2023-08-03 23:43:12,619 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 49 transitions, 138 flow [2023-08-03 23:43:12,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 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) [2023-08-03 23:43:12,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:43:12,620 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 23:43:12,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 23:43:12,620 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 23:43:12,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:43:12,621 INFO L85 PathProgramCache]: Analyzing trace with hash -91930860, now seen corresponding path program 1 times [2023-08-03 23:43:12,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:43:12,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708010201] [2023-08-03 23:43:12,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:43:12,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:43:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:43:12,704 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 23:43:12,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:43:12,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708010201] [2023-08-03 23:43:12,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708010201] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:43:12,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630244392] [2023-08-03 23:43:12,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:43:12,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:43:12,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:43:12,708 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) [2023-08-03 23:43:12,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-03 23:43:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:43:12,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 23:43:12,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:43:12,840 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 23:43:12,840 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 23:43:12,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630244392] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:43:12,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 23:43:12,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 23:43:12,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808851463] [2023-08-03 23:43:12,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:43:12,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 23:43:12,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:43:12,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 23:43:12,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 23:43:12,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 246 [2023-08-03 23:43:12,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 49 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 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) [2023-08-03 23:43:12,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:43:12,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 246 [2023-08-03 23:43:12,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:43:18,082 INFO L124 PetriNetUnfolderBase]: 55508/77757 cut-off events. [2023-08-03 23:43:18,082 INFO L125 PetriNetUnfolderBase]: For 3987/3987 co-relation queries the response was YES. [2023-08-03 23:43:18,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154283 conditions, 77757 events. 55508/77757 cut-off events. For 3987/3987 co-relation queries the response was YES. Maximal size of possible extension queue 2852. Compared 557412 event pairs, 36684 based on Foata normal form. 9/70290 useless extension candidates. Maximal degree in co-relation 55003. Up to 71623 conditions per place. [2023-08-03 23:43:18,497 INFO L140 encePairwiseOnDemand]: 242/246 looper letters, 37 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2023-08-03 23:43:18,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 56 transitions, 234 flow [2023-08-03 23:43:18,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 23:43:18,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 23:43:18,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 697 transitions. [2023-08-03 23:43:18,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2023-08-03 23:43:18,499 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 697 transitions. [2023-08-03 23:43:18,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 697 transitions. [2023-08-03 23:43:18,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:43:18,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 697 transitions. [2023-08-03 23:43:18,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.4) internal successors, (697), 5 states have internal predecessors, (697), 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) [2023-08-03 23:43:18,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 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) [2023-08-03 23:43:18,503 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 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) [2023-08-03 23:43:18,503 INFO L175 Difference]: Start difference. First operand has 64 places, 49 transitions, 138 flow. Second operand 5 states and 697 transitions. [2023-08-03 23:43:18,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 56 transitions, 234 flow [2023-08-03 23:43:18,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 56 transitions, 231 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-03 23:43:18,505 INFO L231 Difference]: Finished difference. Result has 67 places, 49 transitions, 152 flow [2023-08-03 23:43:18,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=67, PETRI_TRANSITIONS=49} [2023-08-03 23:43:18,506 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 6 predicate places. [2023-08-03 23:43:18,506 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 49 transitions, 152 flow [2023-08-03 23:43:18,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 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) [2023-08-03 23:43:18,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:43:18,506 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:43:18,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-03 23:43:18,712 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 [2023-08-03 23:43:18,713 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 23:43:18,713 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:43:18,713 INFO L85 PathProgramCache]: Analyzing trace with hash -268204276, now seen corresponding path program 1 times [2023-08-03 23:43:18,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:43:18,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372421997] [2023-08-03 23:43:18,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:43:18,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:43:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:43:18,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-03 23:43:18,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:43:18,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372421997] [2023-08-03 23:43:18,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372421997] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:43:18,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854339035] [2023-08-03 23:43:18,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:43:18,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:43:18,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:43:18,780 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:43:18,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-03 23:43:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:43:18,859 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 23:43:18,860 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:43:18,868 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 23:43:18,868 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 23:43:18,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854339035] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:43:18,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 23:43:18,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-03 23:43:18,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121818403] [2023-08-03 23:43:18,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:43:18,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:43:18,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:43:18,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:43:18,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:43:18,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 246 [2023-08-03 23:43:18,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 49 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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) [2023-08-03 23:43:18,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:43:18,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 246 [2023-08-03 23:43:18,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:43:24,021 INFO L124 PetriNetUnfolderBase]: 53886/78264 cut-off events. [2023-08-03 23:43:24,021 INFO L125 PetriNetUnfolderBase]: For 3706/3706 co-relation queries the response was YES. [2023-08-03 23:43:24,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152715 conditions, 78264 events. 53886/78264 cut-off events. For 3706/3706 co-relation queries the response was YES. Maximal size of possible extension queue 2863. Compared 595271 event pairs, 42318 based on Foata normal form. 0/71112 useless extension candidates. Maximal degree in co-relation 44048. Up to 69144 conditions per place. [2023-08-03 23:43:24,589 INFO L140 encePairwiseOnDemand]: 243/246 looper letters, 40 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2023-08-03 23:43:24,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 58 transitions, 256 flow [2023-08-03 23:43:24,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:43:24,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:43:24,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2023-08-03 23:43:24,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5934959349593496 [2023-08-03 23:43:24,590 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2023-08-03 23:43:24,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2023-08-03 23:43:24,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:43:24,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2023-08-03 23:43:24,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 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) [2023-08-03 23:43:24,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 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) [2023-08-03 23:43:24,593 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 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) [2023-08-03 23:43:24,593 INFO L175 Difference]: Start difference. First operand has 67 places, 49 transitions, 152 flow. Second operand 3 states and 438 transitions. [2023-08-03 23:43:24,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 58 transitions, 256 flow [2023-08-03 23:43:24,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 58 transitions, 249 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-03 23:43:24,595 INFO L231 Difference]: Finished difference. Result has 68 places, 50 transitions, 160 flow [2023-08-03 23:43:24,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=68, PETRI_TRANSITIONS=50} [2023-08-03 23:43:24,595 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 7 predicate places. [2023-08-03 23:43:24,595 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 50 transitions, 160 flow [2023-08-03 23:43:24,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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) [2023-08-03 23:43:24,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:43:24,596 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:43:24,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-03 23:43:24,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:43:24,800 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 23:43:24,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:43:24,801 INFO L85 PathProgramCache]: Analyzing trace with hash -2067544712, now seen corresponding path program 1 times [2023-08-03 23:43:24,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:43:24,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497011352] [2023-08-03 23:43:24,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:43:24,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:43:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:43:24,848 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 23:43:24,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:43:24,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497011352] [2023-08-03 23:43:24,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497011352] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:43:24,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707907357] [2023-08-03 23:43:24,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:43:24,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:43:24,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:43:24,850 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:43:24,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-03 23:43:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:43:24,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 23:43:24,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:43:24,932 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 23:43:24,932 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 23:43:24,948 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 23:43:24,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707907357] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 23:43:24,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 23:43:24,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 23:43:24,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466253699] [2023-08-03 23:43:24,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 23:43:24,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 23:43:24,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:43:24,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 23:43:24,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:43:24,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 246 [2023-08-03 23:43:24,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 50 transitions, 160 flow. Second operand has 5 states, 5 states have (on average 133.6) internal successors, (668), 5 states have internal predecessors, (668), 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) [2023-08-03 23:43:24,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:43:24,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 246 [2023-08-03 23:43:24,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:43:29,120 INFO L124 PetriNetUnfolderBase]: 42343/60614 cut-off events. [2023-08-03 23:43:29,120 INFO L125 PetriNetUnfolderBase]: For 3204/3204 co-relation queries the response was YES. [2023-08-03 23:43:29,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118788 conditions, 60614 events. 42343/60614 cut-off events. For 3204/3204 co-relation queries the response was YES. Maximal size of possible extension queue 2287. Compared 434528 event pairs, 26937 based on Foata normal form. 3/55424 useless extension candidates. Maximal degree in co-relation 42141. Up to 53881 conditions per place. [2023-08-03 23:43:29,406 INFO L140 encePairwiseOnDemand]: 243/246 looper letters, 38 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2023-08-03 23:43:29,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 56 transitions, 249 flow [2023-08-03 23:43:29,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 23:43:29,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 23:43:29,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 565 transitions. [2023-08-03 23:43:29,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5741869918699187 [2023-08-03 23:43:29,409 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 565 transitions. [2023-08-03 23:43:29,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 565 transitions. [2023-08-03 23:43:29,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:43:29,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 565 transitions. [2023-08-03 23:43:29,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 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) [2023-08-03 23:43:29,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 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) [2023-08-03 23:43:29,412 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 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) [2023-08-03 23:43:29,412 INFO L175 Difference]: Start difference. First operand has 68 places, 50 transitions, 160 flow. Second operand 4 states and 565 transitions. [2023-08-03 23:43:29,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 56 transitions, 249 flow [2023-08-03 23:43:29,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 56 transitions, 247 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 23:43:29,414 INFO L231 Difference]: Finished difference. Result has 70 places, 49 transitions, 155 flow [2023-08-03 23:43:29,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=155, PETRI_PLACES=70, PETRI_TRANSITIONS=49} [2023-08-03 23:43:29,417 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 9 predicate places. [2023-08-03 23:43:29,418 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 49 transitions, 155 flow [2023-08-03 23:43:29,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.6) internal successors, (668), 5 states have internal predecessors, (668), 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) [2023-08-03 23:43:29,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:43:29,418 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:43:29,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-03 23:43:29,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:43:29,623 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 23:43:29,623 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:43:29,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1970182478, now seen corresponding path program 1 times [2023-08-03 23:43:29,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:43:29,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028351355] [2023-08-03 23:43:29,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:43:29,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:43:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:43:29,695 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 23:43:29,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:43:29,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028351355] [2023-08-03 23:43:29,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028351355] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:43:29,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796011069] [2023-08-03 23:43:29,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:43:29,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:43:29,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:43:29,698 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:43:29,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-03 23:43:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:43:29,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 23:43:29,774 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:43:29,792 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 23:43:29,792 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 23:43:29,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796011069] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:43:29,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 23:43:29,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-03 23:43:29,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830826470] [2023-08-03 23:43:29,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:43:29,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 23:43:29,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:43:29,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 23:43:29,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 23:43:29,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 246 [2023-08-03 23:43:29,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 49 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 133.6) internal successors, (668), 5 states have internal predecessors, (668), 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) [2023-08-03 23:43:29,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:43:29,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 246 [2023-08-03 23:43:29,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:43:33,825 INFO L124 PetriNetUnfolderBase]: 41935/60481 cut-off events. [2023-08-03 23:43:33,825 INFO L125 PetriNetUnfolderBase]: For 2671/2671 co-relation queries the response was YES. [2023-08-03 23:43:33,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118197 conditions, 60481 events. 41935/60481 cut-off events. For 2671/2671 co-relation queries the response was YES. Maximal size of possible extension queue 2326. Compared 441061 event pairs, 11542 based on Foata normal form. 144/55585 useless extension candidates. Maximal degree in co-relation 41910. Up to 52515 conditions per place. [2023-08-03 23:43:34,115 INFO L140 encePairwiseOnDemand]: 242/246 looper letters, 53 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2023-08-03 23:43:34,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 71 transitions, 313 flow [2023-08-03 23:43:34,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 23:43:34,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 23:43:34,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 712 transitions. [2023-08-03 23:43:34,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5788617886178862 [2023-08-03 23:43:34,117 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 712 transitions. [2023-08-03 23:43:34,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 712 transitions. [2023-08-03 23:43:34,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:43:34,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 712 transitions. [2023-08-03 23:43:34,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 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) [2023-08-03 23:43:34,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 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) [2023-08-03 23:43:34,120 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 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) [2023-08-03 23:43:34,120 INFO L175 Difference]: Start difference. First operand has 70 places, 49 transitions, 155 flow. Second operand 5 states and 712 transitions. [2023-08-03 23:43:34,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 71 transitions, 313 flow [2023-08-03 23:43:34,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 71 transitions, 306 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-03 23:43:34,122 INFO L231 Difference]: Finished difference. Result has 71 places, 49 transitions, 165 flow [2023-08-03 23:43:34,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=165, PETRI_PLACES=71, PETRI_TRANSITIONS=49} [2023-08-03 23:43:34,123 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 10 predicate places. [2023-08-03 23:43:34,123 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 49 transitions, 165 flow [2023-08-03 23:43:34,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.6) internal successors, (668), 5 states have internal predecessors, (668), 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) [2023-08-03 23:43:34,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:43:34,123 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:43:34,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-03 23:43:34,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:43:34,328 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 23:43:34,328 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:43:34,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1294339986, now seen corresponding path program 1 times [2023-08-03 23:43:34,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:43:34,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463839206] [2023-08-03 23:43:34,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:43:34,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:43:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:43:34,368 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-03 23:43:34,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:43:34,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463839206] [2023-08-03 23:43:34,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463839206] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:43:34,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663538341] [2023-08-03 23:43:34,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:43:34,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:43:34,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:43:34,371 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:43:34,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-03 23:43:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:43:34,449 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 23:43:34,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:43:34,459 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-03 23:43:34,459 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 23:43:34,473 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-03 23:43:34,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663538341] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 23:43:34,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 23:43:34,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 23:43:34,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058014346] [2023-08-03 23:43:34,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 23:43:34,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 23:43:34,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:43:34,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 23:43:34,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:43:34,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 246 [2023-08-03 23:43:34,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 49 transitions, 165 flow. Second operand has 5 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 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) [2023-08-03 23:43:34,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:43:34,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 246 [2023-08-03 23:43:34,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:43:37,908 INFO L124 PetriNetUnfolderBase]: 35056/50002 cut-off events. [2023-08-03 23:43:37,908 INFO L125 PetriNetUnfolderBase]: For 3061/3061 co-relation queries the response was YES. [2023-08-03 23:43:38,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98361 conditions, 50002 events. 35056/50002 cut-off events. For 3061/3061 co-relation queries the response was YES. Maximal size of possible extension queue 2065. Compared 350492 event pairs, 21142 based on Foata normal form. 36/46006 useless extension candidates. Maximal degree in co-relation 34811. Up to 43492 conditions per place. [2023-08-03 23:43:38,155 INFO L140 encePairwiseOnDemand]: 243/246 looper letters, 49 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2023-08-03 23:43:38,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 66 transitions, 299 flow [2023-08-03 23:43:38,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 23:43:38,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 23:43:38,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 576 transitions. [2023-08-03 23:43:38,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5853658536585366 [2023-08-03 23:43:38,157 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 576 transitions. [2023-08-03 23:43:38,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 576 transitions. [2023-08-03 23:43:38,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:43:38,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 576 transitions. [2023-08-03 23:43:38,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 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) [2023-08-03 23:43:38,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 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) [2023-08-03 23:43:38,159 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 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) [2023-08-03 23:43:38,159 INFO L175 Difference]: Start difference. First operand has 71 places, 49 transitions, 165 flow. Second operand 4 states and 576 transitions. [2023-08-03 23:43:38,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 66 transitions, 299 flow [2023-08-03 23:43:38,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 66 transitions, 294 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-03 23:43:38,162 INFO L231 Difference]: Finished difference. Result has 72 places, 48 transitions, 158 flow [2023-08-03 23:43:38,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=72, PETRI_TRANSITIONS=48} [2023-08-03 23:43:38,162 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 11 predicate places. [2023-08-03 23:43:38,162 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 48 transitions, 158 flow [2023-08-03 23:43:38,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 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) [2023-08-03 23:43:38,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:43:38,163 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:43:38,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-03 23:43:38,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:43:38,367 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 23:43:38,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:43:38,367 INFO L85 PathProgramCache]: Analyzing trace with hash 190338363, now seen corresponding path program 1 times [2023-08-03 23:43:38,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:43:38,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446163682] [2023-08-03 23:43:38,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:43:38,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:43:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:43:38,409 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-03 23:43:38,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:43:38,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446163682] [2023-08-03 23:43:38,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446163682] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:43:38,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728763524] [2023-08-03 23:43:38,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:43:38,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:43:38,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:43:38,410 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:43:38,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-03 23:43:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:43:38,488 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 23:43:38,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:43:38,503 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-03 23:43:38,503 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 23:43:38,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728763524] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:43:38,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 23:43:38,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 23:43:38,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253385218] [2023-08-03 23:43:38,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:43:38,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 23:43:38,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:43:38,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 23:43:38,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:43:38,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 246 [2023-08-03 23:43:38,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 48 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 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) [2023-08-03 23:43:38,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:43:38,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 246 [2023-08-03 23:43:38,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:43:40,522 INFO L124 PetriNetUnfolderBase]: 19096/28327 cut-off events. [2023-08-03 23:43:40,523 INFO L125 PetriNetUnfolderBase]: For 2314/2314 co-relation queries the response was YES. [2023-08-03 23:43:40,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56586 conditions, 28327 events. 19096/28327 cut-off events. For 2314/2314 co-relation queries the response was YES. Maximal size of possible extension queue 1222. Compared 196029 event pairs, 952 based on Foata normal form. 3600/30055 useless extension candidates. Maximal degree in co-relation 20086. Up to 20016 conditions per place. [2023-08-03 23:43:40,591 INFO L140 encePairwiseOnDemand]: 244/246 looper letters, 0 selfloop transitions, 0 changer transitions 71/71 dead transitions. [2023-08-03 23:43:40,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 71 transitions, 318 flow [2023-08-03 23:43:40,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 23:43:40,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 23:43:40,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 585 transitions. [2023-08-03 23:43:40,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5945121951219512 [2023-08-03 23:43:40,592 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 585 transitions. [2023-08-03 23:43:40,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 585 transitions. [2023-08-03 23:43:40,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:43:40,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 585 transitions. [2023-08-03 23:43:40,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.25) internal successors, (585), 4 states have internal predecessors, (585), 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) [2023-08-03 23:43:40,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 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) [2023-08-03 23:43:40,595 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 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) [2023-08-03 23:43:40,595 INFO L175 Difference]: Start difference. First operand has 72 places, 48 transitions, 158 flow. Second operand 4 states and 585 transitions. [2023-08-03 23:43:40,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 71 transitions, 318 flow [2023-08-03 23:43:40,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 71 transitions, 311 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-03 23:43:40,681 INFO L231 Difference]: Finished difference. Result has 70 places, 0 transitions, 0 flow [2023-08-03 23:43:40,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=70, PETRI_TRANSITIONS=0} [2023-08-03 23:43:40,681 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 9 predicate places. [2023-08-03 23:43:40,681 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 0 transitions, 0 flow [2023-08-03 23:43:40,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 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) [2023-08-03 23:43:40,681 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-03 23:43:40,682 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-03 23:43:40,682 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-03 23:43:40,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-03 23:43:40,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:43:40,885 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:43:40,885 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE,SAFE,SAFE (1/2) [2023-08-03 23:43:40,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 158 transitions, 352 flow [2023-08-03 23:43:40,958 INFO L124 PetriNetUnfolderBase]: 93/1429 cut-off events. [2023-08-03 23:43:40,958 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-03 23:43:40,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1527 conditions, 1429 events. 93/1429 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 9999 event pairs, 0 based on Foata normal form. 0/1252 useless extension candidates. Maximal degree in co-relation 1025. Up to 54 conditions per place. [2023-08-03 23:43:40,961 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 158 transitions, 352 flow [2023-08-03 23:43:40,964 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 156 transitions, 340 flow [2023-08-03 23:43:40,964 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 23:43:40,964 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 156 transitions, 340 flow [2023-08-03 23:43:40,964 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 156 transitions, 340 flow [2023-08-03 23:43:40,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 156 transitions, 340 flow [2023-08-03 23:43:41,038 INFO L124 PetriNetUnfolderBase]: 93/1425 cut-off events. [2023-08-03 23:43:41,038 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-08-03 23:43:41,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1515 conditions, 1425 events. 93/1425 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 9970 event pairs, 0 based on Foata normal form. 0/1248 useless extension candidates. Maximal degree in co-relation 1019. Up to 54 conditions per place. [2023-08-03 23:43:41,056 INFO L119 LiptonReduction]: Number of co-enabled transitions 6520 [2023-08-03 23:43:44,024 INFO L134 LiptonReduction]: Checked pairs total: 21672 [2023-08-03 23:43:44,024 INFO L136 LiptonReduction]: Total number of compositions: 117 [2023-08-03 23:43:44,025 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 23:43:44,026 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=true, mAutomataTypeConcurrency=PETRI_NET, 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;@77cf1175, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 23:43:44,026 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-03 23:43:44,028 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 23:43:44,028 INFO L124 PetriNetUnfolderBase]: 1/20 cut-off events. [2023-08-03 23:43:44,028 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:43:44,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:43:44,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-03 23:43:44,029 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 23:43:44,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:43:44,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1512835146, now seen corresponding path program 1 times [2023-08-03 23:43:44,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:43:44,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948272125] [2023-08-03 23:43:44,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:43:44,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:43:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:43:44,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 23:43:44,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:43:44,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948272125] [2023-08-03 23:43:44,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948272125] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:43:44,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:43:44,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 23:43:44,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14630710] [2023-08-03 23:43:44,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:43:44,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:43:44,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:43:44,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:43:44,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:43:44,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 275 [2023-08-03 23:43:44,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 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) [2023-08-03 23:43:44,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:43:44,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 275 [2023-08-03 23:43:44,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:44:08,126 INFO L124 PetriNetUnfolderBase]: 267242/367047 cut-off events. [2023-08-03 23:44:08,126 INFO L125 PetriNetUnfolderBase]: For 4437/4437 co-relation queries the response was YES. [2023-08-03 23:44:08,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710462 conditions, 367047 events. 267242/367047 cut-off events. For 4437/4437 co-relation queries the response was YES. Maximal size of possible extension queue 11573. Compared 2874932 event pairs, 220020 based on Foata normal form. 7812/317331 useless extension candidates. Maximal degree in co-relation 205333. Up to 338076 conditions per place. [2023-08-03 23:44:09,848 INFO L140 encePairwiseOnDemand]: 271/275 looper letters, 41 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-08-03 23:44:09,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 57 transitions, 228 flow [2023-08-03 23:44:09,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:44:09,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:44:09,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2023-08-03 23:44:09,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5345454545454545 [2023-08-03 23:44:09,850 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 441 transitions. [2023-08-03 23:44:09,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions. [2023-08-03 23:44:09,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:44:09,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions. [2023-08-03 23:44:09,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 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) [2023-08-03 23:44:09,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 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) [2023-08-03 23:44:09,852 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 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) [2023-08-03 23:44:09,852 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 136 flow. Second operand 3 states and 441 transitions. [2023-08-03 23:44:09,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 57 transitions, 228 flow [2023-08-03 23:44:09,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 57 transitions, 226 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-03 23:44:09,856 INFO L231 Difference]: Finished difference. Result has 69 places, 54 transitions, 144 flow [2023-08-03 23:44:09,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=69, PETRI_TRANSITIONS=54} [2023-08-03 23:44:09,857 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 3 predicate places. [2023-08-03 23:44:09,857 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 54 transitions, 144 flow [2023-08-03 23:44:09,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 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) [2023-08-03 23:44:09,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:44:09,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:44:09,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-03 23:44:09,857 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 23:44:09,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:44:09,857 INFO L85 PathProgramCache]: Analyzing trace with hash -495565415, now seen corresponding path program 1 times [2023-08-03 23:44:09,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:44:09,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459868371] [2023-08-03 23:44:09,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:44:09,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:44:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:44:09,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 23:44:09,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:44:09,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459868371] [2023-08-03 23:44:09,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459868371] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:44:09,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728561612] [2023-08-03 23:44:09,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:44:09,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:44:09,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:44:09,893 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:44:09,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-03 23:44:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:44:09,964 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 23:44:09,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:44:09,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 23:44:09,969 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 23:44:09,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728561612] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:44:09,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 23:44:09,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-03 23:44:09,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003041754] [2023-08-03 23:44:09,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:44:09,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:44:09,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:44:09,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:44:09,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:44:09,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 275 [2023-08-03 23:44:09,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 54 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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) [2023-08-03 23:44:09,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:44:09,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 275 [2023-08-03 23:44:09,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:44:35,371 INFO L124 PetriNetUnfolderBase]: 258886/359128 cut-off events. [2023-08-03 23:44:35,372 INFO L125 PetriNetUnfolderBase]: For 3627/3627 co-relation queries the response was YES. [2023-08-03 23:44:36,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690773 conditions, 359128 events. 258886/359128 cut-off events. For 3627/3627 co-relation queries the response was YES. Maximal size of possible extension queue 11505. Compared 2880004 event pairs, 208258 based on Foata normal form. 0/308296 useless extension candidates. Maximal degree in co-relation 690736. Up to 326233 conditions per place. [2023-08-03 23:44:37,422 INFO L140 encePairwiseOnDemand]: 272/275 looper letters, 47 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-08-03 23:44:37,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 63 transitions, 260 flow [2023-08-03 23:44:37,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:44:37,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:44:37,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2023-08-03 23:44:37,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5393939393939394 [2023-08-03 23:44:37,423 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2023-08-03 23:44:37,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2023-08-03 23:44:37,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:44:37,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2023-08-03 23:44:37,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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) [2023-08-03 23:44:37,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 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) [2023-08-03 23:44:37,425 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 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) [2023-08-03 23:44:37,425 INFO L175 Difference]: Start difference. First operand has 69 places, 54 transitions, 144 flow. Second operand 3 states and 445 transitions. [2023-08-03 23:44:37,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 63 transitions, 260 flow [2023-08-03 23:44:37,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 63 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 23:44:37,427 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 154 flow [2023-08-03 23:44:37,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2023-08-03 23:44:37,428 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 5 predicate places. [2023-08-03 23:44:37,428 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 154 flow [2023-08-03 23:44:37,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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) [2023-08-03 23:44:37,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:44:37,428 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:44:37,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-03 23:44:37,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:44:37,631 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 23:44:37,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:44:37,631 INFO L85 PathProgramCache]: Analyzing trace with hash -174412849, now seen corresponding path program 1 times [2023-08-03 23:44:37,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:44:37,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856611486] [2023-08-03 23:44:37,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:44:37,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:44:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:44:37,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 23:44:37,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:44:37,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856611486] [2023-08-03 23:44:37,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856611486] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:44:37,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247430877] [2023-08-03 23:44:37,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:44:37,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:44:37,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:44:37,665 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:44:37,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-03 23:44:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:44:37,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 23:44:37,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:44:37,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 23:44:37,750 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 23:44:37,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 23:44:37,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247430877] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 23:44:37,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 23:44:37,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 23:44:37,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125147472] [2023-08-03 23:44:37,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 23:44:37,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 23:44:37,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:44:37,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 23:44:37,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:44:37,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 275 [2023-08-03 23:44:37,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 55 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 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) [2023-08-03 23:44:37,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:44:37,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 275 [2023-08-03 23:44:37,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:44:55,869 INFO L124 PetriNetUnfolderBase]: 202606/277616 cut-off events. [2023-08-03 23:44:55,869 INFO L125 PetriNetUnfolderBase]: For 2979/2979 co-relation queries the response was YES. [2023-08-03 23:44:56,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535213 conditions, 277616 events. 202606/277616 cut-off events. For 2979/2979 co-relation queries the response was YES. Maximal size of possible extension queue 9213. Compared 2106806 event pairs, 135114 based on Foata normal form. 3/240143 useless extension candidates. Maximal degree in co-relation 189634. Up to 253192 conditions per place. [2023-08-03 23:44:57,502 INFO L140 encePairwiseOnDemand]: 271/275 looper letters, 45 selfloop transitions, 3 changer transitions 1/63 dead transitions. [2023-08-03 23:44:57,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 63 transitions, 268 flow [2023-08-03 23:44:57,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 23:44:57,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 23:44:57,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 573 transitions. [2023-08-03 23:44:57,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5209090909090909 [2023-08-03 23:44:57,504 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 573 transitions. [2023-08-03 23:44:57,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 573 transitions. [2023-08-03 23:44:57,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:44:57,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 573 transitions. [2023-08-03 23:44:57,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.25) internal successors, (573), 4 states have internal predecessors, (573), 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) [2023-08-03 23:44:57,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 275.0) internal successors, (1375), 5 states have internal predecessors, (1375), 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) [2023-08-03 23:44:57,507 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 275.0) internal successors, (1375), 5 states have internal predecessors, (1375), 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) [2023-08-03 23:44:57,507 INFO L175 Difference]: Start difference. First operand has 71 places, 55 transitions, 154 flow. Second operand 4 states and 573 transitions. [2023-08-03 23:44:57,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 63 transitions, 268 flow [2023-08-03 23:44:57,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 63 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 23:44:57,508 INFO L231 Difference]: Finished difference. Result has 75 places, 55 transitions, 166 flow [2023-08-03 23:44:57,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=75, PETRI_TRANSITIONS=55} [2023-08-03 23:44:57,509 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 9 predicate places. [2023-08-03 23:44:57,509 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 55 transitions, 166 flow [2023-08-03 23:44:57,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 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) [2023-08-03 23:44:57,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:44:57,509 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:44:57,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-08-03 23:44:57,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-03 23:44:57,713 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 23:44:57,713 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:44:57,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1423454339, now seen corresponding path program 1 times [2023-08-03 23:44:57,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:44:57,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778998941] [2023-08-03 23:44:57,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:44:57,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:44:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:44:57,744 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 23:44:57,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:44:57,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778998941] [2023-08-03 23:44:57,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778998941] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:44:57,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542918817] [2023-08-03 23:44:57,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:44:57,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:44:57,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:44:57,746 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:44:57,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-03 23:44:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:44:57,830 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 23:44:57,830 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:44:57,841 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 23:44:57,841 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 23:44:57,851 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 23:44:57,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542918817] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 23:44:57,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 23:44:57,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 23:44:57,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589814666] [2023-08-03 23:44:57,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 23:44:57,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 23:44:57,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:44:57,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 23:44:57,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:44:57,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 275 [2023-08-03 23:44:57,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 55 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 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) [2023-08-03 23:44:57,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:44:57,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 275 [2023-08-03 23:44:57,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:45:13,009 INFO L124 PetriNetUnfolderBase]: 168352/228982 cut-off events. [2023-08-03 23:45:13,010 INFO L125 PetriNetUnfolderBase]: For 2205/2205 co-relation queries the response was YES. [2023-08-03 23:45:13,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441517 conditions, 228982 events. 168352/228982 cut-off events. For 2205/2205 co-relation queries the response was YES. Maximal size of possible extension queue 8129. Compared 1697396 event pairs, 107266 based on Foata normal form. 36/199210 useless extension candidates. Maximal degree in co-relation 156172. Up to 207628 conditions per place. [2023-08-03 23:45:14,405 INFO L140 encePairwiseOnDemand]: 271/275 looper letters, 56 selfloop transitions, 3 changer transitions 1/74 dead transitions. [2023-08-03 23:45:14,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 324 flow [2023-08-03 23:45:14,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 23:45:14,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 23:45:14,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 584 transitions. [2023-08-03 23:45:14,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5309090909090909 [2023-08-03 23:45:14,407 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 584 transitions. [2023-08-03 23:45:14,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 584 transitions. [2023-08-03 23:45:14,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:45:14,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 584 transitions. [2023-08-03 23:45:14,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 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) [2023-08-03 23:45:14,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 275.0) internal successors, (1375), 5 states have internal predecessors, (1375), 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) [2023-08-03 23:45:14,410 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 275.0) internal successors, (1375), 5 states have internal predecessors, (1375), 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) [2023-08-03 23:45:14,410 INFO L175 Difference]: Start difference. First operand has 75 places, 55 transitions, 166 flow. Second operand 4 states and 584 transitions. [2023-08-03 23:45:14,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 74 transitions, 324 flow [2023-08-03 23:45:14,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 74 transitions, 317 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 23:45:14,411 INFO L231 Difference]: Finished difference. Result has 77 places, 55 transitions, 173 flow [2023-08-03 23:45:14,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=77, PETRI_TRANSITIONS=55} [2023-08-03 23:45:14,411 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 11 predicate places. [2023-08-03 23:45:14,411 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 55 transitions, 173 flow [2023-08-03 23:45:14,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 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) [2023-08-03 23:45:14,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:45:14,412 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:45:14,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-08-03 23:45:14,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-03 23:45:14,619 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 23:45:14,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:45:14,619 INFO L85 PathProgramCache]: Analyzing trace with hash -908927244, now seen corresponding path program 1 times [2023-08-03 23:45:14,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:45:14,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779975236] [2023-08-03 23:45:14,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:45:14,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:45:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:45:14,722 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-03 23:45:14,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:45:14,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779975236] [2023-08-03 23:45:14,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779975236] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:45:14,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:45:14,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 23:45:14,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761577615] [2023-08-03 23:45:14,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:45:14,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:45:14,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:45:14,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:45:14,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:45:14,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 275 [2023-08-03 23:45:14,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 55 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 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) [2023-08-03 23:45:14,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:45:14,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 275 [2023-08-03 23:45:14,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:45:27,660 INFO L124 PetriNetUnfolderBase]: 144616/199927 cut-off events. [2023-08-03 23:45:27,660 INFO L125 PetriNetUnfolderBase]: For 3133/3133 co-relation queries the response was YES. [2023-08-03 23:45:28,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 383046 conditions, 199927 events. 144616/199927 cut-off events. For 3133/3133 co-relation queries the response was YES. Maximal size of possible extension queue 6756. Compared 1490036 event pairs, 24520 based on Foata normal form. 0/175303 useless extension candidates. Maximal degree in co-relation 135498. Up to 164161 conditions per place. [2023-08-03 23:45:28,711 INFO L140 encePairwiseOnDemand]: 270/275 looper letters, 59 selfloop transitions, 3 changer transitions 0/76 dead transitions. [2023-08-03 23:45:28,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 76 transitions, 344 flow [2023-08-03 23:45:28,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:45:28,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:45:28,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2023-08-03 23:45:28,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.566060606060606 [2023-08-03 23:45:28,730 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 467 transitions. [2023-08-03 23:45:28,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions. [2023-08-03 23:45:28,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:45:28,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions. [2023-08-03 23:45:28,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 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) [2023-08-03 23:45:28,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 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) [2023-08-03 23:45:28,732 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 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) [2023-08-03 23:45:28,732 INFO L175 Difference]: Start difference. First operand has 77 places, 55 transitions, 173 flow. Second operand 3 states and 467 transitions. [2023-08-03 23:45:28,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 76 transitions, 344 flow [2023-08-03 23:45:28,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 76 transitions, 337 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 23:45:28,735 INFO L231 Difference]: Finished difference. Result has 77 places, 57 transitions, 187 flow [2023-08-03 23:45:28,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=187, PETRI_PLACES=77, PETRI_TRANSITIONS=57} [2023-08-03 23:45:28,735 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 11 predicate places. [2023-08-03 23:45:28,735 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 57 transitions, 187 flow [2023-08-03 23:45:28,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 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) [2023-08-03 23:45:28,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:45:28,736 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:45:28,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-03 23:45:28,736 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 23:45:28,736 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:45:28,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1888774104, now seen corresponding path program 1 times [2023-08-03 23:45:28,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:45:28,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642530521] [2023-08-03 23:45:28,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:45:28,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:45:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:45:28,806 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-03 23:45:28,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:45:28,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642530521] [2023-08-03 23:45:28,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642530521] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:45:28,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:45:28,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 23:45:28,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946250395] [2023-08-03 23:45:28,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:45:28,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:45:28,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:45:28,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:45:28,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:45:28,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 275 [2023-08-03 23:45:28,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 57 transitions, 187 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 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) [2023-08-03 23:45:28,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:45:28,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 275 [2023-08-03 23:45:28,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:45:42,370 INFO L124 PetriNetUnfolderBase]: 142168/190567 cut-off events. [2023-08-03 23:45:42,370 INFO L125 PetriNetUnfolderBase]: For 11536/11536 co-relation queries the response was YES. [2023-08-03 23:45:42,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393838 conditions, 190567 events. 142168/190567 cut-off events. For 11536/11536 co-relation queries the response was YES. Maximal size of possible extension queue 7220. Compared 1358084 event pairs, 118120 based on Foata normal form. 0/168607 useless extension candidates. Maximal degree in co-relation 138903. Up to 173284 conditions per place. [2023-08-03 23:45:43,389 INFO L140 encePairwiseOnDemand]: 271/275 looper letters, 56 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2023-08-03 23:45:43,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 72 transitions, 336 flow [2023-08-03 23:45:43,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:45:43,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:45:43,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2023-08-03 23:45:43,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5478787878787879 [2023-08-03 23:45:43,390 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2023-08-03 23:45:43,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2023-08-03 23:45:43,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:45:43,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2023-08-03 23:45:43,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 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) [2023-08-03 23:45:43,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 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) [2023-08-03 23:45:43,392 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 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) [2023-08-03 23:45:43,392 INFO L175 Difference]: Start difference. First operand has 77 places, 57 transitions, 187 flow. Second operand 3 states and 452 transitions. [2023-08-03 23:45:43,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 72 transitions, 336 flow [2023-08-03 23:45:43,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 72 transitions, 332 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 23:45:43,415 INFO L231 Difference]: Finished difference. Result has 79 places, 58 transitions, 198 flow [2023-08-03 23:45:43,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=79, PETRI_TRANSITIONS=58} [2023-08-03 23:45:43,415 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 13 predicate places. [2023-08-03 23:45:43,415 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 58 transitions, 198 flow [2023-08-03 23:45:43,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 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) [2023-08-03 23:45:43,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:45:43,416 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:45:43,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-03 23:45:43,416 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 23:45:43,416 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:45:43,416 INFO L85 PathProgramCache]: Analyzing trace with hash 204360205, now seen corresponding path program 1 times [2023-08-03 23:45:43,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:45:43,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143692949] [2023-08-03 23:45:43,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:45:43,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:45:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:45:43,432 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 23:45:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:45:43,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 23:45:43,452 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 23:45:43,452 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-03 23:45:43,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-03 23:45:43,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-03 23:45:43,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-03 23:45:43,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-03 23:45:43,452 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:45:43,452 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2023-08-03 23:45:43,455 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 23:45:43,455 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 23:45:43,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 11:45:43 BasicIcfg [2023-08-03 23:45:43,502 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 23:45:43,502 INFO L158 Benchmark]: Toolchain (without parser) took 163699.52ms. Allocated memory was 486.5MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 446.0MB in the beginning and 12.5GB in the end (delta: -12.1GB). Peak memory consumption was 3.4GB. Max. memory is 16.0GB. [2023-08-03 23:45:43,502 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 356.5MB. Free memory is still 311.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 23:45:43,503 INFO L158 Benchmark]: CACSL2BoogieTranslator took 368.17ms. Allocated memory is still 486.5MB. Free memory was 446.0MB in the beginning and 422.4MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-03 23:45:43,503 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.99ms. Allocated memory is still 486.5MB. Free memory was 422.4MB in the beginning and 419.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-03 23:45:43,503 INFO L158 Benchmark]: Boogie Preprocessor took 24.40ms. Allocated memory is still 486.5MB. Free memory was 419.1MB in the beginning and 417.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 23:45:43,503 INFO L158 Benchmark]: RCFGBuilder took 461.23ms. Allocated memory is still 486.5MB. Free memory was 417.1MB in the beginning and 381.4MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. [2023-08-03 23:45:43,503 INFO L158 Benchmark]: TraceAbstraction took 162809.79ms. Allocated memory was 486.5MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 380.4MB in the beginning and 12.5GB in the end (delta: -12.2GB). Peak memory consumption was 3.4GB. Max. memory is 16.0GB. [2023-08-03 23:45:43,504 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 356.5MB. Free memory is still 311.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 368.17ms. Allocated memory is still 486.5MB. Free memory was 446.0MB in the beginning and 422.4MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 30.99ms. Allocated memory is still 486.5MB. Free memory was 422.4MB in the beginning and 419.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 24.40ms. Allocated memory is still 486.5MB. Free memory was 419.1MB in the beginning and 417.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 461.23ms. Allocated memory is still 486.5MB. Free memory was 417.1MB in the beginning and 381.4MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. * TraceAbstraction took 162809.79ms. Allocated memory was 486.5MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 380.4MB in the beginning and 12.5GB in the end (delta: -12.2GB). Peak memory consumption was 3.4GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 108 PlacesBefore, 33 PlacesAfterwards, 103 TransitionsBefore, 26 TransitionsAfterwards, 1374 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 83 TotalNumberOfCompositions, 3131 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1820, independent: 1709, independent conditional: 0, independent unconditional: 1709, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 723, independent: 708, independent conditional: 0, independent unconditional: 708, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1820, independent: 1001, independent conditional: 0, independent unconditional: 1001, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 723, unknown conditional: 0, unknown unconditional: 723] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 87, Positive conditional cache size: 0, Positive unconditional cache size: 87, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 140 PlacesBefore, 61 PlacesAfterwards, 129 TransitionsBefore, 48 TransitionsAfterwards, 3928 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 88 TotalNumberOfCompositions, 13292 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5526, independent: 5246, independent conditional: 0, independent unconditional: 5246, dependent: 280, dependent conditional: 0, dependent unconditional: 280, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1882, independent: 1845, independent conditional: 0, independent unconditional: 1845, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5526, independent: 3401, independent conditional: 0, independent unconditional: 3401, dependent: 243, dependent conditional: 0, dependent unconditional: 243, unknown: 1882, unknown conditional: 0, unknown unconditional: 1882] , Statistics on independence cache: Total cache size (in pairs): 367, Positive cache size: 346, Positive conditional cache size: 0, Positive unconditional cache size: 346, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 164 PlacesBefore, 66 PlacesAfterwards, 156 TransitionsBefore, 54 TransitionsAfterwards, 6520 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 117 TotalNumberOfCompositions, 21672 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8799, independent: 8433, independent conditional: 0, independent unconditional: 8433, dependent: 366, dependent conditional: 0, dependent unconditional: 366, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3329, independent: 3265, independent conditional: 0, independent unconditional: 3265, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8799, independent: 5168, independent conditional: 0, independent unconditional: 5168, dependent: 302, dependent conditional: 0, dependent unconditional: 302, unknown: 3329, unknown conditional: 0, unknown unconditional: 3329] , Statistics on independence cache: Total cache size (in pairs): 461, Positive cache size: 428, Positive conditional cache size: 0, Positive unconditional cache size: 428, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1108[2]; [L826] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t1108={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L826] COND TRUE 0 asdf<2 [L826] FCALL, FORK 0 pthread_create(&t1108[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1108[asdf], ((void *)0), P0, ((void *)0))=-6, t1108={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L826] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t1108={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L826] COND TRUE 0 asdf<2 [L826] FCALL, FORK 0 pthread_create(&t1108[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1108[asdf], ((void *)0), P0, ((void *)0))=-5, t1108={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L826] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1108={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L826] COND FALSE 0 !(asdf<2) [L827] 0 pthread_t t1109[2]; [L828] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1108={5:0}, t1109={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L828] COND TRUE 0 asdf<2 [L828] FCALL, FORK 0 pthread_create(&t1109[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1109[asdf], ((void *)0), P1, ((void *)0))=-4, t1108={5:0}, t1109={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L828] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1108={5:0}, t1109={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L828] COND TRUE 0 asdf<2 [L828] FCALL, FORK 0 pthread_create(&t1109[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1109[asdf], ((void *)0), P1, ((void *)0))=-3, t1108={5:0}, t1109={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L828] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1108={5:0}, t1109={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L828] COND FALSE 0 !(asdf<2) [L829] 0 pthread_t t1110[2]; [L830] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1108={5:0}, t1109={6:0}, t1110={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L830] COND TRUE 0 asdf<2 [L830] FCALL, FORK 0 pthread_create(&t1110[asdf], ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1110[asdf], ((void *)0), P2, ((void *)0))=-2, t1108={5:0}, t1109={6:0}, t1110={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L782] 5 y$w_buff1 = y$w_buff0 [L783] 5 y$w_buff0 = 2 [L784] 5 y$w_buff1_used = y$w_buff0_used [L785] 5 y$w_buff0_used = (_Bool)1 [L786] CALL 5 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 5 !(!expression) [L786] RET 5 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L787] 5 y$r_buff1_thd0 = y$r_buff0_thd0 [L788] 5 y$r_buff1_thd1 = y$r_buff0_thd1 [L789] 5 y$r_buff1_thd2 = y$r_buff0_thd2 [L790] 5 y$r_buff1_thd3 = y$r_buff0_thd3 [L791] 5 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L830] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1108={5:0}, t1109={6:0}, t1110={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L830] COND TRUE 0 asdf<2 [L830] FCALL, FORK 0 pthread_create(&t1110[asdf], ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1110[asdf], ((void *)0), P2, ((void *)0))=-1, t1108={5:0}, t1109={6:0}, t1110={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L782] 6 y$w_buff1 = y$w_buff0 [L783] 6 y$w_buff0 = 2 [L784] 6 y$w_buff1_used = y$w_buff0_used [L785] 6 y$w_buff0_used = (_Bool)1 [L786] CALL 6 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND TRUE 6 !expression [L18] 6 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=2, y$w_buff1_used=1, y=0, z=0] - UnprovableResult [Line: 18]: 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 for thread instance sufficiency with 1 thread instances CFG has 7 procedures, 154 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: 3.1s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 48 IncrementalHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 48 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=1, InterpolantAutomatonStates: 3, 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.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 7 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1/1 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 10 procedures, 180 locations, 7 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: 37.0s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 32.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 322 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 271 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 627 IncrementalHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 3 mSDtfsCounter, 627 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 164 GetRequests, 139 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred in iteration=5, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 251 ConstructedInterpolants, 0 QuantifiedInterpolants, 421 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1143 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 138/158 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 10 procedures, 180 locations, 7 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: 122.6s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 118.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 153 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 539 IncrementalHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 10 mSDtfsCounter, 539 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=6, InterpolantAutomatonStates: 20, 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.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 358 SizeOfPredicates, 0 NumberOfNonLiveVariables, 573 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 46/53 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! [2023-08-03 23:45:43,520 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...