/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_mix022_tso_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 23:24:19,613 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 23:24:19,687 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 23:24:19,691 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 23:24:19,691 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 23:24:19,692 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 23:24:19,692 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 23:24:19,719 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 23:24:19,720 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 23:24:19,723 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 23:24:19,724 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 23:24:19,724 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 23:24:19,725 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 23:24:19,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 23:24:19,726 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 23:24:19,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 23:24:19,726 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 23:24:19,727 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 23:24:19,727 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 23:24:19,727 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 23:24:19,727 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 23:24:19,728 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 23:24:19,728 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 23:24:19,728 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 23:24:19,729 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 23:24:19,729 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 23:24:19,730 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 23:24:19,730 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 23:24:19,730 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 23:24:19,730 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 23:24:19,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 23:24:19,732 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 23:24:19,732 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 23:24:19,732 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 23:24:19,732 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 23:24:19,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 23:24:19,732 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 23:24:19,732 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 23:24:19,733 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 23:24:19,733 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 23:24:19,733 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 23:24:19,733 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-03 23:24:19,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 23:24:20,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 23:24:20,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 23:24:20,010 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 23:24:20,010 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 23:24:20,011 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix022_tso_bound2.i [2023-08-03 23:24:21,101 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 23:24:21,324 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 23:24:21,325 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix022_tso_bound2.i [2023-08-03 23:24:21,342 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99252bef1/48973fe0c31543dc95663fd5094c71ff/FLAG5697b6e77 [2023-08-03 23:24:21,355 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99252bef1/48973fe0c31543dc95663fd5094c71ff [2023-08-03 23:24:21,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 23:24:21,359 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 23:24:21,361 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 23:24:21,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 23:24:21,371 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 23:24:21,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 11:24:21" (1/1) ... [2023-08-03 23:24:21,373 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57431aa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:24:21, skipping insertion in model container [2023-08-03 23:24:21,373 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 11:24:21" (1/1) ... [2023-08-03 23:24:21,432 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 23:24:21,601 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_mix022_tso_bound2.i[944,957] [2023-08-03 23:24:21,825 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 23:24:21,849 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 23:24:21,859 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_mix022_tso_bound2.i[944,957] [2023-08-03 23:24:21,879 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 23:24:21,881 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 23:24:21,915 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 23:24:21,944 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 23:24:21,945 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 23:24:21,950 INFO L206 MainTranslator]: Completed translation [2023-08-03 23:24:21,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:24:21 WrapperNode [2023-08-03 23:24:21,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 23:24:21,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 23:24:21,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 23:24:21,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 23:24:21,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:24:21" (1/1) ... [2023-08-03 23:24:21,991 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:24:21" (1/1) ... [2023-08-03 23:24:22,017 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 166 [2023-08-03 23:24:22,018 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 23:24:22,019 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 23:24:22,019 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 23:24:22,019 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 23:24:22,031 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:24:21" (1/1) ... [2023-08-03 23:24:22,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:24:21" (1/1) ... [2023-08-03 23:24:22,035 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:24:21" (1/1) ... [2023-08-03 23:24:22,035 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:24:21" (1/1) ... [2023-08-03 23:24:22,043 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:24:21" (1/1) ... [2023-08-03 23:24:22,084 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:24:21" (1/1) ... [2023-08-03 23:24:22,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:24:21" (1/1) ... [2023-08-03 23:24:22,087 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:24:21" (1/1) ... [2023-08-03 23:24:22,090 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 23:24:22,091 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 23:24:22,091 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 23:24:22,091 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 23:24:22,092 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:24:21" (1/1) ... [2023-08-03 23:24:22,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 23:24:22,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:24:22,140 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-03 23:24:22,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-03 23:24:22,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 23:24:22,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 23:24:22,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 23:24:22,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 23:24:22,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 23:24:22,183 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-03 23:24:22,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-03 23:24:22,184 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-03 23:24:22,184 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-03 23:24:22,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 23:24:22,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 23:24:22,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 23:24:22,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 23:24:22,186 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-03 23:24:22,333 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 23:24:22,335 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 23:24:22,688 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 23:24:22,830 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 23:24:22,830 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-03 23:24:22,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 11:24:22 BoogieIcfgContainer [2023-08-03 23:24:22,832 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 23:24:22,835 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 23:24:22,835 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 23:24:22,838 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 23:24:22,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 11:24:21" (1/3) ... [2023-08-03 23:24:22,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f02353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 11:24:22, skipping insertion in model container [2023-08-03 23:24:22,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:24:21" (2/3) ... [2023-08-03 23:24:22,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f02353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 11:24:22, skipping insertion in model container [2023-08-03 23:24:22,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 11:24:22" (3/3) ... [2023-08-03 23:24:22,843 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix022_tso_bound2.i [2023-08-03 23:24:22,851 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 23:24:22,859 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 23:24:22,860 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 23:24:22,860 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 23:24:22,901 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 23:24:22,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 103 transitions, 216 flow [2023-08-03 23:24:23,026 INFO L124 PetriNetUnfolderBase]: 14/220 cut-off events. [2023-08-03 23:24:23,026 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:24:23,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 220 events. 14/220 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 614 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 129. Up to 8 conditions per place. [2023-08-03 23:24:23,048 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 103 transitions, 216 flow [2023-08-03 23:24:23,052 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 76 transitions, 162 flow [2023-08-03 23:24:23,055 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 23:24:23,076 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 76 transitions, 162 flow [2023-08-03 23:24:23,078 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 76 transitions, 162 flow [2023-08-03 23:24:23,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 76 transitions, 162 flow [2023-08-03 23:24:23,107 INFO L124 PetriNetUnfolderBase]: 2/112 cut-off events. [2023-08-03 23:24:23,107 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:24:23,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 163 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 75. Up to 4 conditions per place. [2023-08-03 23:24:23,109 INFO L119 LiptonReduction]: Number of co-enabled transitions 656 [2023-08-03 23:24:25,590 INFO L134 LiptonReduction]: Checked pairs total: 1699 [2023-08-03 23:24:25,590 INFO L136 LiptonReduction]: Total number of compositions: 62 [2023-08-03 23:24:25,603 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-03 23:24:25,608 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;@7694d4e2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 23:24:25,609 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-03 23:24:25,613 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 23:24:25,613 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-08-03 23:24:25,613 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:24:25,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:24:25,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 23:24:25,614 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 23:24:25,618 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:24:25,619 INFO L85 PathProgramCache]: Analyzing trace with hash 450191491, now seen corresponding path program 1 times [2023-08-03 23:24:25,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:24:25,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489140523] [2023-08-03 23:24:25,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:24:25,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:24:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:24:25,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 23:24:25,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:24:25,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489140523] [2023-08-03 23:24:25,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489140523] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:24:25,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:24:25,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 23:24:25,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771415125] [2023-08-03 23:24:25,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:24:25,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:24:25,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:24:25,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:24:25,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:24:25,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 165 [2023-08-03 23:24:25,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 19 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:25,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:24:25,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 165 [2023-08-03 23:24:25,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:24:26,028 INFO L124 PetriNetUnfolderBase]: 65/145 cut-off events. [2023-08-03 23:24:26,028 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-03 23:24:26,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 145 events. 65/145 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 483 event pairs, 48 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 279. Up to 126 conditions per place. [2023-08-03 23:24:26,031 INFO L140 encePairwiseOnDemand]: 162/165 looper letters, 17 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2023-08-03 23:24:26,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 23 transitions, 94 flow [2023-08-03 23:24:26,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:24:26,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:24:26,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2023-08-03 23:24:26,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2023-08-03 23:24:26,044 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 275 transitions. [2023-08-03 23:24:26,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 275 transitions. [2023-08-03 23:24:26,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:24:26,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 275 transitions. [2023-08-03 23:24:26,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:26,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:26,055 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:26,057 INFO L175 Difference]: Start difference. First operand has 24 places, 19 transitions, 48 flow. Second operand 3 states and 275 transitions. [2023-08-03 23:24:26,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 23 transitions, 94 flow [2023-08-03 23:24:26,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 23 transitions, 94 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 23:24:26,061 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 56 flow [2023-08-03 23:24:26,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=27, PETRI_TRANSITIONS=19} [2023-08-03 23:24:26,065 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 3 predicate places. [2023-08-03 23:24:26,065 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 19 transitions, 56 flow [2023-08-03 23:24:26,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:26,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:24:26,066 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 23:24:26,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 23:24:26,066 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 23:24:26,067 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:24:26,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1066476441, now seen corresponding path program 1 times [2023-08-03 23:24:26,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:24:26,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200872038] [2023-08-03 23:24:26,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:24:26,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:24:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:24:26,105 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 23:24:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:24:26,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 23:24:26,149 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 23:24:26,150 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-03 23:24:26,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-03 23:24:26,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 23:24:26,155 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 23:24:26,158 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (1/2) [2023-08-03 23:24:26,159 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 23:24:26,159 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 23:24:26,193 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 23:24:26,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 121 transitions, 266 flow [2023-08-03 23:24:26,281 INFO L124 PetriNetUnfolderBase]: 30/457 cut-off events. [2023-08-03 23:24:26,282 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 23:24:26,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 457 events. 30/457 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1943 event pairs, 0 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 329. Up to 18 conditions per place. [2023-08-03 23:24:26,284 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 121 transitions, 266 flow [2023-08-03 23:24:26,285 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 212 flow [2023-08-03 23:24:26,286 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 23:24:26,286 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 212 flow [2023-08-03 23:24:26,286 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 212 flow [2023-08-03 23:24:26,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 212 flow [2023-08-03 23:24:26,308 INFO L124 PetriNetUnfolderBase]: 3/214 cut-off events. [2023-08-03 23:24:26,308 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 23:24:26,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 214 events. 3/214 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 551 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 167. Up to 9 conditions per place. [2023-08-03 23:24:26,311 INFO L119 LiptonReduction]: Number of co-enabled transitions 1884 [2023-08-03 23:24:28,765 INFO L134 LiptonReduction]: Checked pairs total: 6514 [2023-08-03 23:24:28,765 INFO L136 LiptonReduction]: Total number of compositions: 67 [2023-08-03 23:24:28,767 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-03 23:24:28,768 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;@7694d4e2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 23:24:28,769 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-03 23:24:28,774 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 23:24:28,774 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2023-08-03 23:24:28,774 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-03 23:24:28,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:24:28,774 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2023-08-03 23:24:28,775 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 23:24:28,775 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:24:28,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1636687100, now seen corresponding path program 1 times [2023-08-03 23:24:28,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:24:28,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126282232] [2023-08-03 23:24:28,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:24:28,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:24:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:24:28,858 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-03 23:24:28,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:24:28,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126282232] [2023-08-03 23:24:28,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126282232] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:24:28,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:24:28,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 23:24:28,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729680450] [2023-08-03 23:24:28,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:24:28,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:24:28,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:24:28,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:24:28,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:24:28,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 188 [2023-08-03 23:24:28,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:28,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:24:28,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 188 [2023-08-03 23:24:28,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:24:29,662 INFO L124 PetriNetUnfolderBase]: 4261/6497 cut-off events. [2023-08-03 23:24:29,662 INFO L125 PetriNetUnfolderBase]: For 444/444 co-relation queries the response was YES. [2023-08-03 23:24:29,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13108 conditions, 6497 events. 4261/6497 cut-off events. For 444/444 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 39295 event pairs, 2944 based on Foata normal form. 0/5921 useless extension candidates. Maximal degree in co-relation 2891. Up to 6018 conditions per place. [2023-08-03 23:24:29,714 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 28 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2023-08-03 23:24:29,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 38 transitions, 160 flow [2023-08-03 23:24:29,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:24:29,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:24:29,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2023-08-03 23:24:29,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5656028368794326 [2023-08-03 23:24:29,716 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 319 transitions. [2023-08-03 23:24:29,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 319 transitions. [2023-08-03 23:24:29,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:24:29,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 319 transitions. [2023-08-03 23:24:29,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:29,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:29,720 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:29,720 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 90 flow. Second operand 3 states and 319 transitions. [2023-08-03 23:24:29,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 38 transitions, 160 flow [2023-08-03 23:24:29,722 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 23:24:29,723 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 98 flow [2023-08-03 23:24:29,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, 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 23:24:29,724 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2023-08-03 23:24:29,724 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 98 flow [2023-08-03 23:24:29,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:29,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:24:29,725 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 23:24:29,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 23:24:29,725 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 23:24:29,725 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:24:29,726 INFO L85 PathProgramCache]: Analyzing trace with hash 74067745, now seen corresponding path program 1 times [2023-08-03 23:24:29,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:24:29,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915111226] [2023-08-03 23:24:29,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:24:29,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:24:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:24:29,806 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 23:24:29,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:24:29,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915111226] [2023-08-03 23:24:29,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915111226] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:24:29,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787413474] [2023-08-03 23:24:29,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:24:29,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:24:29,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:24:29,813 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:24:29,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-03 23:24:29,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:24:29,909 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 23:24:29,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:24:29,995 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 23:24:29,995 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 23:24:29,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787413474] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:24:29,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 23:24:29,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 23:24:29,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760141649] [2023-08-03 23:24:29,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:24:29,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 23:24:29,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:24:29,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 23:24:29,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 23:24:30,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 188 [2023-08-03 23:24:30,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:30,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:24:30,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 188 [2023-08-03 23:24:30,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:24:30,768 INFO L124 PetriNetUnfolderBase]: 4237/6493 cut-off events. [2023-08-03 23:24:30,769 INFO L125 PetriNetUnfolderBase]: For 344/344 co-relation queries the response was YES. [2023-08-03 23:24:30,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13043 conditions, 6493 events. 4237/6493 cut-off events. For 344/344 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 39758 event pairs, 1900 based on Foata normal form. 16/5949 useless extension candidates. Maximal degree in co-relation 3469. Up to 5935 conditions per place. [2023-08-03 23:24:30,814 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 33 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2023-08-03 23:24:30,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 192 flow [2023-08-03 23:24:30,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 23:24:30,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 23:24:30,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 513 transitions. [2023-08-03 23:24:30,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5457446808510639 [2023-08-03 23:24:30,816 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 513 transitions. [2023-08-03 23:24:30,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 513 transitions. [2023-08-03 23:24:30,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:24:30,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 513 transitions. [2023-08-03 23:24:30,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:30,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:30,821 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:30,821 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 98 flow. Second operand 5 states and 513 transitions. [2023-08-03 23:24:30,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 192 flow [2023-08-03 23:24:30,822 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 23:24:30,823 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 112 flow [2023-08-03 23:24:30,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, 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 23:24:30,823 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2023-08-03 23:24:30,824 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 112 flow [2023-08-03 23:24:30,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:30,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:24:30,824 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:24:30,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-03 23:24:31,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:24:31,031 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 23:24:31,031 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:24:31,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1924202239, now seen corresponding path program 1 times [2023-08-03 23:24:31,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:24:31,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188373266] [2023-08-03 23:24:31,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:24:31,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:24:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:24:31,126 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-03 23:24:31,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:24:31,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188373266] [2023-08-03 23:24:31,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188373266] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:24:31,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855947619] [2023-08-03 23:24:31,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:24:31,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:24:31,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:24:31,138 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:24:31,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-03 23:24:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:24:31,249 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 23:24:31,250 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:24:31,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-03 23:24:31,268 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 23:24:31,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-03 23:24:31,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855947619] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 23:24:31,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 23:24:31,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 23:24:31,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163150334] [2023-08-03 23:24:31,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 23:24:31,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 23:24:31,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:24:31,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 23:24:31,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:24:31,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 188 [2023-08-03 23:24:31,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:31,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:24:31,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 188 [2023-08-03 23:24:31,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:24:31,897 INFO L124 PetriNetUnfolderBase]: 3602/5418 cut-off events. [2023-08-03 23:24:31,897 INFO L125 PetriNetUnfolderBase]: For 376/376 co-relation queries the response was YES. [2023-08-03 23:24:31,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10944 conditions, 5418 events. 3602/5418 cut-off events. For 376/376 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 31228 event pairs, 1520 based on Foata normal form. 4/4974 useless extension candidates. Maximal degree in co-relation 2889. Up to 4961 conditions per place. [2023-08-03 23:24:31,942 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 33 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2023-08-03 23:24:31,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 198 flow [2023-08-03 23:24:31,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 23:24:31,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 23:24:31,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 417 transitions. [2023-08-03 23:24:31,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5545212765957447 [2023-08-03 23:24:31,944 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 417 transitions. [2023-08-03 23:24:31,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 417 transitions. [2023-08-03 23:24:31,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:24:31,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 417 transitions. [2023-08-03 23:24:31,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:31,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:31,948 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:31,948 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 112 flow. Second operand 4 states and 417 transitions. [2023-08-03 23:24:31,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 198 flow [2023-08-03 23:24:31,950 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 23:24:31,951 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 105 flow [2023-08-03 23:24:31,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, 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 23:24:31,953 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2023-08-03 23:24:31,953 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 105 flow [2023-08-03 23:24:31,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:31,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:24:31,954 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:24:31,958 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 23:24:32,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:24:32,159 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 23:24:32,159 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:24:32,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1463805893, now seen corresponding path program 1 times [2023-08-03 23:24:32,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:24:32,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809099420] [2023-08-03 23:24:32,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:24:32,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:24:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:24:32,248 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 23:24:32,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:24:32,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809099420] [2023-08-03 23:24:32,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809099420] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:24:32,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475470813] [2023-08-03 23:24:32,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:24:32,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:24:32,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:24:32,251 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:24:32,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-03 23:24:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:24:32,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 23:24:32,338 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:24:32,357 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 23:24:32,357 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 23:24:32,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475470813] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:24:32,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 23:24:32,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 23:24:32,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221510855] [2023-08-03 23:24:32,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:24:32,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 23:24:32,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:24:32,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 23:24:32,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:24:32,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 188 [2023-08-03 23:24:32,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:32,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:24:32,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 188 [2023-08-03 23:24:32,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:24:32,769 INFO L124 PetriNetUnfolderBase]: 1778/2847 cut-off events. [2023-08-03 23:24:32,769 INFO L125 PetriNetUnfolderBase]: For 261/261 co-relation queries the response was YES. [2023-08-03 23:24:32,775 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 156. Compared 15525 event pairs, 42 based on Foata normal form. 576/3167 useless extension candidates. Maximal degree in co-relation 2697. Up to 2240 conditions per place. [2023-08-03 23:24:32,777 INFO L140 encePairwiseOnDemand]: 186/188 looper letters, 0 selfloop transitions, 0 changer transitions 49/49 dead transitions. [2023-08-03 23:24:32,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 221 flow [2023-08-03 23:24:32,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 23:24:32,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 23:24:32,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 427 transitions. [2023-08-03 23:24:32,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5678191489361702 [2023-08-03 23:24:32,780 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 427 transitions. [2023-08-03 23:24:32,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 427 transitions. [2023-08-03 23:24:32,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:24:32,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 427 transitions. [2023-08-03 23:24:32,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:32,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:32,783 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:32,783 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 105 flow. Second operand 4 states and 427 transitions. [2023-08-03 23:24:32,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 221 flow [2023-08-03 23:24:32,787 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 23:24:32,788 INFO L231 Difference]: Finished difference. Result has 47 places, 0 transitions, 0 flow [2023-08-03 23:24:32,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, 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 23:24:32,789 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2023-08-03 23:24:32,789 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 0 transitions, 0 flow [2023-08-03 23:24:32,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:32,789 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-03 23:24:32,789 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-03 23:24:32,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-03 23:24:32,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:24:32,994 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-03 23:24:32,995 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE,SAFE (1/2) [2023-08-03 23:24:32,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 121 transitions, 266 flow [2023-08-03 23:24:33,032 INFO L124 PetriNetUnfolderBase]: 30/457 cut-off events. [2023-08-03 23:24:33,032 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 23:24:33,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 457 events. 30/457 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1943 event pairs, 0 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 329. Up to 18 conditions per place. [2023-08-03 23:24:33,033 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 121 transitions, 266 flow [2023-08-03 23:24:33,035 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 120 transitions, 260 flow [2023-08-03 23:24:33,035 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 23:24:33,035 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 120 transitions, 260 flow [2023-08-03 23:24:33,035 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 120 transitions, 260 flow [2023-08-03 23:24:33,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 120 transitions, 260 flow [2023-08-03 23:24:33,068 INFO L124 PetriNetUnfolderBase]: 30/456 cut-off events. [2023-08-03 23:24:33,068 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-03 23:24:33,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 456 events. 30/456 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1939 event pairs, 0 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 327. Up to 18 conditions per place. [2023-08-03 23:24:33,075 INFO L119 LiptonReduction]: Number of co-enabled transitions 3584 [2023-08-03 23:24:36,501 INFO L134 LiptonReduction]: Checked pairs total: 10629 [2023-08-03 23:24:36,501 INFO L136 LiptonReduction]: Total number of compositions: 98 [2023-08-03 23:24:36,503 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 23:24:36,503 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;@7694d4e2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 23:24:36,503 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-03 23:24:36,505 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 23:24:36,505 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2023-08-03 23:24:36,505 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:24:36,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:24:36,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 23:24:36,506 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 23:24:36,506 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:24:36,506 INFO L85 PathProgramCache]: Analyzing trace with hash 739786766, now seen corresponding path program 1 times [2023-08-03 23:24:36,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:24:36,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231132471] [2023-08-03 23:24:36,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:24:36,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:24:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:24:36,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 23:24:36,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:24:36,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231132471] [2023-08-03 23:24:36,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231132471] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:24:36,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:24:36,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 23:24:36,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771475963] [2023-08-03 23:24:36,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:24:36,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:24:36,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:24:36,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:24:36,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:24:36,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 219 [2023-08-03 23:24:36,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:36,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:24:36,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 219 [2023-08-03 23:24:36,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:24:38,732 INFO L124 PetriNetUnfolderBase]: 16566/23826 cut-off events. [2023-08-03 23:24:38,733 INFO L125 PetriNetUnfolderBase]: For 444/444 co-relation queries the response was YES. [2023-08-03 23:24:38,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47074 conditions, 23826 events. 16566/23826 cut-off events. For 444/444 co-relation queries the response was YES. Maximal size of possible extension queue 898. Compared 149611 event pairs, 12024 based on Foata normal form. 0/20198 useless extension candidates. Maximal degree in co-relation 10378. Up to 22623 conditions per place. [2023-08-03 23:24:38,840 INFO L140 encePairwiseOnDemand]: 216/219 looper letters, 33 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-08-03 23:24:38,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 42 transitions, 174 flow [2023-08-03 23:24:38,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:24:38,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:24:38,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2023-08-03 23:24:38,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4931506849315068 [2023-08-03 23:24:38,842 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2023-08-03 23:24:38,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2023-08-03 23:24:38,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:24:38,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2023-08-03 23:24:38,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:38,844 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 23:24:38,846 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 23:24:38,846 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 94 flow. Second operand 3 states and 324 transitions. [2023-08-03 23:24:38,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 42 transitions, 174 flow [2023-08-03 23:24:38,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 42 transitions, 172 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-03 23:24:38,848 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 104 flow [2023-08-03 23:24:38,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-08-03 23:24:38,850 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 3 predicate places. [2023-08-03 23:24:38,850 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 104 flow [2023-08-03 23:24:38,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:38,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:24:38,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:24:38,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-03 23:24:38,850 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 23:24:38,851 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:24:38,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1839859939, now seen corresponding path program 1 times [2023-08-03 23:24:38,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:24:38,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769618281] [2023-08-03 23:24:38,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:24:38,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:24:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:24:38,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 23:24:38,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:24:38,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769618281] [2023-08-03 23:24:38,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769618281] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:24:38,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435183268] [2023-08-03 23:24:38,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:24:38,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:24:38,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:24:38,899 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:24:38,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-03 23:24:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:24:38,974 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 23:24:38,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:24:38,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 23:24:38,995 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 23:24:39,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 23:24:39,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435183268] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 23:24:39,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 23:24:39,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 23:24:39,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170759095] [2023-08-03 23:24:39,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 23:24:39,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 23:24:39,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:24:39,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 23:24:39,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:24:39,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 219 [2023-08-03 23:24:39,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 104 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:39,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:24:39,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 219 [2023-08-03 23:24:39,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:24:40,826 INFO L124 PetriNetUnfolderBase]: 13986/19822 cut-off events. [2023-08-03 23:24:40,826 INFO L125 PetriNetUnfolderBase]: For 280/280 co-relation queries the response was YES. [2023-08-03 23:24:40,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39133 conditions, 19822 events. 13986/19822 cut-off events. For 280/280 co-relation queries the response was YES. Maximal size of possible extension queue 825. Compared 118839 event pairs, 6732 based on Foata normal form. 4/16962 useless extension candidates. Maximal degree in co-relation 10381. Up to 18761 conditions per place. [2023-08-03 23:24:40,931 INFO L140 encePairwiseOnDemand]: 215/219 looper letters, 38 selfloop transitions, 3 changer transitions 1/49 dead transitions. [2023-08-03 23:24:40,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 210 flow [2023-08-03 23:24:40,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 23:24:40,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 23:24:40,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 423 transitions. [2023-08-03 23:24:40,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4828767123287671 [2023-08-03 23:24:40,934 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 423 transitions. [2023-08-03 23:24:40,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 423 transitions. [2023-08-03 23:24:40,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:24:40,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 423 transitions. [2023-08-03 23:24:40,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:40,936 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 23:24:40,937 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 23:24:40,937 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 104 flow. Second operand 4 states and 423 transitions. [2023-08-03 23:24:40,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 210 flow [2023-08-03 23:24:40,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 49 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 23:24:40,938 INFO L231 Difference]: Finished difference. Result has 53 places, 38 transitions, 116 flow [2023-08-03 23:24:40,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=53, PETRI_TRANSITIONS=38} [2023-08-03 23:24:40,939 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2023-08-03 23:24:40,939 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 116 flow [2023-08-03 23:24:40,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:40,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:24:40,939 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:24:40,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-03 23:24:41,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:24:41,145 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 23:24:41,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:24:41,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1044931975, now seen corresponding path program 1 times [2023-08-03 23:24:41,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:24:41,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413367142] [2023-08-03 23:24:41,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:24:41,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:24:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:24:41,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 23:24:41,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:24:41,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413367142] [2023-08-03 23:24:41,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413367142] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:24:41,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:24:41,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 23:24:41,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921364028] [2023-08-03 23:24:41,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:24:41,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:24:41,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:24:41,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:24:41,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:24:41,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 219 [2023-08-03 23:24:41,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 38 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:41,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:24:41,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 219 [2023-08-03 23:24:41,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:24:42,898 INFO L124 PetriNetUnfolderBase]: 12554/17767 cut-off events. [2023-08-03 23:24:42,898 INFO L125 PetriNetUnfolderBase]: For 384/384 co-relation queries the response was YES. [2023-08-03 23:24:42,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35126 conditions, 17767 events. 12554/17767 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 768. Compared 104552 event pairs, 3066 based on Foata normal form. 0/15511 useless extension candidates. Maximal degree in co-relation 16421. Up to 16065 conditions per place. [2023-08-03 23:24:42,973 INFO L140 encePairwiseOnDemand]: 214/219 looper letters, 43 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2023-08-03 23:24:42,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 53 transitions, 243 flow [2023-08-03 23:24:42,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:24:42,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:24:42,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2023-08-03 23:24:42,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5235920852359208 [2023-08-03 23:24:42,976 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 344 transitions. [2023-08-03 23:24:42,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 344 transitions. [2023-08-03 23:24:42,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:24:42,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 344 transitions. [2023-08-03 23:24:42,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:42,978 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 23:24:42,979 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 23:24:42,979 INFO L175 Difference]: Start difference. First operand has 53 places, 38 transitions, 116 flow. Second operand 3 states and 344 transitions. [2023-08-03 23:24:42,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 53 transitions, 243 flow [2023-08-03 23:24:42,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 236 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 23:24:42,980 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 130 flow [2023-08-03 23:24:42,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2023-08-03 23:24:42,983 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2023-08-03 23:24:42,983 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 130 flow [2023-08-03 23:24:42,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:42,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:24:42,984 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:24:42,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-03 23:24:42,984 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 23:24:42,984 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:24:42,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1044913637, now seen corresponding path program 1 times [2023-08-03 23:24:42,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:24:42,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014154164] [2023-08-03 23:24:42,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:24:42,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:24:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:24:43,038 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 23:24:43,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:24:43,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014154164] [2023-08-03 23:24:43,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014154164] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:24:43,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:24:43,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 23:24:43,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420765940] [2023-08-03 23:24:43,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:24:43,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:24:43,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:24:43,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:24:43,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:24:43,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 219 [2023-08-03 23:24:43,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:43,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:24:43,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 219 [2023-08-03 23:24:43,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:24:44,544 INFO L124 PetriNetUnfolderBase]: 12458/17559 cut-off events. [2023-08-03 23:24:44,544 INFO L125 PetriNetUnfolderBase]: For 1241/1241 co-relation queries the response was YES. [2023-08-03 23:24:44,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37254 conditions, 17559 events. 12458/17559 cut-off events. For 1241/1241 co-relation queries the response was YES. Maximal size of possible extension queue 771. Compared 103861 event pairs, 9330 based on Foata normal form. 0/15319 useless extension candidates. Maximal degree in co-relation 17501. Up to 16513 conditions per place. [2023-08-03 23:24:44,629 INFO L140 encePairwiseOnDemand]: 216/219 looper letters, 43 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-08-03 23:24:44,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 247 flow [2023-08-03 23:24:44,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:24:44,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:24:44,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2023-08-03 23:24:44,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5038051750380518 [2023-08-03 23:24:44,631 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 331 transitions. [2023-08-03 23:24:44,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 331 transitions. [2023-08-03 23:24:44,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:24:44,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 331 transitions. [2023-08-03 23:24:44,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:44,634 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 23:24:44,634 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 23:24:44,634 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 130 flow. Second operand 3 states and 331 transitions. [2023-08-03 23:24:44,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 247 flow [2023-08-03 23:24:44,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 52 transitions, 243 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 23:24:44,636 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 139 flow [2023-08-03 23:24:44,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=127, 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=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2023-08-03 23:24:44,637 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 9 predicate places. [2023-08-03 23:24:44,637 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 139 flow [2023-08-03 23:24:44,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:44,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:24:44,637 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:24:44,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-03 23:24:44,637 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 23:24:44,638 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:24:44,638 INFO L85 PathProgramCache]: Analyzing trace with hash -2027938427, now seen corresponding path program 1 times [2023-08-03 23:24:44,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:24:44,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780394597] [2023-08-03 23:24:44,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:24:44,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:24:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:24:44,693 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 23:24:44,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:24:44,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780394597] [2023-08-03 23:24:44,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780394597] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:24:44,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120638452] [2023-08-03 23:24:44,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:24:44,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:24:44,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:24:44,696 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:24:44,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-03 23:24:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:24:44,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 23:24:44,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:24:44,805 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 23:24:44,805 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 23:24:44,823 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 23:24:44,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120638452] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 23:24:44,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 23:24:44,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 23:24:44,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53149460] [2023-08-03 23:24:44,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 23:24:44,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 23:24:44,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:24:44,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 23:24:44,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:24:44,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 219 [2023-08-03 23:24:44,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 98.2) internal successors, (491), 5 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:44,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:24:44,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 219 [2023-08-03 23:24:44,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:24:46,503 INFO L124 PetriNetUnfolderBase]: 11722/16103 cut-off events. [2023-08-03 23:24:46,503 INFO L125 PetriNetUnfolderBase]: For 2065/2065 co-relation queries the response was YES. [2023-08-03 23:24:46,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35575 conditions, 16103 events. 11722/16103 cut-off events. For 2065/2065 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 90600 event pairs, 4546 based on Foata normal form. 80/14711 useless extension candidates. Maximal degree in co-relation 16741. Up to 11009 conditions per place. [2023-08-03 23:24:46,607 INFO L140 encePairwiseOnDemand]: 215/219 looper letters, 60 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2023-08-03 23:24:46,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 71 transitions, 341 flow [2023-08-03 23:24:46,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 23:24:46,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 23:24:46,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 440 transitions. [2023-08-03 23:24:46,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502283105022831 [2023-08-03 23:24:46,609 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 440 transitions. [2023-08-03 23:24:46,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 440 transitions. [2023-08-03 23:24:46,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:24:46,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 440 transitions. [2023-08-03 23:24:46,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:46,612 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 23:24:46,612 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 23:24:46,612 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 139 flow. Second operand 4 states and 440 transitions. [2023-08-03 23:24:46,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 71 transitions, 341 flow [2023-08-03 23:24:46,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 71 transitions, 339 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 23:24:46,615 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 157 flow [2023-08-03 23:24:46,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2023-08-03 23:24:46,616 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 13 predicate places. [2023-08-03 23:24:46,616 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 157 flow [2023-08-03 23:24:46,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.2) internal successors, (491), 5 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:24:46,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:24:46,616 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:24:46,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-03 23:24:46,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-03 23:24:46,823 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 23:24:46,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:24:46,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1899054069, now seen corresponding path program 1 times [2023-08-03 23:24:46,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:24:46,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742039956] [2023-08-03 23:24:46,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:24:46,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:24:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:24:46,842 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 23:24:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:24:46,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 23:24:46,859 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 23:24:46,860 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-03 23:24:46,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-03 23:24:46,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-03 23:24:46,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-03 23:24:46,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-03 23:24:46,860 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-03 23:24:46,861 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2023-08-03 23:24:46,864 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 23:24:46,864 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 23:24:46,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 11:24:46 BasicIcfg [2023-08-03 23:24:46,935 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 23:24:46,935 INFO L158 Benchmark]: Toolchain (without parser) took 25576.99ms. Allocated memory was 333.4MB in the beginning and 3.5GB in the end (delta: 3.1GB). Free memory was 279.5MB in the beginning and 1.9GB in the end (delta: -1.6GB). Peak memory consumption was 1.5GB. Max. memory is 16.0GB. [2023-08-03 23:24:46,936 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 333.4MB. Free memory is still 286.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 23:24:46,936 INFO L158 Benchmark]: CACSL2BoogieTranslator took 590.43ms. Allocated memory is still 333.4MB. Free memory was 279.2MB in the beginning and 255.2MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-03 23:24:46,936 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.87ms. Allocated memory is still 333.4MB. Free memory was 255.2MB in the beginning and 252.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-03 23:24:46,937 INFO L158 Benchmark]: Boogie Preprocessor took 71.85ms. Allocated memory was 333.4MB in the beginning and 478.2MB in the end (delta: 144.7MB). Free memory was 252.3MB in the beginning and 447.8MB in the end (delta: -195.5MB). Peak memory consumption was 9.3MB. Max. memory is 16.0GB. [2023-08-03 23:24:46,937 INFO L158 Benchmark]: RCFGBuilder took 741.26ms. Allocated memory is still 478.2MB. Free memory was 447.8MB in the beginning and 406.3MB in the end (delta: 41.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. [2023-08-03 23:24:46,938 INFO L158 Benchmark]: TraceAbstraction took 24100.19ms. Allocated memory was 478.2MB in the beginning and 3.5GB in the end (delta: 3.0GB). Free memory was 405.4MB in the beginning and 1.9GB in the end (delta: -1.5GB). Peak memory consumption was 1.5GB. Max. memory is 16.0GB. [2023-08-03 23:24:46,939 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.09ms. Allocated memory is still 333.4MB. Free memory is still 286.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 590.43ms. Allocated memory is still 333.4MB. Free memory was 279.2MB in the beginning and 255.2MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 65.87ms. Allocated memory is still 333.4MB. Free memory was 255.2MB in the beginning and 252.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 71.85ms. Allocated memory was 333.4MB in the beginning and 478.2MB in the end (delta: 144.7MB). Free memory was 252.3MB in the beginning and 447.8MB in the end (delta: -195.5MB). Peak memory consumption was 9.3MB. Max. memory is 16.0GB. * RCFGBuilder took 741.26ms. Allocated memory is still 478.2MB. Free memory was 447.8MB in the beginning and 406.3MB in the end (delta: 41.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. * TraceAbstraction took 24100.19ms. Allocated memory was 478.2MB in the beginning and 3.5GB in the end (delta: 3.0GB). Free memory was 405.4MB in the beginning and 1.9GB in the end (delta: -1.5GB). Peak memory consumption was 1.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 80 PlacesBefore, 24 PlacesAfterwards, 76 TransitionsBefore, 19 TransitionsAfterwards, 656 CoEnabledTransitionPairs, 6 FixpointIterations, 33 TrivialSequentialCompositions, 20 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 62 TotalNumberOfCompositions, 1699 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1027, independent: 929, independent conditional: 0, independent unconditional: 929, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 335, independent: 324, independent conditional: 0, independent unconditional: 324, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1027, independent: 605, independent conditional: 0, independent unconditional: 605, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 335, unknown conditional: 0, unknown unconditional: 335] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 36, Positive conditional cache size: 0, Positive unconditional cache size: 36, 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.5s, 102 PlacesBefore, 42 PlacesAfterwards, 94 TransitionsBefore, 33 TransitionsAfterwards, 1884 CoEnabledTransitionPairs, 6 FixpointIterations, 33 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 67 TotalNumberOfCompositions, 6514 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2987, independent: 2791, independent conditional: 0, independent unconditional: 2791, dependent: 196, dependent conditional: 0, dependent unconditional: 196, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 921, independent: 892, independent conditional: 0, independent unconditional: 892, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2987, independent: 1899, independent conditional: 0, independent unconditional: 1899, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 921, unknown conditional: 0, unknown unconditional: 921] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 154, Positive conditional cache size: 0, Positive unconditional cache size: 154, 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: 3.5s, 125 PlacesBefore, 46 PlacesAfterwards, 120 TransitionsBefore, 37 TransitionsAfterwards, 3584 CoEnabledTransitionPairs, 6 FixpointIterations, 33 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 4 ChoiceCompositions, 98 TotalNumberOfCompositions, 10629 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3938, independent: 3707, independent conditional: 0, independent unconditional: 3707, dependent: 231, dependent conditional: 0, dependent unconditional: 231, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1843, independent: 1792, independent conditional: 0, independent unconditional: 1792, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3938, independent: 1915, independent conditional: 0, independent unconditional: 1915, dependent: 180, dependent conditional: 0, dependent unconditional: 180, unknown: 1843, unknown conditional: 0, unknown unconditional: 1843] , Statistics on independence cache: Total cache size (in pairs): 182, Positive cache size: 163, Positive conditional cache size: 0, Positive unconditional cache size: 163, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t597[2]; [L811] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t597={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] [L811] COND TRUE 0 asdf<2 [L811] FCALL, FORK 0 pthread_create(&t597[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t597[asdf], ((void *)0), P0, ((void *)0))=-3, t597={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] [L811] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t597={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] [L811] COND TRUE 0 asdf<2 [L811] FCALL, FORK 0 pthread_create(&t597[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t597[asdf], ((void *)0), P0, ((void *)0))=-2, t597={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] [L811] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t597={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] [L811] COND FALSE 0 !(asdf<2) [L812] 0 pthread_t t598[2]; [L813] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t597={5:0}, t598={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] [L813] COND TRUE 0 asdf<2 [L813] FCALL, FORK 0 pthread_create(&t598[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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(&t598[asdf], ((void *)0), P1, ((void *)0))=-1, t597={5:0}, t598={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] [L758] 3 x$w_buff1 = x$w_buff0 [L759] 3 x$w_buff0 = 2 [L760] 3 x$w_buff1_used = x$w_buff0_used [L761] 3 x$w_buff0_used = (_Bool)1 [L762] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L762] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L763] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 3 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L813] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t597={5:0}, t598={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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L813] COND TRUE 0 asdf<2 [L813] FCALL, FORK 0 pthread_create(&t598[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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(&t598[asdf], ((void *)0), P1, ((void *)0))=0, t597={5:0}, t598={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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L758] 4 x$w_buff1 = x$w_buff0 [L759] 4 x$w_buff0 = 2 [L760] 4 x$w_buff1_used = x$w_buff0_used [L761] 4 x$w_buff0_used = (_Bool)1 [L762] CALL 4 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND TRUE 4 !expression [L18] 4 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=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=2, x$w_buff0_used=1, x$w_buff1=2, x$w_buff1_used=1, x=0, y=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 5 procedures, 118 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: 3.2s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40 IncrementalHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 40 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=56occurred 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.1s 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, 136 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: 6.8s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 143 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 325 IncrementalHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 2 mSDtfsCounter, 325 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s 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.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 188 SizeOfPredicates, 0 NumberOfNonLiveVariables, 466 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 50/61 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, 136 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: 13.9s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 143 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 437 IncrementalHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 16 mSDtfsCounter, 437 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=5, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 101 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 188 SizeOfPredicates, 0 NumberOfNonLiveVariables, 343 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 30/36 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-03 23:24:46,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...