/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_mix000.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 22:59:22,512 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 22:59:22,568 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 22:59:22,572 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 22:59:22,572 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 22:59:22,572 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 22:59:22,572 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 22:59:22,597 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 22:59:22,598 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 22:59:22,600 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 22:59:22,601 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 22:59:22,601 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 22:59:22,601 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 22:59:22,602 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 22:59:22,602 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 22:59:22,602 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 22:59:22,603 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 22:59:22,603 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 22:59:22,603 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 22:59:22,603 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 22:59:22,603 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 22:59:22,603 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 22:59:22,603 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 22:59:22,604 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 22:59:22,604 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 22:59:22,605 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 22:59:22,605 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 22:59:22,605 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 22:59:22,605 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 22:59:22,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 22:59:22,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 22:59:22,606 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 22:59:22,606 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 22:59:22,606 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 22:59:22,606 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 22:59:22,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 22:59:22,607 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 22:59:22,607 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 22:59:22,607 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 22:59:22,607 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 22:59:22,607 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 22:59:22,607 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 22:59:22,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 22:59:22,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 22:59:22,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 22:59:22,811 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 22:59:22,811 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 22:59:22,812 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix000.opt_bound2.i [2023-08-03 22:59:23,726 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 22:59:23,906 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 22:59:23,906 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix000.opt_bound2.i [2023-08-03 22:59:23,914 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fd1743f5/220ce4bffc3a45a1b8654347a344fa1b/FLAGe4fe182c6 [2023-08-03 22:59:23,922 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fd1743f5/220ce4bffc3a45a1b8654347a344fa1b [2023-08-03 22:59:23,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 22:59:23,925 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 22:59:23,925 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 22:59:23,926 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 22:59:23,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 22:59:23,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 10:59:23" (1/1) ... [2023-08-03 22:59:23,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@478aeadb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 10:59:23, skipping insertion in model container [2023-08-03 22:59:23,935 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 10:59:23" (1/1) ... [2023-08-03 22:59:23,979 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 22:59:24,081 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_mix000.opt_bound2.i[987,1000] [2023-08-03 22:59:24,247 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 22:59:24,253 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 22:59:24,262 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_mix000.opt_bound2.i[987,1000] [2023-08-03 22:59:24,277 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-03 22:59:24,278 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-03 22:59:24,308 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 22:59:24,331 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 22:59:24,331 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 22:59:24,335 INFO L206 MainTranslator]: Completed translation [2023-08-03 22:59:24,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 10:59:24 WrapperNode [2023-08-03 22:59:24,336 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 22:59:24,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 22:59:24,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 22:59:24,337 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 22:59:24,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 10:59:24" (1/1) ... [2023-08-03 22:59:24,366 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 10:59:24" (1/1) ... [2023-08-03 22:59:24,389 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2023-08-03 22:59:24,389 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 22:59:24,390 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 22:59:24,390 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 22:59:24,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 22:59:24,396 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 10:59:24" (1/1) ... [2023-08-03 22:59:24,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 10:59:24" (1/1) ... [2023-08-03 22:59:24,411 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 10:59:24" (1/1) ... [2023-08-03 22:59:24,411 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 10:59:24" (1/1) ... [2023-08-03 22:59:24,426 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 10:59:24" (1/1) ... [2023-08-03 22:59:24,428 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 10:59:24" (1/1) ... [2023-08-03 22:59:24,429 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 10:59:24" (1/1) ... [2023-08-03 22:59:24,430 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 10:59:24" (1/1) ... [2023-08-03 22:59:24,432 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 22:59:24,432 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 22:59:24,432 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 22:59:24,432 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 22:59:24,433 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 10:59:24" (1/1) ... [2023-08-03 22:59:24,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 22:59:24,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 22:59:24,465 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 22:59:24,478 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 22:59:24,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 22:59:24,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 22:59:24,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 22:59:24,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 22:59:24,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 22:59:24,486 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-03 22:59:24,486 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-03 22:59:24,486 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-03 22:59:24,486 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-03 22:59:24,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 22:59:24,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 22:59:24,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 22:59:24,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 22:59:24,487 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 22:59:24,567 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 22:59:24,568 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 22:59:24,766 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 22:59:24,880 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 22:59:24,880 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-03 22:59:24,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 10:59:24 BoogieIcfgContainer [2023-08-03 22:59:24,881 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 22:59:24,884 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 22:59:24,884 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 22:59:24,886 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 22:59:24,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 10:59:23" (1/3) ... [2023-08-03 22:59:24,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19fd1ea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 10:59:24, skipping insertion in model container [2023-08-03 22:59:24,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 10:59:24" (2/3) ... [2023-08-03 22:59:24,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19fd1ea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 10:59:24, skipping insertion in model container [2023-08-03 22:59:24,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 10:59:24" (3/3) ... [2023-08-03 22:59:24,889 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix000.opt_bound2.i [2023-08-03 22:59:24,895 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 22:59:24,901 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 22:59:24,901 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 22:59:24,901 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 22:59:24,934 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 22:59:24,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 105 transitions, 220 flow [2023-08-03 22:59:25,037 INFO L124 PetriNetUnfolderBase]: 14/222 cut-off events. [2023-08-03 22:59:25,038 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 22:59:25,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 222 events. 14/222 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 624 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 131. Up to 8 conditions per place. [2023-08-03 22:59:25,041 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 105 transitions, 220 flow [2023-08-03 22:59:25,045 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 78 transitions, 166 flow [2023-08-03 22:59:25,048 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 22:59:25,053 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 78 transitions, 166 flow [2023-08-03 22:59:25,055 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 78 transitions, 166 flow [2023-08-03 22:59:25,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 78 transitions, 166 flow [2023-08-03 22:59:25,070 INFO L124 PetriNetUnfolderBase]: 2/114 cut-off events. [2023-08-03 22:59:25,070 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 22:59:25,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 160 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2023-08-03 22:59:25,071 INFO L119 LiptonReduction]: Number of co-enabled transitions 656 [2023-08-03 22:59:27,299 INFO L134 LiptonReduction]: Checked pairs total: 1330 [2023-08-03 22:59:27,299 INFO L136 LiptonReduction]: Total number of compositions: 65 [2023-08-03 22:59:27,307 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-03 22:59:27,311 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;@5ca73db4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 22:59:27,311 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-03 22:59:27,316 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 22:59:27,316 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-08-03 22:59:27,316 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 22:59:27,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 22:59:27,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 22:59:27,317 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 22:59:27,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 22:59:27,320 INFO L85 PathProgramCache]: Analyzing trace with hash 448250204, now seen corresponding path program 1 times [2023-08-03 22:59:27,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 22:59:27,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544262697] [2023-08-03 22:59:27,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 22:59:27,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 22:59:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 22:59:27,475 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 22:59:27,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 22:59:27,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544262697] [2023-08-03 22:59:27,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544262697] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 22:59:27,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 22:59:27,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 22:59:27,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439625533] [2023-08-03 22:59:27,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 22:59:27,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 22:59:27,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 22:59:27,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 22:59:27,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 22:59:27,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 170 [2023-08-03 22:59:27,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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 22:59:27,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 22:59:27,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 170 [2023-08-03 22:59:27,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 22:59:27,583 INFO L124 PetriNetUnfolderBase]: 65/147 cut-off events. [2023-08-03 22:59:27,584 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 22:59:27,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 147 events. 65/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 489 event pairs, 20 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 280. Up to 126 conditions per place. [2023-08-03 22:59:27,587 INFO L140 encePairwiseOnDemand]: 167/170 looper letters, 17 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2023-08-03 22:59:27,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 22 transitions, 92 flow [2023-08-03 22:59:27,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 22:59:27,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 22:59:27,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2023-08-03 22:59:27,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5568627450980392 [2023-08-03 22:59:27,602 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 284 transitions. [2023-08-03 22:59:27,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 284 transitions. [2023-08-03 22:59:27,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 22:59:27,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 284 transitions. [2023-08-03 22:59:27,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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 22:59:27,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 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 22:59:27,614 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 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 22:59:27,615 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 46 flow. Second operand 3 states and 284 transitions. [2023-08-03 22:59:27,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 22 transitions, 92 flow [2023-08-03 22:59:27,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 22 transitions, 92 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 22:59:27,618 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 54 flow [2023-08-03 22:59:27,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2023-08-03 22:59:27,621 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 3 predicate places. [2023-08-03 22:59:27,621 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 54 flow [2023-08-03 22:59:27,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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 22:59:27,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 22:59:27,622 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 22:59:27,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 22:59:27,622 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 22:59:27,628 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 22:59:27,628 INFO L85 PathProgramCache]: Analyzing trace with hash 999830776, now seen corresponding path program 1 times [2023-08-03 22:59:27,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 22:59:27,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540866951] [2023-08-03 22:59:27,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 22:59:27,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 22:59:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 22:59:27,667 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 22:59:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 22:59:27,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 22:59:27,706 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 22:59:27,707 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-03 22:59:27,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-03 22:59:27,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 22:59:27,709 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 22:59:27,710 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (1/2) [2023-08-03 22:59:27,711 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 22:59:27,711 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 22:59:27,733 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 22:59:27,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 123 transitions, 270 flow [2023-08-03 22:59:27,771 INFO L124 PetriNetUnfolderBase]: 30/459 cut-off events. [2023-08-03 22:59:27,771 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 22:59:27,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 459 events. 30/459 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1950 event pairs, 0 based on Foata normal form. 0/402 useless extension candidates. Maximal degree in co-relation 331. Up to 18 conditions per place. [2023-08-03 22:59:27,772 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 123 transitions, 270 flow [2023-08-03 22:59:27,773 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 96 transitions, 216 flow [2023-08-03 22:59:27,773 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 22:59:27,773 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 96 transitions, 216 flow [2023-08-03 22:59:27,773 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 96 transitions, 216 flow [2023-08-03 22:59:27,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 216 flow [2023-08-03 22:59:27,787 INFO L124 PetriNetUnfolderBase]: 3/216 cut-off events. [2023-08-03 22:59:27,787 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 22:59:27,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 216 events. 3/216 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 550 event pairs, 0 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 169. Up to 9 conditions per place. [2023-08-03 22:59:27,789 INFO L119 LiptonReduction]: Number of co-enabled transitions 1884 [2023-08-03 22:59:29,807 INFO L134 LiptonReduction]: Checked pairs total: 6391 [2023-08-03 22:59:29,807 INFO L136 LiptonReduction]: Total number of compositions: 69 [2023-08-03 22:59:29,809 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-03 22:59:29,815 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;@5ca73db4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 22:59:29,815 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-03 22:59:29,819 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 22:59:29,819 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2023-08-03 22:59:29,819 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-03 22:59:29,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 22:59:29,819 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2023-08-03 22:59:29,820 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 22:59:29,820 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 22:59:29,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1243339845, now seen corresponding path program 1 times [2023-08-03 22:59:29,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 22:59:29,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377983824] [2023-08-03 22:59:29,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 22:59:29,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 22:59:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 22:59:29,891 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 22:59:29,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 22:59:29,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377983824] [2023-08-03 22:59:29,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377983824] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 22:59:29,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 22:59:29,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 22:59:29,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285986911] [2023-08-03 22:59:29,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 22:59:29,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 22:59:29,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 22:59:29,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 22:59:29,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 22:59:29,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 192 [2023-08-03 22:59:29,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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 22:59:29,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 22:59:29,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 192 [2023-08-03 22:59:29,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 22:59:30,469 INFO L124 PetriNetUnfolderBase]: 4261/6457 cut-off events. [2023-08-03 22:59:30,469 INFO L125 PetriNetUnfolderBase]: For 444/444 co-relation queries the response was YES. [2023-08-03 22:59:30,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13068 conditions, 6457 events. 4261/6457 cut-off events. For 444/444 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 38732 event pairs, 2944 based on Foata normal form. 0/5841 useless extension candidates. Maximal degree in co-relation 2883. Up to 6018 conditions per place. [2023-08-03 22:59:30,494 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 28 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2023-08-03 22:59:30,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 38 transitions, 160 flow [2023-08-03 22:59:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 22:59:30,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 22:59:30,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2023-08-03 22:59:30,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2023-08-03 22:59:30,496 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 328 transitions. [2023-08-03 22:59:30,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 328 transitions. [2023-08-03 22:59:30,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 22:59:30,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 328 transitions. [2023-08-03 22:59:30,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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 22:59:30,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 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 22:59:30,498 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 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 22:59:30,498 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 90 flow. Second operand 3 states and 328 transitions. [2023-08-03 22:59:30,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 38 transitions, 160 flow [2023-08-03 22:59:30,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 156 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-03 22:59:30,500 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 98 flow [2023-08-03 22:59:30,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2023-08-03 22:59:30,501 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2023-08-03 22:59:30,501 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 98 flow [2023-08-03 22:59:30,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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 22:59:30,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 22:59:30,501 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 22:59:30,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 22:59:30,501 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 22:59:30,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 22:59:30,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1144917178, now seen corresponding path program 1 times [2023-08-03 22:59:30,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 22:59:30,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114914794] [2023-08-03 22:59:30,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 22:59:30,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 22:59:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 22:59:30,578 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 22:59:30,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 22:59:30,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114914794] [2023-08-03 22:59:30,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114914794] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 22:59:30,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914884135] [2023-08-03 22:59:30,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 22:59:30,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 22:59:30,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 22:59:30,582 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 22:59:30,586 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 22:59:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 22:59:30,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 22:59:30,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 22:59:30,680 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 22:59:30,681 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 22:59:30,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914884135] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 22:59:30,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 22:59:30,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 22:59:30,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336112357] [2023-08-03 22:59:30,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 22:59:30,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 22:59:30,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 22:59:30,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 22:59:30,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 22:59:30,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 192 [2023-08-03 22:59:30,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 99.6) internal successors, (498), 5 states have internal predecessors, (498), 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 22:59:30,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 22:59:30,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 192 [2023-08-03 22:59:30,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 22:59:31,244 INFO L124 PetriNetUnfolderBase]: 4237/6453 cut-off events. [2023-08-03 22:59:31,244 INFO L125 PetriNetUnfolderBase]: For 344/344 co-relation queries the response was YES. [2023-08-03 22:59:31,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13003 conditions, 6453 events. 4237/6453 cut-off events. For 344/344 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 39257 event pairs, 1900 based on Foata normal form. 16/5889 useless extension candidates. Maximal degree in co-relation 3459. Up to 5935 conditions per place. [2023-08-03 22:59:31,274 INFO L140 encePairwiseOnDemand]: 188/192 looper letters, 33 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2023-08-03 22:59:31,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 192 flow [2023-08-03 22:59:31,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 22:59:31,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 22:59:31,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2023-08-03 22:59:31,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.55 [2023-08-03 22:59:31,276 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 528 transitions. [2023-08-03 22:59:31,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 528 transitions. [2023-08-03 22:59:31,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 22:59:31,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 528 transitions. [2023-08-03 22:59:31,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 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 22:59:31,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 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 22:59:31,279 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 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 22:59:31,279 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 98 flow. Second operand 5 states and 528 transitions. [2023-08-03 22:59:31,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 192 flow [2023-08-03 22:59:31,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 44 transitions, 189 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-03 22:59:31,280 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 112 flow [2023-08-03 22:59:31,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2023-08-03 22:59:31,281 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2023-08-03 22:59:31,281 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 112 flow [2023-08-03 22:59:31,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.6) internal successors, (498), 5 states have internal predecessors, (498), 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 22:59:31,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 22:59:31,281 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 22:59:31,288 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 22:59:31,487 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 22:59:31,488 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 22:59:31,488 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 22:59:31,488 INFO L85 PathProgramCache]: Analyzing trace with hash 854661118, now seen corresponding path program 1 times [2023-08-03 22:59:31,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 22:59:31,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071183440] [2023-08-03 22:59:31,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 22:59:31,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 22:59:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 22:59:31,527 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 22:59:31,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 22:59:31,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071183440] [2023-08-03 22:59:31,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071183440] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 22:59:31,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673835672] [2023-08-03 22:59:31,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 22:59:31,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 22:59:31,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 22:59:31,534 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 22:59:31,536 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 22:59:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 22:59:31,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 22:59:31,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 22:59:31,615 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 22:59:31,615 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 22:59:31,630 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 22:59:31,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673835672] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 22:59:31,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 22:59:31,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 22:59:31,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764579072] [2023-08-03 22:59:31,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 22:59:31,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 22:59:31,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 22:59:31,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 22:59:31,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 22:59:31,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 192 [2023-08-03 22:59:31,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 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 22:59:31,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 22:59:31,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 192 [2023-08-03 22:59:31,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 22:59:32,055 INFO L124 PetriNetUnfolderBase]: 3602/5386 cut-off events. [2023-08-03 22:59:32,056 INFO L125 PetriNetUnfolderBase]: For 376/376 co-relation queries the response was YES. [2023-08-03 22:59:32,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10912 conditions, 5386 events. 3602/5386 cut-off events. For 376/376 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 30808 event pairs, 1520 based on Foata normal form. 4/4926 useless extension candidates. Maximal degree in co-relation 2881. Up to 4961 conditions per place. [2023-08-03 22:59:32,079 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 33 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2023-08-03 22:59:32,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 198 flow [2023-08-03 22:59:32,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 22:59:32,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 22:59:32,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 429 transitions. [2023-08-03 22:59:32,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.55859375 [2023-08-03 22:59:32,080 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 429 transitions. [2023-08-03 22:59:32,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 429 transitions. [2023-08-03 22:59:32,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 22:59:32,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 429 transitions. [2023-08-03 22:59:32,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 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 22:59:32,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 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 22:59:32,083 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 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 22:59:32,083 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 112 flow. Second operand 4 states and 429 transitions. [2023-08-03 22:59:32,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 198 flow [2023-08-03 22:59:32,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 43 transitions, 193 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-03 22:59:32,084 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 105 flow [2023-08-03 22:59:32,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2023-08-03 22:59:32,085 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2023-08-03 22:59:32,085 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 105 flow [2023-08-03 22:59:32,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 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 22:59:32,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 22:59:32,085 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 22:59:32,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-03 22:59:32,289 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 22:59:32,290 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 22:59:32,290 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 22:59:32,290 INFO L85 PathProgramCache]: Analyzing trace with hash -2017164808, now seen corresponding path program 1 times [2023-08-03 22:59:32,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 22:59:32,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669441887] [2023-08-03 22:59:32,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 22:59:32,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 22:59:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 22:59:32,352 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 22:59:32,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 22:59:32,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669441887] [2023-08-03 22:59:32,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669441887] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 22:59:32,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 22:59:32,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 22:59:32,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833788562] [2023-08-03 22:59:32,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 22:59:32,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 22:59:32,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 22:59:32,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 22:59:32,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-03 22:59:32,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 192 [2023-08-03 22:59:32,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 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 22:59:32,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 22:59:32,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 192 [2023-08-03 22:59:32,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 22:59:32,596 INFO L124 PetriNetUnfolderBase]: 1778/2847 cut-off events. [2023-08-03 22:59:32,596 INFO L125 PetriNetUnfolderBase]: For 261/261 co-relation queries the response was YES. [2023-08-03 22:59:32,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5897 conditions, 2847 events. 1778/2847 cut-off events. For 261/261 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 15548 event pairs, 42 based on Foata normal form. 576/3199 useless extension candidates. Maximal degree in co-relation 2697. Up to 2240 conditions per place. [2023-08-03 22:59:32,602 INFO L140 encePairwiseOnDemand]: 190/192 looper letters, 0 selfloop transitions, 0 changer transitions 49/49 dead transitions. [2023-08-03 22:59:32,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 221 flow [2023-08-03 22:59:32,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 22:59:32,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 22:59:32,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 439 transitions. [2023-08-03 22:59:32,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5716145833333334 [2023-08-03 22:59:32,603 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 439 transitions. [2023-08-03 22:59:32,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 439 transitions. [2023-08-03 22:59:32,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 22:59:32,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 439 transitions. [2023-08-03 22:59:32,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 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 22:59:32,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 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 22:59:32,605 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 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 22:59:32,605 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 105 flow. Second operand 4 states and 439 transitions. [2023-08-03 22:59:32,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 221 flow [2023-08-03 22:59:32,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 49 transitions, 214 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-03 22:59:32,608 INFO L231 Difference]: Finished difference. Result has 47 places, 0 transitions, 0 flow [2023-08-03 22:59:32,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=47, PETRI_TRANSITIONS=0} [2023-08-03 22:59:32,609 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2023-08-03 22:59:32,609 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 0 transitions, 0 flow [2023-08-03 22:59:32,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 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 22:59:32,609 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-03 22:59:32,609 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-03 22:59:32,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-03 22:59:32,610 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-03 22:59:32,610 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE,SAFE (1/2) [2023-08-03 22:59:32,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 123 transitions, 270 flow [2023-08-03 22:59:32,634 INFO L124 PetriNetUnfolderBase]: 30/459 cut-off events. [2023-08-03 22:59:32,634 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 22:59:32,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 459 events. 30/459 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1950 event pairs, 0 based on Foata normal form. 0/402 useless extension candidates. Maximal degree in co-relation 331. Up to 18 conditions per place. [2023-08-03 22:59:32,634 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 123 transitions, 270 flow [2023-08-03 22:59:32,635 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 122 transitions, 264 flow [2023-08-03 22:59:32,635 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 22:59:32,636 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 122 transitions, 264 flow [2023-08-03 22:59:32,636 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 122 transitions, 264 flow [2023-08-03 22:59:32,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 122 transitions, 264 flow [2023-08-03 22:59:32,657 INFO L124 PetriNetUnfolderBase]: 30/458 cut-off events. [2023-08-03 22:59:32,657 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-03 22:59:32,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 458 events. 30/458 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1941 event pairs, 0 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 329. Up to 18 conditions per place. [2023-08-03 22:59:32,661 INFO L119 LiptonReduction]: Number of co-enabled transitions 3584 [2023-08-03 22:59:34,921 INFO L134 LiptonReduction]: Checked pairs total: 10993 [2023-08-03 22:59:34,921 INFO L136 LiptonReduction]: Total number of compositions: 96 [2023-08-03 22:59:34,922 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 22:59:34,922 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;@5ca73db4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 22:59:34,922 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-03 22:59:34,924 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 22:59:34,924 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2023-08-03 22:59:34,924 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 22:59:34,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 22:59:34,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 22:59:34,924 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 22:59:34,924 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 22:59:34,925 INFO L85 PathProgramCache]: Analyzing trace with hash 739899208, now seen corresponding path program 1 times [2023-08-03 22:59:34,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 22:59:34,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823667606] [2023-08-03 22:59:34,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 22:59:34,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 22:59:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 22:59:34,954 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 22:59:34,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 22:59:34,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823667606] [2023-08-03 22:59:34,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823667606] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 22:59:34,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 22:59:34,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 22:59:34,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679702620] [2023-08-03 22:59:34,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 22:59:34,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 22:59:34,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 22:59:34,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 22:59:34,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 22:59:34,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 219 [2023-08-03 22:59:34,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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 22:59:34,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 22:59:34,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 219 [2023-08-03 22:59:34,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 22:59:37,019 INFO L124 PetriNetUnfolderBase]: 21488/30764 cut-off events. [2023-08-03 22:59:37,020 INFO L125 PetriNetUnfolderBase]: For 460/460 co-relation queries the response was YES. [2023-08-03 22:59:37,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60654 conditions, 30764 events. 21488/30764 cut-off events. For 460/460 co-relation queries the response was YES. Maximal size of possible extension queue 1141. Compared 196935 event pairs, 15656 based on Foata normal form. 860/26624 useless extension candidates. Maximal degree in co-relation 13370. Up to 29265 conditions per place. [2023-08-03 22:59:37,147 INFO L140 encePairwiseOnDemand]: 215/219 looper letters, 35 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2023-08-03 22:59:37,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 44 transitions, 182 flow [2023-08-03 22:59:37,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 22:59:37,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 22:59:37,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2023-08-03 22:59:37,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5114155251141552 [2023-08-03 22:59:37,149 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2023-08-03 22:59:37,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2023-08-03 22:59:37,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 22:59:37,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2023-08-03 22:59:37,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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 22:59:37,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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 22:59:37,151 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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 22:59:37,151 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 100 flow. Second operand 3 states and 336 transitions. [2023-08-03 22:59:37,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 44 transitions, 182 flow [2023-08-03 22:59:37,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 44 transitions, 180 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-03 22:59:37,153 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 108 flow [2023-08-03 22:59:37,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2023-08-03 22:59:37,154 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2023-08-03 22:59:37,154 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 108 flow [2023-08-03 22:59:37,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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 22:59:37,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 22:59:37,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 22:59:37,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-03 22:59:37,155 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 22:59:37,155 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 22:59:37,155 INFO L85 PathProgramCache]: Analyzing trace with hash 33974310, now seen corresponding path program 1 times [2023-08-03 22:59:37,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 22:59:37,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564417654] [2023-08-03 22:59:37,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 22:59:37,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 22:59:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 22:59:37,203 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 22:59:37,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 22:59:37,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564417654] [2023-08-03 22:59:37,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564417654] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 22:59:37,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214941384] [2023-08-03 22:59:37,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 22:59:37,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 22:59:37,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 22:59:37,205 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 22:59:37,207 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 22:59:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 22:59:37,268 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 22:59:37,268 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 22:59:37,276 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 22:59:37,276 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 22:59:37,285 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 22:59:37,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214941384] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 22:59:37,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 22:59:37,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 22:59:37,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220956986] [2023-08-03 22:59:37,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 22:59:37,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 22:59:37,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 22:59:37,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 22:59:37,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 22:59:37,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 219 [2023-08-03 22:59:37,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 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 22:59:37,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 22:59:37,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 219 [2023-08-03 22:59:37,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 22:59:39,252 INFO L124 PetriNetUnfolderBase]: 18130/25566 cut-off events. [2023-08-03 22:59:39,252 INFO L125 PetriNetUnfolderBase]: For 280/280 co-relation queries the response was YES. [2023-08-03 22:59:39,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50397 conditions, 25566 events. 18130/25566 cut-off events. For 280/280 co-relation queries the response was YES. Maximal size of possible extension queue 1040. Compared 156140 event pairs, 8812 based on Foata normal form. 4/21634 useless extension candidates. Maximal degree in co-relation 13369. Up to 24281 conditions per place. [2023-08-03 22:59:39,331 INFO L140 encePairwiseOnDemand]: 215/219 looper letters, 40 selfloop transitions, 3 changer transitions 1/51 dead transitions. [2023-08-03 22:59:39,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 218 flow [2023-08-03 22:59:39,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 22:59:39,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 22:59:39,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 437 transitions. [2023-08-03 22:59:39,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4988584474885845 [2023-08-03 22:59:39,332 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 437 transitions. [2023-08-03 22:59:39,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 437 transitions. [2023-08-03 22:59:39,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 22:59:39,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 437 transitions. [2023-08-03 22:59:39,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 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 22:59:39,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 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 22:59:39,334 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 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 22:59:39,334 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 108 flow. Second operand 4 states and 437 transitions. [2023-08-03 22:59:39,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 218 flow [2023-08-03 22:59:39,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 51 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 22:59:39,335 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 120 flow [2023-08-03 22:59:39,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2023-08-03 22:59:39,336 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2023-08-03 22:59:39,336 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 120 flow [2023-08-03 22:59:39,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 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 22:59:39,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 22:59:39,336 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 22:59:39,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-03 22:59:39,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 22:59:39,540 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 22:59:39,541 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 22:59:39,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1834579269, now seen corresponding path program 1 times [2023-08-03 22:59:39,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 22:59:39,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978554458] [2023-08-03 22:59:39,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 22:59:39,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 22:59:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 22:59:39,611 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 22:59:39,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 22:59:39,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978554458] [2023-08-03 22:59:39,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978554458] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 22:59:39,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 22:59:39,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 22:59:39,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808543378] [2023-08-03 22:59:39,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 22:59:39,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 22:59:39,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 22:59:39,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 22:59:39,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 22:59:39,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 219 [2023-08-03 22:59:39,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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 22:59:39,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 22:59:39,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 219 [2023-08-03 22:59:39,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 22:59:41,232 INFO L124 PetriNetUnfolderBase]: 16282/22999 cut-off events. [2023-08-03 22:59:41,233 INFO L125 PetriNetUnfolderBase]: For 384/384 co-relation queries the response was YES. [2023-08-03 22:59:41,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45334 conditions, 22999 events. 16282/22999 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 965. Compared 139155 event pairs, 3258 based on Foata normal form. 0/19831 useless extension candidates. Maximal degree in co-relation 21213. Up to 20801 conditions per place. [2023-08-03 22:59:41,293 INFO L140 encePairwiseOnDemand]: 214/219 looper letters, 47 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2023-08-03 22:59:41,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 57 transitions, 259 flow [2023-08-03 22:59:41,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 22:59:41,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 22:59:41,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-08-03 22:59:41,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.54337899543379 [2023-08-03 22:59:41,295 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-08-03 22:59:41,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-08-03 22:59:41,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 22:59:41,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-08-03 22:59:41,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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 22:59:41,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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 22:59:41,297 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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 22:59:41,297 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 120 flow. Second operand 3 states and 357 transitions. [2023-08-03 22:59:41,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 57 transitions, 259 flow [2023-08-03 22:59:41,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 57 transitions, 252 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 22:59:41,298 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 134 flow [2023-08-03 22:59:41,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2023-08-03 22:59:41,298 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2023-08-03 22:59:41,299 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 134 flow [2023-08-03 22:59:41,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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 22:59:41,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 22:59:41,299 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 22:59:41,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-03 22:59:41,299 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 22:59:41,299 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 22:59:41,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1037450882, now seen corresponding path program 1 times [2023-08-03 22:59:41,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 22:59:41,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114333068] [2023-08-03 22:59:41,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 22:59:41,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 22:59:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 22:59:41,322 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 22:59:41,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 22:59:41,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114333068] [2023-08-03 22:59:41,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114333068] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 22:59:41,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 22:59:41,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 22:59:41,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289756294] [2023-08-03 22:59:41,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 22:59:41,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 22:59:41,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 22:59:41,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 22:59:41,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 22:59:41,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 219 [2023-08-03 22:59:41,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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 22:59:41,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 22:59:41,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 219 [2023-08-03 22:59:41,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 22:59:43,105 INFO L124 PetriNetUnfolderBase]: 16138/22455 cut-off events. [2023-08-03 22:59:43,105 INFO L125 PetriNetUnfolderBase]: For 1577/1577 co-relation queries the response was YES. [2023-08-03 22:59:43,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47750 conditions, 22455 events. 16138/22455 cut-off events. For 1577/1577 co-relation queries the response was YES. Maximal size of possible extension queue 967. Compared 133652 event pairs, 12146 based on Foata normal form. 0/19191 useless extension candidates. Maximal degree in co-relation 22445. Up to 21409 conditions per place. [2023-08-03 22:59:43,195 INFO L140 encePairwiseOnDemand]: 215/219 looper letters, 45 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-08-03 22:59:43,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 255 flow [2023-08-03 22:59:43,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 22:59:43,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 22:59:43,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2023-08-03 22:59:43,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5220700152207002 [2023-08-03 22:59:43,196 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 343 transitions. [2023-08-03 22:59:43,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 343 transitions. [2023-08-03 22:59:43,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 22:59:43,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 343 transitions. [2023-08-03 22:59:43,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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 22:59:43,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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 22:59:43,199 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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 22:59:43,199 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 134 flow. Second operand 3 states and 343 transitions. [2023-08-03 22:59:43,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 255 flow [2023-08-03 22:59:43,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 54 transitions, 251 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 22:59:43,201 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 145 flow [2023-08-03 22:59:43,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2023-08-03 22:59:43,201 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 9 predicate places. [2023-08-03 22:59:43,201 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 145 flow [2023-08-03 22:59:43,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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 22:59:43,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 22:59:43,202 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 22:59:43,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-03 22:59:43,202 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 22:59:43,202 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 22:59:43,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1068058987, now seen corresponding path program 1 times [2023-08-03 22:59:43,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 22:59:43,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655293117] [2023-08-03 22:59:43,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 22:59:43,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 22:59:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 22:59:43,213 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 22:59:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 22:59:43,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 22:59:43,225 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 22:59:43,225 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-03 22:59:43,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-03 22:59:43,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-03 22:59:43,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-03 22:59:43,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-03 22:59:43,225 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-03 22:59:43,226 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2023-08-03 22:59:43,228 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 22:59:43,228 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 22:59:43,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 10:59:43 BasicIcfg [2023-08-03 22:59:43,261 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 22:59:43,261 INFO L158 Benchmark]: Toolchain (without parser) took 19336.78ms. Allocated memory was 362.8MB in the beginning and 3.7GB in the end (delta: 3.4GB). Free memory was 324.1MB in the beginning and 2.1GB in the end (delta: -1.8GB). Peak memory consumption was 1.6GB. Max. memory is 16.0GB. [2023-08-03 22:59:43,262 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 362.8MB. Free memory is still 312.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 22:59:43,262 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.58ms. Allocated memory is still 362.8MB. Free memory was 324.1MB in the beginning and 300.2MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-03 22:59:43,262 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.00ms. Allocated memory is still 362.8MB. Free memory was 300.2MB in the beginning and 297.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-03 22:59:43,262 INFO L158 Benchmark]: Boogie Preprocessor took 41.98ms. Allocated memory is still 362.8MB. Free memory was 297.0MB in the beginning and 294.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 22:59:43,262 INFO L158 Benchmark]: RCFGBuilder took 449.26ms. Allocated memory is still 362.8MB. Free memory was 294.9MB in the beginning and 257.2MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-08-03 22:59:43,262 INFO L158 Benchmark]: TraceAbstraction took 18377.64ms. Allocated memory was 362.8MB in the beginning and 3.7GB in the end (delta: 3.4GB). Free memory was 256.2MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 1.5GB. Max. memory is 16.0GB. [2023-08-03 22:59:43,263 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 362.8MB. Free memory is still 312.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 410.58ms. Allocated memory is still 362.8MB. Free memory was 324.1MB in the beginning and 300.2MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 53.00ms. Allocated memory is still 362.8MB. Free memory was 300.2MB in the beginning and 297.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 41.98ms. Allocated memory is still 362.8MB. Free memory was 297.0MB in the beginning and 294.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 449.26ms. Allocated memory is still 362.8MB. Free memory was 294.9MB in the beginning and 257.2MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 18377.64ms. Allocated memory was 362.8MB in the beginning and 3.7GB in the end (delta: 3.4GB). Free memory was 256.2MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 1.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 82 PlacesBefore, 23 PlacesAfterwards, 78 TransitionsBefore, 18 TransitionsAfterwards, 656 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 22 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 65 TotalNumberOfCompositions, 1330 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 753, independent: 671, independent conditional: 0, independent unconditional: 671, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 344, independent: 332, independent conditional: 0, independent unconditional: 332, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 753, independent: 339, independent conditional: 0, independent unconditional: 339, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 344, unknown conditional: 0, unknown unconditional: 344] , Statistics on independence cache: Total cache size (in pairs): 32, Positive cache size: 26, Positive conditional cache size: 0, Positive unconditional cache size: 26, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 104 PlacesBefore, 42 PlacesAfterwards, 96 TransitionsBefore, 33 TransitionsAfterwards, 1884 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 69 TotalNumberOfCompositions, 6391 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2889, independent: 2694, independent conditional: 0, independent unconditional: 2694, dependent: 195, dependent conditional: 0, dependent unconditional: 195, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 952, independent: 923, independent conditional: 0, independent unconditional: 923, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2889, independent: 1771, independent conditional: 0, independent unconditional: 1771, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 952, unknown conditional: 0, unknown unconditional: 952] , Statistics on independence cache: Total cache size (in pairs): 183, Positive cache size: 166, Positive conditional cache size: 0, Positive unconditional cache size: 166, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 127 PlacesBefore, 48 PlacesAfterwards, 122 TransitionsBefore, 40 TransitionsAfterwards, 3584 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 96 TotalNumberOfCompositions, 10993 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4276, independent: 4040, independent conditional: 0, independent unconditional: 4040, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1807, independent: 1762, independent conditional: 0, independent unconditional: 1762, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4276, independent: 2278, independent conditional: 0, independent unconditional: 2278, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 1807, unknown conditional: 0, unknown unconditional: 1807] , Statistics on independence cache: Total cache size (in pairs): 210, Positive cache size: 190, Positive conditional cache size: 0, Positive unconditional cache size: 190, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: 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_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L826] 0 pthread_t t0[2]; [L827] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L827] COND TRUE 0 asdf<2 [L827] FCALL, FORK 0 pthread_create(&t0[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t0[asdf], ((void *)0), P0, ((void *)0))=-4, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L827] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L827] COND TRUE 0 asdf<2 [L827] FCALL, FORK 0 pthread_create(&t0[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t0[asdf], ((void *)0), P0, ((void *)0))=-3, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L827] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L827] COND FALSE 0 !(asdf<2) [L828] 0 pthread_t t1[2]; [L829] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L829] COND TRUE 0 asdf<2 [L829] FCALL, FORK 0 pthread_create(&t1[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1[asdf], ((void *)0), P1, ((void *)0))=-2, t0={5:0}, t1={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L774] 3 x$w_buff1 = x$w_buff0 [L775] 3 x$w_buff0 = 1 [L776] 3 x$w_buff1_used = x$w_buff0_used [L777] 3 x$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 3 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L829] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L829] COND TRUE 0 asdf<2 [L829] FCALL, FORK 0 pthread_create(&t1[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1[asdf], ((void *)0), P1, ((void *)0))=-1, t0={5:0}, t1={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L774] 4 x$w_buff1 = x$w_buff0 [L775] 4 x$w_buff0 = 1 [L776] 4 x$w_buff1_used = x$w_buff0_used [L777] 4 x$w_buff0_used = (_Bool)1 [L778] CALL 4 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND TRUE 4 !expression [L19] 4 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=1, x$w_buff1_used=1, x=0, y=0] - UnprovableResult [Line: 19]: 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 5 procedures, 120 locations, 5 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: 2.8s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 36 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=54occurred 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, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 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 7 procedures, 138 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: 4.9s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 155 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 117 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 320 IncrementalHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 8 mSDtfsCounter, 320 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=2, InterpolantAutomatonStates: 16, 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.2s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 160 SizeOfPredicates, 0 NumberOfNonLiveVariables, 296 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 42/50 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 7 procedures, 138 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: 10.6s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 93 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 288 IncrementalHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 9 mSDtfsCounter, 288 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=4, InterpolantAutomatonStates: 13, 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, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 53 ConstructedInterpolants, 0 QuantifiedInterpolants, 111 SizeOfPredicates, 0 NumberOfNonLiveVariables, 152 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 12/15 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 22:59:43,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...